30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 1-1406, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{chechik_et_al:LIPIcs.ESA.2022, title = {{LIPIcs, Volume 244, ESA 2022, Complete Volume}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {1--1406}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022}, URN = {urn:nbn:de:0030-drops-169374}, doi = {10.4230/LIPIcs.ESA.2022}, annote = {Keywords: LIPIcs, Volume 244, ESA 2022, Complete Volume} }
30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 0:i-0:xxii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chechik_et_al:LIPIcs.ESA.2022.0, author = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {0:i--0:xxii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.0}, URN = {urn:nbn:de:0030-drops-169382}, doi = {10.4230/LIPIcs.ESA.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, and Kevin Mann. Enumerating Minimal Connected Dominating Sets. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{abukhzam_et_al:LIPIcs.ESA.2022.1, author = {Abu-Khzam, Faisal N. and Fernau, Henning and Gras, Benjamin and Liedloff, Mathieu and Mann, Kevin}, title = {{Enumerating Minimal Connected Dominating Sets}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {1:1--1:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.1}, URN = {urn:nbn:de:0030-drops-169390}, doi = {10.4230/LIPIcs.ESA.2022.1}, annote = {Keywords: enumeration problems, connected domination, degenerate graphs} }
Raghavendra Addanki, Andrew McGregor, and Cameron Musco. Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 2:1-2:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{addanki_et_al:LIPIcs.ESA.2022.2, author = {Addanki, Raghavendra and McGregor, Andrew and Musco, Cameron}, title = {{Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {2:1--2:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.2}, URN = {urn:nbn:de:0030-drops-169400}, doi = {10.4230/LIPIcs.ESA.2022.2}, annote = {Keywords: sublinear graph algorithms, bipartite independent set queries, edge sampling and counting, graph connectivity, query adaptivity} }
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein. Hardness of Token Swapping on Trees. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{aichholzer_et_al:LIPIcs.ESA.2022.3, author = {Aichholzer, Oswin and Demaine, Erik D. and Korman, Matias and Lubiw, Anna and Lynch, Jayson and Mas\'{a}rov\'{a}, Zuzana and Rudoy, Mikhail and Vassilevska Williams, Virginia and Wein, Nicole}, title = {{Hardness of Token Swapping on Trees}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.3}, URN = {urn:nbn:de:0030-drops-169413}, doi = {10.4230/LIPIcs.ESA.2022.3}, annote = {Keywords: Sorting, Token swapping, Trees, NP-hard, Approximation} }
Susanne Albers and Sebastian Schubert. Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 4:1-4:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{albers_et_al:LIPIcs.ESA.2022.4, author = {Albers, Susanne and Schubert, Sebastian}, title = {{Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.4}, URN = {urn:nbn:de:0030-drops-169420}, doi = {10.4230/LIPIcs.ESA.2022.4}, annote = {Keywords: online algorithms, deterministic algorithms, primal-dual analysis, b-matching, bounded-degree graph, variable vertex capacities, unweighted matching, vertex-weighted matching} }
Henk Alkema, Mark de Berg, Morteza Monemizadeh, and Leonidas Theocharous. TSP in a Simple Polygon. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 5:1-5:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{alkema_et_al:LIPIcs.ESA.2022.5, author = {Alkema, Henk and de Berg, Mark and Monemizadeh, Morteza and Theocharous, Leonidas}, title = {{TSP in a Simple Polygon}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.5}, URN = {urn:nbn:de:0030-drops-169434}, doi = {10.4230/LIPIcs.ESA.2022.5}, annote = {Keywords: Traveling Salesman Problem, Subexponential algorithms, TSP with obstacles} }
Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, and Miklos Santha. Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{allcock_et_al:LIPIcs.ESA.2022.6, author = {Allcock, Jonathan and Hamoudi, Yassine and Joux, Antoine and Klingelh\"{o}fer, Felix and Santha, Miklos}, title = {{Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.6}, URN = {urn:nbn:de:0030-drops-169444}, doi = {10.4230/LIPIcs.ESA.2022.6}, annote = {Keywords: Quantum algorithm, classical algorithm, dynamic programming, representation technique, subset-sum, equal-sum, shifted-sum} }
Georg Anegg, Laura Vargas Koch, and Rico Zenklusen. Techniques for Generalized Colorful k-Center Problems. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{anegg_et_al:LIPIcs.ESA.2022.7, author = {Anegg, Georg and Vargas Koch, Laura and Zenklusen, Rico}, title = {{Techniques for Generalized Colorful k-Center Problems}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {7:1--7:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.7}, URN = {urn:nbn:de:0030-drops-169458}, doi = {10.4230/LIPIcs.ESA.2022.7}, annote = {Keywords: Approximation Algorithms, Fair Clustering, Colorful k-Center} }
Mohammad Ansari, Mohammad Saneian, and Hamid Zarrabi-Zadeh. Simple Streaming Algorithms for Edge Coloring. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 8:1-8:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ansari_et_al:LIPIcs.ESA.2022.8, author = {Ansari, Mohammad and Saneian, Mohammad and Zarrabi-Zadeh, Hamid}, title = {{Simple Streaming Algorithms for Edge Coloring}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {8:1--8:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.8}, URN = {urn:nbn:de:0030-drops-169468}, doi = {10.4230/LIPIcs.ESA.2022.8}, annote = {Keywords: Edge coloring, streaming model, adversarial order} }
Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, and Antonis Skarlatos. Computing Smallest Convex Intersecting Polygons. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 9:1-9:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{antoniadis_et_al:LIPIcs.ESA.2022.9, author = {Antoniadis, Antonios and de Berg, Mark and Kisfaludi-Bak, S\'{a}ndor and Skarlatos, Antonis}, title = {{Computing Smallest Convex Intersecting Polygons}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {9:1--9:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.9}, URN = {urn:nbn:de:0030-drops-169470}, doi = {10.4230/LIPIcs.ESA.2022.9}, annote = {Keywords: convex hull, imprecise points, computational geometry} }
Anna Arutyunova and Heiko Röglin. The Price of Hierarchical Clustering. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{arutyunova_et_al:LIPIcs.ESA.2022.10, author = {Arutyunova, Anna and R\"{o}glin, Heiko}, title = {{The Price of Hierarchical Clustering}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.10}, URN = {urn:nbn:de:0030-drops-169487}, doi = {10.4230/LIPIcs.ESA.2022.10}, annote = {Keywords: Hierarchical Clustering, approximation Algorithms, k-center Problem} }
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, and Alexander Wolff. Bounding and Computing Obstacle Numbers of Graphs. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{balko_et_al:LIPIcs.ESA.2022.11, author = {Balko, Martin and Chaplick, Steven and Ganian, Robert and Gupta, Siddharth and Hoffmann, Michael and Valtr, Pavel and Wolff, Alexander}, title = {{Bounding and Computing Obstacle Numbers of Graphs}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.11}, URN = {urn:nbn:de:0030-drops-169495}, doi = {10.4230/LIPIcs.ESA.2022.11}, annote = {Keywords: Obstacle representation, Obstacle number, Visibility, NP-hardness, FPT} }
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, and Takaaki Nishimoto. Computing NP-Hard Repetitiveness Measures via MAX-SAT. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bannai_et_al:LIPIcs.ESA.2022.12, author = {Bannai, Hideo and Goto, Keisuke and Ishihata, Masakazu and Kanda, Shunsuke and K\"{o}ppl, Dominik and Nishimoto, Takaaki}, title = {{Computing NP-Hard Repetitiveness Measures via MAX-SAT}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.12}, URN = {urn:nbn:de:0030-drops-169505}, doi = {10.4230/LIPIcs.ESA.2022.12}, annote = {Keywords: repetitiveness measures, string attractor, bidirectional macro scheme} }
Nikhil Bansal and Christian Coester. Online Metric Allocation and Time-Varying Regularization. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bansal_et_al:LIPIcs.ESA.2022.13, author = {Bansal, Nikhil and Coester, Christian}, title = {{Online Metric Allocation and Time-Varying Regularization}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.13}, URN = {urn:nbn:de:0030-drops-169515}, doi = {10.4230/LIPIcs.ESA.2022.13}, annote = {Keywords: Online algorithms, competitive analysis, k-server, metrical task systems, mirror descent, regularization} }
Florian Barth, Stefan Funke, and Claudius Proissl. An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 14:1-14:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{barth_et_al:LIPIcs.ESA.2022.14, author = {Barth, Florian and Funke, Stefan and Proissl, Claudius}, title = {{An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.14}, URN = {urn:nbn:de:0030-drops-169525}, doi = {10.4230/LIPIcs.ESA.2022.14}, annote = {Keywords: Parametric Shortest Paths, Extreme Shortest Paths} }
Valentin Bartier, Nicolas Bousquet, and Amer E. Mouawad. Galactic Token Sliding. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 15:1-15:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bartier_et_al:LIPIcs.ESA.2022.15, author = {Bartier, Valentin and Bousquet, Nicolas and Mouawad, Amer E.}, title = {{Galactic Token Sliding}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {15:1--15:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.15}, URN = {urn:nbn:de:0030-drops-169535}, doi = {10.4230/LIPIcs.ESA.2022.15}, annote = {Keywords: reconfiguration, independent set, galactic reconfiguration, sparse graphs, token sliding, parameterized complexity} }
Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul A. Chowdhury, Rob Johnson, Rishab Nithyanand, and Michael A. Bender. When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 16:1-16:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhattacharya_et_al:LIPIcs.ESA.2022.16, author = {Bhattacharya, Arghya and Chowdhury, Abiyaz and Xu, Helen and Das, Rathish and Chowdhury, Rezaul A. and Johnson, Rob and Nithyanand, Rishab and Bender, Michael A.}, title = {{When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {16:1--16:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.16}, URN = {urn:nbn:de:0030-drops-169543}, doi = {10.4230/LIPIcs.ESA.2022.16}, annote = {Keywords: Cache-adaptive algorithms, cache-oblivious algorithms} }
Sayan Bhattacharya, Thatchaphol Saranurak, and Pattara Sukprasert. Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 17:1-17:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhattacharya_et_al:LIPIcs.ESA.2022.17, author = {Bhattacharya, Sayan and Saranurak, Thatchaphol and Sukprasert, Pattara}, title = {{Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {17:1--17:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.17}, URN = {urn:nbn:de:0030-drops-169555}, doi = {10.4230/LIPIcs.ESA.2022.17}, annote = {Keywords: Algorithms, Dynamic Algorithms, Spanners, Recourse} }
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, and Csaba D. Tóth. Online Spanners in Metric Spaces. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhore_et_al:LIPIcs.ESA.2022.18, author = {Bhore, Sujoy and Filtser, Arnold and Khodabandeh, Hadi and T\'{o}th, Csaba D.}, title = {{Online Spanners in Metric Spaces}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {18:1--18:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.18}, URN = {urn:nbn:de:0030-drops-169564}, doi = {10.4230/LIPIcs.ESA.2022.18}, annote = {Keywords: spanner, online algorithm, lightness, sparsity, minimum weight} }
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, and Mirko Rossi. Sparse Temporal Spanners with Low Stretch. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bilo_et_al:LIPIcs.ESA.2022.19, author = {Bil\`{o}, Davide and D'Angelo, Gianlorenzo and Gual\`{a}, Luciano and Leucci, Stefano and Rossi, Mirko}, title = {{Sparse Temporal Spanners with Low Stretch}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.19}, URN = {urn:nbn:de:0030-drops-169575}, doi = {10.4230/LIPIcs.ESA.2022.19}, annote = {Keywords: temporal spanners, temporal graphs, graph sparsification, approximate distances} }
Daniel Blankenburg. Resource Sharing Revisited: Local Weak Duality and Optimal Convergence. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{blankenburg:LIPIcs.ESA.2022.20, author = {Blankenburg, Daniel}, title = {{Resource Sharing Revisited: Local Weak Duality and Optimal Convergence}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.20}, URN = {urn:nbn:de:0030-drops-169582}, doi = {10.4230/LIPIcs.ESA.2022.20}, annote = {Keywords: Resource sharing, Dantzig-Wolfe-type algorithms, Decreasing minimization} }
Thomas Bläsius and Philipp Fischbeck. On the External Validity of Average-Case Analyses of Graph Algorithms. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{blasius_et_al:LIPIcs.ESA.2022.21, author = {Bl\"{a}sius, Thomas and Fischbeck, Philipp}, title = {{On the External Validity of Average-Case Analyses of Graph Algorithms}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.21}, URN = {urn:nbn:de:0030-drops-169590}, doi = {10.4230/LIPIcs.ESA.2022.21}, annote = {Keywords: Average Case, Network Models, Empirical Evaluation} }
Václav Blažej, Pratibha Choudhary, Dušan Knop, Šimon Schierreich, Ondřej Suchý, and Tomáš Valla. On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{blazej_et_al:LIPIcs.ESA.2022.22, author = {Bla\v{z}ej, V\'{a}clav and Choudhary, Pratibha and Knop, Du\v{s}an and Schierreich, \v{S}imon and Such\'{y}, Ond\v{r}ej and Valla, Tom\'{a}\v{s}}, title = {{On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.22}, URN = {urn:nbn:de:0030-drops-169600}, doi = {10.4230/LIPIcs.ESA.2022.22}, annote = {Keywords: Traveling Salesperson, Subset TSP, Waypoint Routing, Kernelization} }
Kobi Bodek and Moran Feldman. Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 23:1-23:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bodek_et_al:LIPIcs.ESA.2022.23, author = {Bodek, Kobi and Feldman, Moran}, title = {{Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {23:1--23:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.23}, URN = {urn:nbn:de:0030-drops-169618}, doi = {10.4230/LIPIcs.ESA.2022.23}, annote = {Keywords: Unconstrained submodular maximization, regularization, double greedy, non-oblivious local search, inapproximability} }
Hans L. Bodlaender, Carla Groenland, and Hugo Jacob. List Colouring Trees in Logarithmic Space. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bodlaender_et_al:LIPIcs.ESA.2022.24, author = {Bodlaender, Hans L. and Groenland, Carla and Jacob, Hugo}, title = {{List Colouring Trees in Logarithmic Space}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.24}, URN = {urn:nbn:de:0030-drops-169620}, doi = {10.4230/LIPIcs.ESA.2022.24}, annote = {Keywords: List colouring, trees, space complexity, logspace, graph algorithms, tree-partition-width} }
Bartłomiej Bosek and Anna Zych-Pawlewicz. Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bosek_et_al:LIPIcs.ESA.2022.25, author = {Bosek, Bart{\l}omiej and Zych-Pawlewicz, Anna}, title = {{Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.25}, URN = {urn:nbn:de:0030-drops-169637}, doi = {10.4230/LIPIcs.ESA.2022.25}, annote = {Keywords: dynamic algorithms, unit interval graphs, coloring, recourse budget, parametrized dynamic algorithms} }
Łukasz Bożyk and Michał Pilipczuk. Polynomial Kernel for Immersion Hitting in Tournaments. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 26:1-26:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bozyk_et_al:LIPIcs.ESA.2022.26, author = {Bo\.{z}yk, {\L}ukasz and Pilipczuk, Micha{\l}}, title = {{Polynomial Kernel for Immersion Hitting in Tournaments}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {26:1--26:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.26}, URN = {urn:nbn:de:0030-drops-169642}, doi = {10.4230/LIPIcs.ESA.2022.26}, annote = {Keywords: kernelization, graph immersion, tournament, protrusion} }
Jendrik Brachter and Pascal Schweitzer. A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{brachter_et_al:LIPIcs.ESA.2022.27, author = {Brachter, Jendrik and Schweitzer, Pascal}, title = {{A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.27}, URN = {urn:nbn:de:0030-drops-169653}, doi = {10.4230/LIPIcs.ESA.2022.27}, annote = {Keywords: group isomorphism problem, Weisfeiler-Leman algorithms, group invariants, direct product decompositions} }
Frederik Brüning, Jacobus Conradi, and Anne Driemel. Faster Approximate Covering of Subcurves Under the Fréchet Distance. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bruning_et_al:LIPIcs.ESA.2022.28, author = {Br\"{u}ning, Frederik and Conradi, Jacobus and Driemel, Anne}, title = {{Faster Approximate Covering of Subcurves Under the Fr\'{e}chet Distance}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.28}, URN = {urn:nbn:de:0030-drops-169660}, doi = {10.4230/LIPIcs.ESA.2022.28}, annote = {Keywords: Clustering, Set cover, Fr\'{e}chet distance, Approximation algorithms} }
Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, and Frank Staals. Efficient Fréchet Distance Queries for Segments. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 29:1-29:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{buchin_et_al:LIPIcs.ESA.2022.29, author = {Buchin, Maike and van der Hoog, Ivor and Ophelders, Tim and Schlipf, Lena and Silveira, Rodrigo I. and Staals, Frank}, title = {{Efficient Fr\'{e}chet Distance Queries for Segments}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {29:1--29:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.29}, URN = {urn:nbn:de:0030-drops-169671}, doi = {10.4230/LIPIcs.ESA.2022.29}, annote = {Keywords: Computational Geometry, Data Structures, Fr\'{e}chet distance} }
Benjamin Merlin Bumpus, Bart M. P. Jansen, and Jari J. H. de Kroon. Search-Space Reduction via Essential Vertices. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bumpus_et_al:LIPIcs.ESA.2022.30, author = {Bumpus, Benjamin Merlin and Jansen, Bart M. P. and de Kroon, Jari J. H.}, title = {{Search-Space Reduction via Essential Vertices}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.30}, URN = {urn:nbn:de:0030-drops-169687}, doi = {10.4230/LIPIcs.ESA.2022.30}, annote = {Keywords: fixed-parameter tractability, essential vertices, covering versus packing} }
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, and Lucia Williams. Width Helps and Hinders Splitting Flows. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 31:1-31:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{caceres_et_al:LIPIcs.ESA.2022.31, author = {C\'{a}ceres, Manuel and Cairo, Massimo and Grigorjew, Andreas and Khan, Shahbaz and Mumey, Brendan and Rizzi, Romeo and Tomescu, Alexandru I. and Williams, Lucia}, title = {{Width Helps and Hinders Splitting Flows}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.31}, URN = {urn:nbn:de:0030-drops-169695}, doi = {10.4230/LIPIcs.ESA.2022.31}, annote = {Keywords: Flow decomposition, approximation algorithms, graph width} }
Amit Chakrabarti and Themistoklis Haris. Counting Simplices in Hypergraph Streams. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 32:1-32:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chakrabarti_et_al:LIPIcs.ESA.2022.32, author = {Chakrabarti, Amit and Haris, Themistoklis}, title = {{Counting Simplices in Hypergraph Streams}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {32:1--32:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.32}, URN = {urn:nbn:de:0030-drops-169705}, doi = {10.4230/LIPIcs.ESA.2022.32}, annote = {Keywords: data streaming, graph algorithms, hypergraphs, sub-linear algorithms, triangle counting} }
Deeparnab Chakrabarty, Maryam Negahbani, and Ankita Sarkar. Approximation Algorithms for Continuous Clustering and Facility Location Problems. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 33:1-33:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chakrabarty_et_al:LIPIcs.ESA.2022.33, author = {Chakrabarty, Deeparnab and Negahbani, Maryam and Sarkar, Ankita}, title = {{Approximation Algorithms for Continuous Clustering and Facility Location Problems}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {33:1--33:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.33}, URN = {urn:nbn:de:0030-drops-169710}, doi = {10.4230/LIPIcs.ESA.2022.33}, annote = {Keywords: Approximation Algorithms, Clustering, Facility Location, Fairness, Outliers} }
Sourav Chakraborty, N. V. Vinodchandran¹, and Kuldeep S. Meel. Distinct Elements in Streams: An Algorithm for the (Text) Book. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 34:1-34:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chakraborty_et_al:LIPIcs.ESA.2022.34, author = {Chakraborty, Sourav and Vinodchandran¹, N. V. and Meel, Kuldeep S.}, title = {{Distinct Elements in Streams: An Algorithm for the (Text) Book}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {34:1--34:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.34}, URN = {urn:nbn:de:0030-drops-169725}, doi = {10.4230/LIPIcs.ESA.2022.34}, annote = {Keywords: F₀ Estimation, Streaming, Sampling} }
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba. Approximate Circular Pattern Matching. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 35:1-35:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{charalampopoulos_et_al:LIPIcs.ESA.2022.35, author = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Radoszewski, Jakub and Pissis, Solon P. and Rytter, Wojciech and Wale\'{n}, Tomasz and Zuba, Wiktor}, title = {{Approximate Circular Pattern Matching}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {35:1--35:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.35}, URN = {urn:nbn:de:0030-drops-169738}, doi = {10.4230/LIPIcs.ESA.2022.35}, annote = {Keywords: approximate circular pattern matching, Hamming distance, edit distance} }
Jiehua Chen and Sanjukta Roy. Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.ESA.2022.36, author = {Chen, Jiehua and Roy, Sanjukta}, title = {{Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.36}, URN = {urn:nbn:de:0030-drops-169741}, doi = {10.4230/LIPIcs.ESA.2022.36}, annote = {Keywords: stable matchings, multidimensional stable roommates, Euclidean preferences, coalition formation games, stable cores, NP-hardness} }
Markus Chimani and Finn Stutzenstein. Spanner Approximations in Practice. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 37:1-37:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chimani_et_al:LIPIcs.ESA.2022.37, author = {Chimani, Markus and Stutzenstein, Finn}, title = {{Spanner Approximations in Practice}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {37:1--37:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.37}, URN = {urn:nbn:de:0030-drops-169750}, doi = {10.4230/LIPIcs.ESA.2022.37}, annote = {Keywords: Graph spanners, experimental study, algorithm engineering} }
Radu Curticapean. Determinants from Homomorphisms. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 38:1-38:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{curticapean:LIPIcs.ESA.2022.38, author = {Curticapean, Radu}, title = {{Determinants from Homomorphisms}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {38:1--38:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.38}, URN = {urn:nbn:de:0030-drops-169767}, doi = {10.4230/LIPIcs.ESA.2022.38}, annote = {Keywords: determinant, homomorphisms, matrix trace, Newton identities} }
Justin Dallant and John Iacono. Conditional Lower Bounds for Dynamic Geometric Measure Problems. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 39:1-39:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dallant_et_al:LIPIcs.ESA.2022.39, author = {Dallant, Justin and Iacono, John}, title = {{Conditional Lower Bounds for Dynamic Geometric Measure Problems}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {39:1--39:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.39}, URN = {urn:nbn:de:0030-drops-169777}, doi = {10.4230/LIPIcs.ESA.2022.39}, annote = {Keywords: Computational geometry, Fine-grained complexity, Dynamic data structures} }
Syamantak Das and Andreas Wiese. A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 40:1-40:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{das_et_al:LIPIcs.ESA.2022.40, author = {Das, Syamantak and Wiese, Andreas}, title = {{A Simpler QPTAS for Scheduling Jobs with Precedence Constraints}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {40:1--40:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.40}, URN = {urn:nbn:de:0030-drops-169782}, doi = {10.4230/LIPIcs.ESA.2022.40}, annote = {Keywords: makespan minimization, precedence constraints, QPTAS} }
Argyrios Deligkas, Michail Fasoulakis, and Evangelos Markakis. A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 41:1-41:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{deligkas_et_al:LIPIcs.ESA.2022.41, author = {Deligkas, Argyrios and Fasoulakis, Michail and Markakis, Evangelos}, title = {{A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {41:1--41:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.41}, URN = {urn:nbn:de:0030-drops-169790}, doi = {10.4230/LIPIcs.ESA.2022.41}, annote = {Keywords: bimatrix games, approximate Nash equilibria} }
Dipan Dey and Manoj Gupta. Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 42:1-42:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dey_et_al:LIPIcs.ESA.2022.42, author = {Dey, Dipan and Gupta, Manoj}, title = {{Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {42:1--42:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.42}, URN = {urn:nbn:de:0030-drops-169800}, doi = {10.4230/LIPIcs.ESA.2022.42}, annote = {Keywords: distance sensitivity oracle, single-source replacement paths} }
Tamal K. Dey and Tao Hou. Fast Computation of Zigzag Persistence. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 43:1-43:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dey_et_al:LIPIcs.ESA.2022.43, author = {Dey, Tamal K. and Hou, Tao}, title = {{Fast Computation of Zigzag Persistence}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {43:1--43:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.43}, URN = {urn:nbn:de:0030-drops-169813}, doi = {10.4230/LIPIcs.ESA.2022.43}, annote = {Keywords: zigzag persistence, persistent homology, fast computation} }
Alexander Dobler, Manuel Sorge, and Anaïs Villedieu. Turbocharging Heuristics for Weak Coloring Numbers. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 44:1-44:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dobler_et_al:LIPIcs.ESA.2022.44, author = {Dobler, Alexander and Sorge, Manuel and Villedieu, Ana\"{i}s}, title = {{Turbocharging Heuristics for Weak Coloring Numbers}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {44:1--44:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.44}, URN = {urn:nbn:de:0030-drops-169820}, doi = {10.4230/LIPIcs.ESA.2022.44}, annote = {Keywords: Structural sparsity, parameterized algorithms, parameterized complexity, fixed-parameter tractability} }
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G.C. Resende, and Quico Spaen. A Local Search Algorithm for Large Maximum Weight Independent Set Problems. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 45:1-45:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dong_et_al:LIPIcs.ESA.2022.45, author = {Dong, Yuanyuan and Goldberg, Andrew V. and Noe, Alexander and Parotsidis, Nikos and Resende, Mauricio G.C. and Spaen, Quico}, title = {{A Local Search Algorithm for Large Maximum Weight Independent Set Problems}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {45:1--45:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.45}, URN = {urn:nbn:de:0030-drops-169839}, doi = {10.4230/LIPIcs.ESA.2022.45}, annote = {Keywords: GRASP, local search, maximum-weight independent set, path-relinking, heuristic, metaheuristic} }
Jan Dreier, Sebastian Ordyniak, and Stefan Szeider. SAT Backdoors: Depth Beats Size. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 46:1-46:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dreier_et_al:LIPIcs.ESA.2022.46, author = {Dreier, Jan and Ordyniak, Sebastian and Szeider, Stefan}, title = {{SAT Backdoors: Depth Beats Size}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {46:1--46:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.46}, URN = {urn:nbn:de:0030-drops-169840}, doi = {10.4230/LIPIcs.ESA.2022.46}, annote = {Keywords: satisfiability, backdoor (depth)} }
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, and Stefan Szeider. Finding a Cluster in Incomplete Data. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 47:1-47:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{eiben_et_al:LIPIcs.ESA.2022.47, author = {Eiben, Eduard and Ganian, Robert and Kanj, Iyad and Ordyniak, Sebastian and Szeider, Stefan}, title = {{Finding a Cluster in Incomplete Data}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.47}, URN = {urn:nbn:de:0030-drops-169858}, doi = {10.4230/LIPIcs.ESA.2022.47}, annote = {Keywords: Parameterized complexity, incomplete data, clustering} }
Jonas Ellert. Lyndon Arrays Simplified. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 48:1-48:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ellert:LIPIcs.ESA.2022.48, author = {Ellert, Jonas}, title = {{Lyndon Arrays Simplified}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {48:1--48:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.48}, URN = {urn:nbn:de:0030-drops-169863}, doi = {10.4230/LIPIcs.ESA.2022.48}, annote = {Keywords: Lyndon table, Lyndon array, Lyndon word, nearest smaller suffixes, lexicographical ordering, general ordered alphabets, combinatorial algorithms} }
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schlöter. Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 49:1-49:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{erlebach_et_al:LIPIcs.ESA.2022.49, author = {Erlebach, Thomas and de Lima, Murilo Santos and Megow, Nicole and Schl\"{o}ter, Jens}, title = {{Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {49:1--49:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.49}, URN = {urn:nbn:de:0030-drops-169872}, doi = {10.4230/LIPIcs.ESA.2022.49}, annote = {Keywords: explorable uncertainty, queries, untrusted predictions} }
Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, and Roohani Sharma. Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 50:1-50:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{esmer_et_al:LIPIcs.ESA.2022.50, author = {Esmer, Bar{\i}\c{s} Can and Kulik, Ariel and Marx, D\'{a}niel and Neuen, Daniel and Sharma, Roohani}, title = {{Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {50:1--50:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.50}, URN = {urn:nbn:de:0030-drops-169887}, doi = {10.4230/LIPIcs.ESA.2022.50}, annote = {Keywords: parameterized approximations, exponential approximations, monotone local search} }
Esther Ezra and Micha Sharir. Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 51:1-51:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ezra_et_al:LIPIcs.ESA.2022.51, author = {Ezra, Esther and Sharir, Micha}, title = {{Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {51:1--51:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.51}, URN = {urn:nbn:de:0030-drops-169895}, doi = {10.4230/LIPIcs.ESA.2022.51}, annote = {Keywords: Computational geometry, Ray shooting, Tetrahedra in \{\mathbb{R}\}⁴, Intersection queries in \{\mathbb{R}\}⁴, Polynomial partitioning, Range searching, Semi-algebraic sets, Tradeoff} }
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, and Rico Zenklusen. Submodular Maximization Subject to Matroid Intersection on the Fly. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 52:1-52:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{feldman_et_al:LIPIcs.ESA.2022.52, author = {Feldman, Moran and Norouzi-Fard, Ashkan and Svensson, Ola and Zenklusen, Rico}, title = {{Submodular Maximization Subject to Matroid Intersection on the Fly}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {52:1--52:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.52}, URN = {urn:nbn:de:0030-drops-169902}, doi = {10.4230/LIPIcs.ESA.2022.52}, annote = {Keywords: Submodular Maximization, Matroid Intersection, Streaming Algorithms} }
Aleksander Figiel, Vincent Froese, André Nichterlein, and Rolf Niedermeier. There and Back Again: On Applying Data Reduction Rules by Undoing Others. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 53:1-53:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{figiel_et_al:LIPIcs.ESA.2022.53, author = {Figiel, Aleksander and Froese, Vincent and Nichterlein, Andr\'{e} and Niedermeier, Rolf}, title = {{There and Back Again: On Applying Data Reduction Rules by Undoing Others}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {53:1--53:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.53}, URN = {urn:nbn:de:0030-drops-169914}, doi = {10.4230/LIPIcs.ESA.2022.53}, annote = {Keywords: Kernelization, Preprocessing, Vertex Cover} }
Alejandro Flores-Velazco. Improved Search of Relevant Points for Nearest-Neighbor Classification. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 54:1-54:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{floresvelazco:LIPIcs.ESA.2022.54, author = {Flores-Velazco, Alejandro}, title = {{Improved Search of Relevant Points for Nearest-Neighbor Classification}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {54:1--54:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.54}, URN = {urn:nbn:de:0030-drops-169922}, doi = {10.4230/LIPIcs.ESA.2022.54}, annote = {Keywords: nearest-neighbor classification, nearest-neighbor rule, decision boundaries, border points, relevant points} }
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, and Kirill Simonov. Longest Cycle Above Erdős-Gallai Bound. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 55:1-55:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fomin_et_al:LIPIcs.ESA.2022.55, author = {Fomin, Fedor V. and Golovach, Petr A. and Sagunov, Danil and Simonov, Kirill}, title = {{Longest Cycle Above Erd\H{o}s-Gallai Bound}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.55}, URN = {urn:nbn:de:0030-drops-169935}, doi = {10.4230/LIPIcs.ESA.2022.55}, annote = {Keywords: Longest path, longest cycle, fixed-parameter tractability, above guarantee parameterization, average degree, Erd\H{o}s and Gallai theorem} }
Zachary Friggstad and Mahya Jamshidian. Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 56:1-56:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{friggstad_et_al:LIPIcs.ESA.2022.56, author = {Friggstad, Zachary and Jamshidian, Mahya}, title = {{Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.56}, URN = {urn:nbn:de:0030-drops-169946}, doi = {10.4230/LIPIcs.ESA.2022.56}, annote = {Keywords: Approximation Algorithms, Clustering, Linear Programming} }
Travis Gagie. Simple Worst-Case Optimal Adaptive Prefix-Free Coding. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 57:1-57:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gagie:LIPIcs.ESA.2022.57, author = {Gagie, Travis}, title = {{Simple Worst-Case Optimal Adaptive Prefix-Free Coding}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {57:1--57:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.57}, URN = {urn:nbn:de:0030-drops-169959}, doi = {10.4230/LIPIcs.ESA.2022.57}, annote = {Keywords: Adaptive prefix-free coding, Shannon coding, Lookup tables} }
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Paweł Rzążewski, and Uéverton S. Souza. Taming Graphs with No Large Creatures and Skinny Ladders. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 58:1-58:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gajarsky_et_al:LIPIcs.ESA.2022.58, author = {Gajarsk\'{y}, Jakub and Jaffke, Lars and Lima, Paloma T. and Novotn\'{a}, Jana and Pilipczuk, Marcin and Rz\k{a}\.{z}ewski, Pawe{\l} and Souza, U\'{e}verton S.}, title = {{Taming Graphs with No Large Creatures and Skinny Ladders}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {58:1--58:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.58}, URN = {urn:nbn:de:0030-drops-169969}, doi = {10.4230/LIPIcs.ESA.2022.58}, annote = {Keywords: Minimal separator, hereditary graph class} }
Younan Gao and Meng He. Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 59:1-59:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gao_et_al:LIPIcs.ESA.2022.59, author = {Gao, Younan and He, Meng}, title = {{Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.59}, URN = {urn:nbn:de:0030-drops-169971}, doi = {10.4230/LIPIcs.ESA.2022.59}, annote = {Keywords: min-plus product, range mode queries, range least frequent queries, path queries, colored path counting, path mode queries, path least frequent queries} }
Loukas Georgiadis, Giuseppe F. Italiano, and Evangelos Kosinas. Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 60:1-60:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{georgiadis_et_al:LIPIcs.ESA.2022.60, author = {Georgiadis, Loukas and Italiano, Giuseppe F. and Kosinas, Evangelos}, title = {{Computing the 4-Edge-Connected Components of a Graph: An Experimental Study}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {60:1--60:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.60}, URN = {urn:nbn:de:0030-drops-169988}, doi = {10.4230/LIPIcs.ESA.2022.60}, annote = {Keywords: Connectivity Cuts, Edge Connectivity, Graph Algorithms} }
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, and Yota Otachi. Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 61:1-61:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gima_et_al:LIPIcs.ESA.2022.61, author = {Gima, Tatsuya and Ito, Takehiro and Kobayashi, Yasuaki and Otachi, Yota}, title = {{Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {61:1--61:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.61}, URN = {urn:nbn:de:0030-drops-169991}, doi = {10.4230/LIPIcs.ESA.2022.61}, annote = {Keywords: Combinatorial reconfiguration, monadic second-order logic, fixed-parameter tractability, treedepth, neighborhood diversity} }
Miriam Goetze, Paul Jungeblut, and Torsten Ueckerdt. Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 62:1-62:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{goetze_et_al:LIPIcs.ESA.2022.62, author = {Goetze, Miriam and Jungeblut, Paul and Ueckerdt, Torsten}, title = {{Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.62}, URN = {urn:nbn:de:0030-drops-170007}, doi = {10.4230/LIPIcs.ESA.2022.62}, annote = {Keywords: edge colorings, planar graphs, cubic graphs, generalized factors, SPQR-tree} }
Bernhard Haepler, D. Ellis Hershkowitz, and Goran Zuzic. Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 63:1-63:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{haepler_et_al:LIPIcs.ESA.2022.63, author = {Haepler, Bernhard and Hershkowitz, D. Ellis and Zuzic, Goran}, title = {{Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {63:1--63:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.63}, URN = {urn:nbn:de:0030-drops-170016}, doi = {10.4230/LIPIcs.ESA.2022.63}, annote = {Keywords: Tree metrics, metric embeddings, approximation algorithms, group Steiner forest, group Steiner tree, demand-robust algorithms, online algorithms, deterministic algorithms} }
Tesshu Hanaka and Michael Lampis. Hedonic Games and Treewidth Revisited. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 64:1-64:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hanaka_et_al:LIPIcs.ESA.2022.64, author = {Hanaka, Tesshu and Lampis, Michael}, title = {{Hedonic Games and Treewidth Revisited}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {64:1--64:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.64}, URN = {urn:nbn:de:0030-drops-170025}, doi = {10.4230/LIPIcs.ESA.2022.64}, annote = {Keywords: Hedonic Games, Nash Equilibrium, Treewidth} }
Monika Henzinger, Ami Paz, and A. R. Sricharan. Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 65:1-65:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{henzinger_et_al:LIPIcs.ESA.2022.65, author = {Henzinger, Monika and Paz, Ami and Sricharan, A. R.}, title = {{Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {65:1--65:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.65}, URN = {urn:nbn:de:0030-drops-170035}, doi = {10.4230/LIPIcs.ESA.2022.65}, annote = {Keywords: Dynamic graph algorithms, Expander graphs, Power-law graphs} }
D. Ellis Hershkowitz and Jason Li. O(1) Steiner Point Removal in Series-Parallel Graphs. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 66:1-66:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hershkowitz_et_al:LIPIcs.ESA.2022.66, author = {Hershkowitz, D. Ellis and Li, Jason}, title = {{O(1) Steiner Point Removal in Series-Parallel Graphs}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {66:1--66:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.66}, URN = {urn:nbn:de:0030-drops-170041}, doi = {10.4230/LIPIcs.ESA.2022.66}, annote = {Keywords: Metric embeddings, graph algorithms, vertex sparsification} }
Thijs van der Horst, Maarten Löffler, and Frank Staals. Chromatic k-Nearest Neighbor Queries. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 67:1-67:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{vanderhorst_et_al:LIPIcs.ESA.2022.67, author = {van der Horst, Thijs and L\"{o}ffler, Maarten and Staals, Frank}, title = {{Chromatic k-Nearest Neighbor Queries}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {67:1--67:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.67}, URN = {urn:nbn:de:0030-drops-170055}, doi = {10.4230/LIPIcs.ESA.2022.67}, annote = {Keywords: data structure, nearest neighbor, classification} }
Chien-Chung Huang and François Sellier. Maximum Weight b-Matchings in Random-Order Streams. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 68:1-68:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{huang_et_al:LIPIcs.ESA.2022.68, author = {Huang, Chien-Chung and Sellier, Fran\c{c}ois}, title = {{Maximum Weight b-Matchings in Random-Order Streams}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {68:1--68:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.68}, URN = {urn:nbn:de:0030-drops-170062}, doi = {10.4230/LIPIcs.ESA.2022.68}, annote = {Keywords: Maximum weight matching, b-matching, streaming, random order} }
Leo van Iersel, Mark Jones, and Mathias Weller. Embedding Phylogenetic Trees in Networks of Low Treewidth. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 69:1-69:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{vaniersel_et_al:LIPIcs.ESA.2022.69, author = {van Iersel, Leo and Jones, Mark and Weller, Mathias}, title = {{Embedding Phylogenetic Trees in Networks of Low Treewidth}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {69:1--69:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.69}, URN = {urn:nbn:de:0030-drops-170070}, doi = {10.4230/LIPIcs.ESA.2022.69}, annote = {Keywords: fixed-parameter tractability, treewidth, phylogenetic tree, phylogenetic network, display graph, tree containment, embedding} }
Han Jiang, Shang-En Huang, Thatchaphol Saranurak, and Tian Zhang. Vertex Sparsifiers for Hyperedge Connectivity. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 70:1-70:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{jiang_et_al:LIPIcs.ESA.2022.70, author = {Jiang, Han and Huang, Shang-En and Saranurak, Thatchaphol and Zhang, Tian}, title = {{Vertex Sparsifiers for Hyperedge Connectivity}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {70:1--70:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.70}, URN = {urn:nbn:de:0030-drops-170081}, doi = {10.4230/LIPIcs.ESA.2022.70}, annote = {Keywords: Vertex sparsifier, hypergraph, connectivity} }
Debajyoti Kar, Arindam Khan, and Andreas Wiese. Approximation Algorithms for Round-UFP and Round-SAP. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 71:1-71:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kar_et_al:LIPIcs.ESA.2022.71, author = {Kar, Debajyoti and Khan, Arindam and Wiese, Andreas}, title = {{Approximation Algorithms for Round-UFP and Round-SAP}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {71:1--71:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.71}, URN = {urn:nbn:de:0030-drops-170098}, doi = {10.4230/LIPIcs.ESA.2022.71}, annote = {Keywords: Approximation Algorithms, Scheduling, Rectangle Packing} }
Shahbaz Khan and Alexandru I. Tomescu. Optimizing Safe Flow Decompositions in DAGs. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 72:1-72:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{khan_et_al:LIPIcs.ESA.2022.72, author = {Khan, Shahbaz and Tomescu, Alexandru I.}, title = {{Optimizing Safe Flow Decompositions in DAGs}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {72:1--72:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.72}, URN = {urn:nbn:de:0030-drops-170101}, doi = {10.4230/LIPIcs.ESA.2022.72}, annote = {Keywords: safety, flows, networks, directed acyclic graphs} }
Dušan Knop and Martin Koutecký. Scheduling Kernels via Configuration LP. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 73:1-73:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{knop_et_al:LIPIcs.ESA.2022.73, author = {Knop, Du\v{s}an and Kouteck\'{y}, Martin}, title = {{Scheduling Kernels via Configuration LP}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {73:1--73:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.73}, URN = {urn:nbn:de:0030-drops-170118}, doi = {10.4230/LIPIcs.ESA.2022.73}, annote = {Keywords: Scheduling, Kernelization} }
Lex de Kogel, Marc van Kreveld, and Jordi L. Vermeulen. Abstract Morphing Using the Hausdorff Distance and Voronoi Diagrams. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 74:1-74:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dekogel_et_al:LIPIcs.ESA.2022.74, author = {de Kogel, Lex and van Kreveld, Marc and Vermeulen, Jordi L.}, title = {{Abstract Morphing Using the Hausdorff Distance and Voronoi Diagrams}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {74:1--74:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.74}, URN = {urn:nbn:de:0030-drops-170120}, doi = {10.4230/LIPIcs.ESA.2022.74}, annote = {Keywords: Morphing, Hausdorff distance, Voronoi diagrams} }
Soh Kumabe and Yuichi Yoshida. Average Sensitivity of the Knapsack Problem. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 75:1-75:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kumabe_et_al:LIPIcs.ESA.2022.75, author = {Kumabe, Soh and Yoshida, Yuichi}, title = {{Average Sensitivity of the Knapsack Problem}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {75:1--75:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.75}, URN = {urn:nbn:de:0030-drops-170136}, doi = {10.4230/LIPIcs.ESA.2022.75}, annote = {Keywords: Average Sensitivity, Knapsack Problem, FPRAS} }
Aleksander Łukasiewicz and Przemysław Uznański. Cardinality Estimation Using Gumbel Distribution. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 76:1-76:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lukasiewicz_et_al:LIPIcs.ESA.2022.76, author = {{\L}ukasiewicz, Aleksander and Uzna\'{n}ski, Przemys{\l}aw}, title = {{Cardinality Estimation Using Gumbel Distribution}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {76:1--76:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.76}, URN = {urn:nbn:de:0030-drops-170140}, doi = {10.4230/LIPIcs.ESA.2022.76}, annote = {Keywords: Streaming algorithms, Cardinality estimation, Sketching, Gumbel distribution} }
Marten Maack, Simon Pukrop, and Anna Rodriguez Rasmussen. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 77:1-77:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{maack_et_al:LIPIcs.ESA.2022.77, author = {Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, title = {{(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {77:1--77:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.77}, URN = {urn:nbn:de:0030-drops-170152}, doi = {10.4230/LIPIcs.ESA.2022.77}, annote = {Keywords: Scheduling, Restricted Assignment, Approximation, Inapproximability} }
Clément Maria and Owen Rouillé. Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 78:1-78:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{maria_et_al:LIPIcs.ESA.2022.78, author = {Maria, Cl\'{e}ment and Rouill\'{e}, Owen}, title = {{Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {78:1--78:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.78}, URN = {urn:nbn:de:0030-drops-170168}, doi = {10.4230/LIPIcs.ESA.2022.78}, annote = {Keywords: knots and 3-manifolds, triangulation, hyperbolic structure, Thurston equations} }
Wojciech Nadara, Michał Pilipczuk, and Marcin Smulewicz. Computing Treedepth in Polynomial Space and Linear FPT Time. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 79:1-79:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nadara_et_al:LIPIcs.ESA.2022.79, author = {Nadara, Wojciech and Pilipczuk, Micha{\l} and Smulewicz, Marcin}, title = {{Computing Treedepth in Polynomial Space and Linear FPT Time}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {79:1--79:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.79}, URN = {urn:nbn:de:0030-drops-170175}, doi = {10.4230/LIPIcs.ESA.2022.79}, annote = {Keywords: treedepth, FPT, polynomial space} }
Bento Natura, Meike Neuwohner, and Stefan Weltge. The Pareto Cover Problem. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 80:1-80:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{natura_et_al:LIPIcs.ESA.2022.80, author = {Natura, Bento and Neuwohner, Meike and Weltge, Stefan}, title = {{The Pareto Cover Problem}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {80:1--80:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.80}, URN = {urn:nbn:de:0030-drops-170186}, doi = {10.4230/LIPIcs.ESA.2022.80}, annote = {Keywords: Pareto, Covering, Optimization, Approximation Algorithm} }
Ofer Neiman and Idan Shabat. A Unified Framework for Hopsets. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 81:1-81:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{neiman_et_al:LIPIcs.ESA.2022.81, author = {Neiman, Ofer and Shabat, Idan}, title = {{A Unified Framework for Hopsets}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {81:1--81:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.81}, URN = {urn:nbn:de:0030-drops-170192}, doi = {10.4230/LIPIcs.ESA.2022.81}, annote = {Keywords: Graph Algorithms, Shortest Paths, Hopsets} }
Zeev Nutov. Data Structures for Node Connectivity Queries. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 82:1-82:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nutov:LIPIcs.ESA.2022.82, author = {Nutov, Zeev}, title = {{Data Structures for Node Connectivity Queries}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {82:1--82:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.82}, URN = {urn:nbn:de:0030-drops-170205}, doi = {10.4230/LIPIcs.ESA.2022.82}, annote = {Keywords: node connectivity, minimum cuts, data structure, connectivity queries} }
Rajmohan Rajaraman and Omer Wasim. Improved Bounds for Online Balanced Graph Re-Partitioning. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 83:1-83:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{rajaraman_et_al:LIPIcs.ESA.2022.83, author = {Rajaraman, Rajmohan and Wasim, Omer}, title = {{Improved Bounds for Online Balanced Graph Re-Partitioning}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {83:1--83:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.83}, URN = {urn:nbn:de:0030-drops-170210}, doi = {10.4230/LIPIcs.ESA.2022.83}, annote = {Keywords: online algorithms, graph partitioning, competitive analysis} }
Chris Schwiegelshohn and Omar Ali Sheikh-Omar. An Empirical Evaluation of k-Means Coresets. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 84:1-84:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{schwiegelshohn_et_al:LIPIcs.ESA.2022.84, author = {Schwiegelshohn, Chris and Sheikh-Omar, Omar Ali}, title = {{An Empirical Evaluation of k-Means Coresets}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {84:1--84:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.84}, URN = {urn:nbn:de:0030-drops-170225}, doi = {10.4230/LIPIcs.ESA.2022.84}, annote = {Keywords: coresets, k-means coresets, evaluation, benchmark} }
Marek Szykuła and Adam Zyzik. An Improved Algorithm for Finding the Shortest Synchronizing Words. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 85:1-85:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{szykula_et_al:LIPIcs.ESA.2022.85, author = {Szyku{\l}a, Marek and Zyzik, Adam}, title = {{An Improved Algorithm for Finding the Shortest Synchronizing Words}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {85:1--85:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.85}, URN = {urn:nbn:de:0030-drops-170237}, doi = {10.4230/LIPIcs.ESA.2022.85}, annote = {Keywords: \v{C}ern\{\'{y}\} conjecture, reset threshold, reset word, subset checking, synchronizing automaton, synchronizing word} }
Alexander Tiskin. Fast RSK Correspondence by Doubling Search. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 86:1-86:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{tiskin:LIPIcs.ESA.2022.86, author = {Tiskin, Alexander}, title = {{Fast RSK Correspondence by Doubling Search}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {86:1--86:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.86}, URN = {urn:nbn:de:0030-drops-170249}, doi = {10.4230/LIPIcs.ESA.2022.86}, annote = {Keywords: combinatorics of permutations, Robinson-Schensted-Knuth correspondence, k-chains, RSK algorithm} }
Stefan Walzer. Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 87:1-87:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{walzer:LIPIcs.ESA.2022.87, author = {Walzer, Stefan}, title = {{Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {87:1--87:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.87}, URN = {urn:nbn:de:0030-drops-170250}, doi = {10.4230/LIPIcs.ESA.2022.87}, annote = {Keywords: Cuckoo Hashing, Random Walk, Random Hypergraph, Peeling, Cores} }
Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, and Julian Shun. ParGeo: A Library for Parallel Computational Geometry. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 88:1-88:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{wang_et_al:LIPIcs.ESA.2022.88, author = {Wang, Yiqiu and Yesantharao, Rahul and Yu, Shangdi and Dhulipala, Laxman and Gu, Yan and Shun, Julian}, title = {{ParGeo: A Library for Parallel Computational Geometry}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {88:1--88:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.88}, URN = {urn:nbn:de:0030-drops-170265}, doi = {10.4230/LIPIcs.ESA.2022.88}, annote = {Keywords: Computational Geometry, Parallel Algorithms, Libraries} }
Nils Werner and Tim Zeitz. Combining Predicted and Live Traffic with Time-Dependent A* Potentials. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 89:1-89:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{werner_et_al:LIPIcs.ESA.2022.89, author = {Werner, Nils and Zeitz, Tim}, title = {{Combining Predicted and Live Traffic with Time-Dependent A* Potentials}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {89:1--89:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.89}, URN = {urn:nbn:de:0030-drops-170271}, doi = {10.4230/LIPIcs.ESA.2022.89}, annote = {Keywords: realistic road networks, shortest paths, live traffic, time-dependent routing} }
Zoe Xi and William Kuszmaul. Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 90:1-90:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{xi_et_al:LIPIcs.ESA.2022.90, author = {Xi, Zoe and Kuszmaul, William}, title = {{Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {90:1--90:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.90}, URN = {urn:nbn:de:0030-drops-170281}, doi = {10.4230/LIPIcs.ESA.2022.90}, annote = {Keywords: Dynamic time warping distance, approximation algorithms, run-length encodings, computational geometry} }
Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, and Kanak Mahadik. Correlated Stochastic Knapsack with a Submodular Objective. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 91:1-91:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{yang_et_al:LIPIcs.ESA.2022.91, author = {Yang, Sheng and Khuller, Samir and Choudhary, Sunav and Mitra, Subrata and Mahadik, Kanak}, title = {{Correlated Stochastic Knapsack with a Submodular Objective}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {91:1--91:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.91}, URN = {urn:nbn:de:0030-drops-170296}, doi = {10.4230/LIPIcs.ESA.2022.91}, annote = {Keywords: Stochastic Knapsack, Submodular Optimization, Stochastic Optimization} }
Or Zamir. Faster Algorithm for Unique (k,2)-CSP. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 92:1-92:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{zamir:LIPIcs.ESA.2022.92, author = {Zamir, Or}, title = {{Faster Algorithm for Unique (k,2)-CSP}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {92:1--92:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.92}, URN = {urn:nbn:de:0030-drops-170309}, doi = {10.4230/LIPIcs.ESA.2022.92}, annote = {Keywords: Algorithms, Constraint Satisfaction Problem} }
Feedback for Dagstuhl Publishing