×

Found 597 Documents (Results 1–100)

100
MathJax

Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs. (English) Zbl 07405961

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 182-194 (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Isomorphisms of maps on the sphere. (English) Zbl 1468.05187

Cunningham, Gabriel (ed.) et al., Polytopes and discrete geometry. AMS special session, Northeastern University, Boston, MA, USA, April 21–22, 2018. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 764, 125-147 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Computing the one-visibility copnumber of trees. (English) Zbl 1482.05325

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 411-423 (2020).
MSC:  05C85 05C05
PDF BibTeX XML Cite
Full Text: DOI

Complexity of tree-coloring interval graphs equitably. (English) Zbl 1482.68183

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 391-398 (2020).
PDF BibTeX XML Cite
Full Text: DOI arXiv

On selecting leaves with disjoint neighborhoods in embedded trees. (English) Zbl 07115815

Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 189-200 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Data reduction for maximum matching on real-world graphs: theory and experiments. (English) Zbl 07378723

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 53, 13 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Practical lower and upper bounds for the shortest linear superstring. (English) Zbl 07286691

D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 18, 14 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

DynASP2.5: dynamic programming on tree decompositions in action. (English) Zbl 1443.68164

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 17, 13 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Uniform generation of random graphs with power-law degree sequences. (English) Zbl 1403.05136

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 1741-1758 (2018).
PDF BibTeX XML Cite
Full Text: arXiv Link

Jointly stable matchings. (English) Zbl 1457.90131

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 56, 12 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

A linear-time parameterized algorithm for node unique label cover. (English) Zbl 1442.68288

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 57, 15 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI arXiv

LZ-End parsing in linear time. (English) Zbl 1442.68050

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 53, 14 p. (2017).
MSC:  68P30 68W40
PDF BibTeX XML Cite
Full Text: DOI

Definability by Horn formulas and linear time on cellular automata. (English) Zbl 1442.68118

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 99, 14 p. (2017).
MSC:  68Q80 03B25 68Q25
PDF BibTeX XML Cite
Full Text: DOI

Edge-orders. (English) Zbl 1441.68195

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 75, 14 p. (2017).
MSC:  68R10 05C85 68W40
PDF BibTeX XML Cite
Full Text: DOI

The power of linear-time data reduction for maximum matching. (English) Zbl 1441.68192

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 46, 14 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Dividing splittable goods evenly and with limited fragmentation. (English) Zbl 1441.05209

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 9, 13 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Online matroid intersection: beating half for random arrival. (English) Zbl 1418.90227

Eisenbrand, Friedrich (ed.) et al., Integer programming and combinatorial optimization. 19th international conference, IPCO 2017, Waterloo, ON, Canada, June 26–28, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10328, 241-253 (2017).
MSC:  90C27
PDF BibTeX XML Cite
Full Text: DOI arXiv

A linear-time algorithm for integral multiterminal flows in trees. (English) Zbl 1398.05206

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 62, 12 p. (2016).
MSC:  05C85 05C21 90C35
PDF BibTeX XML Cite
Full Text: DOI arXiv

Approximating dynamic time warping and edit distance for a pair of point sequences. (English) Zbl 1387.68226

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 6, 16 p. (2016).
MSC:  68U05 68Q25
PDF BibTeX XML Cite
Full Text: DOI arXiv

Linear time algorithm for quantum 2SAT. (English) Zbl 1388.68064

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 15, 14 p. (2016).
MSC:  68Q12
PDF BibTeX XML Cite
Full Text: DOI arXiv

Linear-time suffix sorting – a new approach for suffix array construction. (English) Zbl 1380.68164

Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 23, 12 p. (2016).
MSC:  68P10 68W32 68W40
PDF BibTeX XML Cite
Full Text: DOI

Direct reading algorithm for hierarchical clustering. (English) Zbl 1404.68041

Korpelainen, Nicholas (ed.), TCDM 2016. Proceedings of the 1st IMA conference on theoretical and computational discrete mathematics, University of Derby, Derby, UK, March 22–23, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 56, 37-42 (2016).
MSC:  68P99 62H30 68Q25
PDF BibTeX XML Cite
Full Text: DOI Link

Whom to befriend to influence people. (English) Zbl 1446.91050

Suomela, Jukka (ed.), Structural information and communication complexity. 23rd international colloquium, SIROCCO 2016, Helsinki, Finland, July 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9988, 340-357 (2016).
MSC:  91D30 68Q17 68W40
PDF BibTeX XML Cite
Full Text: DOI arXiv

Linear-time fitting of a \(k\)-step function. (English) Zbl 1437.68182

Govindarajan, Sathish (ed.) et al., Algorithms and discrete applied mathematics. Second international conference, CALDAM 2016, Thiruvananthapuram, India, February 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9602, 85-96 (2016).
MSC:  68U05 68W40
PDF BibTeX XML Cite
Full Text: DOI arXiv

Approximating the regular graphic TSP in near linear time. (English) Zbl 1366.68365

Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 125-135 (2015).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Matrix equations and model reduction. (English) Zbl 1332.65083

Bai, Zhaojun (ed.) et al., Matrix functions and matrix equations. Lectures of the 4th Gene Golub summer school, Shanghai, China, July 22 – August 2, 2013. Hackensack, NJ: World Scientific; Beijing: Higher Education Press (ISBN 978-981-4675-76-5/hbk; 978-981-4675-78-9/ebook). Series in Contemporary Applied Mathematics CAM 19, 50-75 (2015).
MSC:  65K10 93C05 65F30 15A24
PDF BibTeX XML Cite
Full Text: DOI Link

Finding articulation points of large graphs in linear time. (English) Zbl 1451.68201

Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 363-372 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Contact representations of graphs in 3D. (English) Zbl 1444.68130

Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 14-27 (2015).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Deterministic global minimum cut of a simple graph in near-linear time. (English) Zbl 1321.05268

Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 665-674 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software