@Proceedings{grtz_et_al:LIPIcs.ESA.2023,
title = {{LIPIcs, Volume 274, ESA 2023, Complete Volume}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {1--1700},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023},
URN = {urn:nbn:de:0030-drops-186529},
doi = {10.4230/LIPIcs.ESA.2023},
annote = {Keywords: LIPIcs, Volume 274, ESA 2023, Complete Volume}
}
@InProceedings{grtz_et_al:LIPIcs.ESA.2023.0,
author = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {0:i--0:xxii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.0},
URN = {urn:nbn:de:0030-drops-186535},
doi = {10.4230/LIPIcs.ESA.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{dietzfelbinger:LIPIcs.ESA.2023.1,
author = {Dietzfelbinger, Martin},
title = {{On Hashing by (Random) Equations}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.1},
URN = {urn:nbn:de:0030-drops-186545},
doi = {10.4230/LIPIcs.ESA.2023.1},
annote = {Keywords: Hashing, Retrieval, Linear equations, Randomness}
}
@InProceedings{abboud_et_al:LIPIcs.ESA.2023.2,
author = {Abboud, Amir and Dalirrooyfard, Mina and Li, Ray and Vassilevska Williams, Virginia},
title = {{On Diameter Approximation in Directed Graphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {2:1--2:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.2},
URN = {urn:nbn:de:0030-drops-186552},
doi = {10.4230/LIPIcs.ESA.2023.2},
annote = {Keywords: Diameter, Directed Graphs, Approximation Algorithms, Fine-grained complexity}
}
@InProceedings{abboud_et_al:LIPIcs.ESA.2023.3,
author = {Abboud, Amir and Fischer, Nick and Goldenberg, Elazar and Karthik C. S. and Safier, Ron},
title = {{Can You Solve Closest String Faster Than Exhaustive Search?}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {3:1--3:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.3},
URN = {urn:nbn:de:0030-drops-186566},
doi = {10.4230/LIPIcs.ESA.2023.3},
annote = {Keywords: Closest string, fine-grained complexity, SETH, inclusion-exclusion}
}
@InProceedings{abboud_et_al:LIPIcs.ESA.2023.4,
author = {Abboud, Amir and Mozes, Shay and Weimann, Oren},
title = {{What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {4:1--4:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.4},
URN = {urn:nbn:de:0030-drops-186575},
doi = {10.4230/LIPIcs.ESA.2023.4},
annote = {Keywords: Planar graphs, diameter, dynamic graphs, fault tolerance}
}
@InProceedings{abdelkader_et_al:LIPIcs.ESA.2023.5,
author = {Abdelkader, Ahmed and Mount, David M.},
title = {{Smooth Distance Approximation}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.5},
URN = {urn:nbn:de:0030-drops-186589},
doi = {10.4230/LIPIcs.ESA.2023.5},
annote = {Keywords: Approximation algorithms, convexity, continuity, partition of unity}
}
@InProceedings{a.akitaya_et_al:LIPIcs.ESA.2023.6,
author = {A. Akitaya, Hugo and Gonczi, Andrei and Souvaine, Diane L. and T\'{o}th, Csaba D. and Weighill, Thomas},
title = {{Reconfiguration of Polygonal Subdivisions via Recombination}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.6},
URN = {urn:nbn:de:0030-drops-186598},
doi = {10.4230/LIPIcs.ESA.2023.6},
annote = {Keywords: configuration space, gerrymandering, polygonal subdivision, recombination}
}
@InProceedings{akmal_et_al:LIPIcs.ESA.2023.7,
author = {Akmal, Shyan and Vassilevska Williams, Virginia and Williams, Ryan and Xu, Zixuan},
title = {{Faster Detours in Undirected Graphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.7},
URN = {urn:nbn:de:0030-drops-186601},
doi = {10.4230/LIPIcs.ESA.2023.7},
annote = {Keywords: path finding, detours, parameterized complexity, exact algorithms}
}
@InProceedings{akmal_et_al:LIPIcs.ESA.2023.8,
author = {Akmal, Shyan and Wein, Nicole},
title = {{A Local-To-Global Theorem for Congested Shortest Paths}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {8:1--8:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.8},
URN = {urn:nbn:de:0030-drops-186618},
doi = {10.4230/LIPIcs.ESA.2023.8},
annote = {Keywords: disjoint paths, shortest paths, congestion, parameterized complexity}
}
@InProceedings{angelini_et_al:LIPIcs.ESA.2023.9,
author = {Angelini, Patrizio and Bekos, Michael A. and Katheder, Julia and Kaufmann, Michael and Pfister, Maximilian and Ueckerdt, Torsten},
title = {{Axis-Parallel Right Angle Crossing Graphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {9:1--9:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.9},
URN = {urn:nbn:de:0030-drops-186623},
doi = {10.4230/LIPIcs.ESA.2023.9},
annote = {Keywords: Graph drawing, RAC graphs, Graph drawing algorithms}
}
@InProceedings{apers_et_al:LIPIcs.ESA.2023.10,
author = {Apers, Simon and Jeffery, Stacey and Pass, Galina and Walter, Michael},
title = {{(No) Quantum Space-Time Tradeoff for USTCON}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.10},
URN = {urn:nbn:de:0030-drops-186636},
doi = {10.4230/LIPIcs.ESA.2023.10},
annote = {Keywords: Undirected st-connectivity, quantum walks, time-space tradeoff}
}
@InProceedings{baligacs_et_al:LIPIcs.ESA.2023.11,
author = {Balig\'{a}cs, J\'{u}lia and Disser, Yann and Heinrich, Irene and Schweitzer, Pascal},
title = {{Exploration of Graphs with Excluded Minors}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.11},
URN = {urn:nbn:de:0030-drops-186644},
doi = {10.4230/LIPIcs.ESA.2023.11},
annote = {Keywords: online algorithms, competitive analysis, graph exploration, graph spanners, minor-free graphs, bounded genus graphs}
}
@InProceedings{bampis_et_al:LIPIcs.ESA.2023.12,
author = {Bampis, Evripidis and Escoffier, Bruno and Gouleakis, Themis and Hahn, Niklas and Lakis, Kostas and Shahkarami, Golnoosh and Xefteris, Michalis},
title = {{Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.12},
URN = {urn:nbn:de:0030-drops-186659},
doi = {10.4230/LIPIcs.ESA.2023.12},
annote = {Keywords: TSP, Online algorithms, Learning-augmented algorithms, Algorithms with predictions, Competitive analysis}
}
@InProceedings{bangjensen_et_al:LIPIcs.ESA.2023.13,
author = {Bang-Jensen, J{\o}rgen and Klinkby, Kristine Vitting and Misra, Pranabendu and Saurabh, Saket},
title = {{A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.13},
URN = {urn:nbn:de:0030-drops-186663},
doi = {10.4230/LIPIcs.ESA.2023.13},
annote = {Keywords: Parameterized Complexity, Vertex Connectivity, Network Design}
}
@InProceedings{bannai_et_al:LIPIcs.ESA.2023.14,
author = {Bannai, Hideo and Ellert, Jonas},
title = {{Lyndon Arrays in Sublinear Time}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {14:1--14:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.14},
URN = {urn:nbn:de:0030-drops-186670},
doi = {10.4230/LIPIcs.ESA.2023.14},
annote = {Keywords: Lyndon forest, Lyndon table, Lyndon array, sublinear time algorithms, word RAM algorithms, word packing, tabulation, lookup tables, periodicity}
}
@InProceedings{becker_et_al:LIPIcs.ESA.2023.15,
author = {Becker, Ruben and C\'{a}ceres, Manuel and Cenzato, Davide and Kim, Sung-Hwan and Kodric, Bojana and Olivares, Francisco and Prezza, Nicola},
title = {{Sorting Finite Automata via Partition Refinement}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.15},
URN = {urn:nbn:de:0030-drops-186684},
doi = {10.4230/LIPIcs.ESA.2023.15},
annote = {Keywords: Wheeler automata, prefix sorting, pattern matching, graph compression, sorting, partition refinement}
}
@InProceedings{bentert_et_al:LIPIcs.ESA.2023.16,
author = {Bentert, Matthias and Heeger, Klaus and Koana, Tomohiro},
title = {{Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.16},
URN = {urn:nbn:de:0030-drops-186692},
doi = {10.4230/LIPIcs.ESA.2023.16},
annote = {Keywords: FPT in P, Algebraic Algorithms, Adaptive Algorithms, Subgraph Detection, Matching, APSP}
}
@InProceedings{berger_et_al:LIPIcs.ESA.2023.17,
author = {Berger, Aaron and Kaufmann, Jenny and Vassilevska Williams, Virginia},
title = {{Approximating Min-Diameter: Standard and Bichromatic}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.17},
URN = {urn:nbn:de:0030-drops-186705},
doi = {10.4230/LIPIcs.ESA.2023.17},
annote = {Keywords: diameter, min distances, fine-grained, approximation algorithm}
}
@InProceedings{bergougnoux_et_al:LIPIcs.ESA.2023.18,
author = {Bergougnoux, Benjamin and Chekan, Vera and Ganian, Robert and Kant\'{e}, Mamadou Moustapha and Mnich, Matthias and Oum, Sang-il and Pilipczuk, Micha{\l} and van Leeuwen, Erik Jan},
title = {{Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.18},
URN = {urn:nbn:de:0030-drops-186710},
doi = {10.4230/LIPIcs.ESA.2023.18},
annote = {Keywords: Parameterized complexity, shrubdepth, space complexity, algebraic methods}
}
@InProceedings{bez_et_al:LIPIcs.ESA.2023.19,
author = {Bez, Dominik and Kurpicz, Florian and Lehmann, Hans-Peter and Sanders, Peter},
title = {{High Performance Construction of RecSplit Based Minimal Perfect Hash Functions}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.19},
URN = {urn:nbn:de:0030-drops-186728},
doi = {10.4230/LIPIcs.ESA.2023.19},
annote = {Keywords: compressed data structure, parallel perfect hashing, bit parallelism, GPU, SIMD, parallel computing, vector instructions}
}
@InProceedings{blasius_et_al:LIPIcs.ESA.2023.20,
author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Katzmann, Maximilian and Ruff, Janosch and Zeif, Ziena},
title = {{On the Giant Component of Geometric Inhomogeneous Random Graphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {20:1--20:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.20},
URN = {urn:nbn:de:0030-drops-186737},
doi = {10.4230/LIPIcs.ESA.2023.20},
annote = {Keywords: geometric inhomogeneous random graphs, connectivity, giant component}
}
@InProceedings{blasius_et_al:LIPIcs.ESA.2023.21,
author = {Bl\"{a}sius, Thomas and G\"{o}ttlicher, Max},
title = {{An Efficient Algorithm for Power Dominating Set}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.21},
URN = {urn:nbn:de:0030-drops-186743},
doi = {10.4230/LIPIcs.ESA.2023.21},
annote = {Keywords: Power Dominating Set, Implicit Hitting Set, Parameterized Complexity, Reduction Rules}
}
@InProceedings{blikstad_et_al:LIPIcs.ESA.2023.22,
author = {Blikstad, Joakim and Kiss, Peter},
title = {{Incremental (1-\epsilon)-Approximate Dynamic Matching in O(poly(1/\epsilon)) Update Time}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {22:1--22:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.22},
URN = {urn:nbn:de:0030-drops-186756},
doi = {10.4230/LIPIcs.ESA.2023.22},
annote = {Keywords: Bipartite Matching, Incremental Matching, Dynamic Algorithms, Approximation Algorithms, EDCS}
}
@InProceedings{bonnet_et_al:LIPIcs.ESA.2023.23,
author = {Bonnet, \'{E}douard and Duron, Julien and Geniet, Colin and Thomass\'{e}, St\'{e}phan and Wesolek, Alexandra},
title = {{Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.23},
URN = {urn:nbn:de:0030-drops-186769},
doi = {10.4230/LIPIcs.ESA.2023.23},
annote = {Keywords: Maximum Independent Set, forbidden induced minors, quasipolynomial-time algorithms}
}
@InProceedings{bringmann_et_al:LIPIcs.ESA.2023.24,
author = {Bringmann, Karl and Cassis, Alejandro},
title = {{Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {24:1--24:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.24},
URN = {urn:nbn:de:0030-drops-186776},
doi = {10.4230/LIPIcs.ESA.2023.24},
annote = {Keywords: Knapsack, Fine-Grained Complexity, Min-Plus Convolution}
}
@InProceedings{brodal_et_al:LIPIcs.ESA.2023.25,
author = {Brodal, Gerth St{\o}lting and Wild, Sebastian},
title = {{Funnelselect: Cache-Oblivious Multiple Selection}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.25},
URN = {urn:nbn:de:0030-drops-186789},
doi = {10.4230/LIPIcs.ESA.2023.25},
annote = {Keywords: Multiple selection, cache-oblivious algorithm, randomized algorithm, entropy bounds}
}
@InProceedings{buchin_et_al:LIPIcs.ESA.2023.26,
author = {Buchin, Kevin and Gudmundsson, Joachim and Kalb, Antonia and Popov, Aleksandr and Rehs, Carolin and van Renssen, Andr\'{e} and Wong, Sampson},
title = {{Oriented Spanners}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.26},
URN = {urn:nbn:de:0030-drops-186796},
doi = {10.4230/LIPIcs.ESA.2023.26},
annote = {Keywords: computational geometry, spanner, oriented graph, greedy triangulation}
}
@InProceedings{bullinger_et_al:LIPIcs.ESA.2023.27,
author = {Bullinger, Martin and Romen, Ren\'{e}},
title = {{Online Coalition Formation Under Random Arrival or Coalition Dissolution}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {27:1--27:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.27},
URN = {urn:nbn:de:0030-drops-186809},
doi = {10.4230/LIPIcs.ESA.2023.27},
annote = {Keywords: Online Algorithms, Coalition Formation, Online Matching}
}
@InProceedings{cabello_et_al:LIPIcs.ESA.2023.28,
author = {Cabello, Sergio and Giannopoulos, Panos},
title = {{On k-Means for Segments and Polylines}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {28:1--28:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.28},
URN = {urn:nbn:de:0030-drops-186812},
doi = {10.4230/LIPIcs.ESA.2023.28},
annote = {Keywords: k-means clustering, segments, polylines, Hausdorff distance, Fr\'{e}chet mean}
}
@InProceedings{cai_et_al:LIPIcs.ESA.2023.29,
author = {Cai, Dongrun and Chen, Xue and Peng, Pan},
title = {{Effective Resistances in Non-Expander Graphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {29:1--29:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.29},
URN = {urn:nbn:de:0030-drops-186823},
doi = {10.4230/LIPIcs.ESA.2023.29},
annote = {Keywords: Sublinear Time Algorithm, Effective Resistance, Leverage Scores, Matrix Perturbation}
}
@InProceedings{campos_et_al:LIPIcs.ESA.2023.30,
author = {Campos, Victor and Costa, Jonas and Lopes, Raul and Sau, Ignasi},
title = {{New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {30:1--30:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.30},
URN = {urn:nbn:de:0030-drops-186838},
doi = {10.4230/LIPIcs.ESA.2023.30},
annote = {Keywords: directed graphs, min-max relation, half-integral linkage, directed disjoint paths, bramble, parameterized complexity, matroids}
}
@InProceedings{cao:LIPIcs.ESA.2023.31,
author = {Cao, Yixin},
title = {{Enumerating Maximal Induced Subgraphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {31:1--31:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.31},
URN = {urn:nbn:de:0030-drops-186841},
doi = {10.4230/LIPIcs.ESA.2023.31},
annote = {Keywords: enumeration algorithm, hereditary graph class, maximal induced subgraph}
}
@InProceedings{carlson_et_al:LIPIcs.ESA.2023.32,
author = {Carlson, Charlie and Jafarov, Jafar and Makarychev, Konstantin and Makarychev, Yury and Shan, Liren},
title = {{Approximation Algorithm for Norm Multiway Cut}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.32},
URN = {urn:nbn:de:0030-drops-186854},
doi = {10.4230/LIPIcs.ESA.2023.32},
annote = {Keywords: Multiway cut, Approximation algorithms}
}
@InProceedings{chalermsook_et_al:LIPIcs.ESA.2023.33,
author = {Chalermsook, Parinya and Fomin, Fedor and Hamm, Thekla and Korhonen, Tuukka and Nederlof, Jesper and Orgo, Ly},
title = {{Polynomial-Time Approximation of Independent Set Parameterized by Treewidth}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {33:1--33:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.33},
URN = {urn:nbn:de:0030-drops-186865},
doi = {10.4230/LIPIcs.ESA.2023.33},
annote = {Keywords: Maximum Independent Set, Treewidth, Approximation Algorithms, Parameterized Approximation}
}
@InProceedings{chhabra_et_al:LIPIcs.ESA.2023.34,
author = {Chhabra, Adil and Fonseca Faraj, Marcelo and Schulz, Christian},
title = {{Faster Local Motif Clustering via Maximum Flows}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {34:1--34:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.34},
URN = {urn:nbn:de:0030-drops-186871},
doi = {10.4230/LIPIcs.ESA.2023.34},
annote = {Keywords: local motif clustering, motif conductance, maximum flows, max-flow quotient-cut improvement}
}
@InProceedings{cohen_et_al:LIPIcs.ESA.2023.35,
author = {Cohen, Ilan Reuven and Peng, Binghui},
title = {{Primal-Dual Schemes for Online Matching in Bounded Degree Graphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {35:1--35:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.35},
URN = {urn:nbn:de:0030-drops-186884},
doi = {10.4230/LIPIcs.ESA.2023.35},
annote = {Keywords: Online Matching, Primal-dual analysis, bounded-degree graph, the AdWords problem}
}
@InProceedings{czekanski_et_al:LIPIcs.ESA.2023.36,
author = {Czekanski, Michael and Kimmel, Shelby and Witter, R. Teal},
title = {{Robust and Space-Efficient Dual Adversary Quantum Query Algorithms}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {36:1--36:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.36},
URN = {urn:nbn:de:0030-drops-186890},
doi = {10.4230/LIPIcs.ESA.2023.36},
annote = {Keywords: Quantum Computing, Robust Quantum Algorithms, Johnson-Lindenstrauss Lemma, Span Programs, Query Complexity, Space Complexity}
}
@InProceedings{dacunha_et_al:LIPIcs.ESA.2023.37,
author = {Da Cunha, Arthur Carvalho Walraven and d'Amore, Francesco and Giroire, Fr\'{e}d\'{e}ric and Lesfari, Hicham and Natale, Emanuele and Viennot, Laurent},
title = {{Revisiting the Random Subset Sum Problem}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {37:1--37:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.37},
URN = {urn:nbn:de:0030-drops-186905},
doi = {10.4230/LIPIcs.ESA.2023.37},
annote = {Keywords: Random subset sum, Randomised method, Subset-sum, Combinatorics}
}
@InProceedings{damerius_et_al:LIPIcs.ESA.2023.38,
author = {Damerius, Christoph and Kling, Peter and Li, Minming and Xu, Chenyang and Zhang, Ruilong},
title = {{Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.38},
URN = {urn:nbn:de:0030-drops-186915},
doi = {10.4230/LIPIcs.ESA.2023.38},
annote = {Keywords: scheduling, total completion time, makespan, LP rounding, competitive analysis, approximation algorithm, NP hardness, PTAS}
}
@InProceedings{deppert_et_al:LIPIcs.ESA.2023.39,
author = {Deppert, Max and Kaul, Matthias and Mnich, Matthias},
title = {{A (3/2 + \epsilon)-Approximation for Multiple TSP with a Variable Number of Depots}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {39:1--39:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.39},
URN = {urn:nbn:de:0030-drops-186925},
doi = {10.4230/LIPIcs.ESA.2023.39},
annote = {Keywords: Traveling salesperson problem, rural postperson problem, multiple TSP, vehicle routing}
}
@InProceedings{ding_et_al:LIPIcs.ESA.2023.40,
author = {Ding, Xiangyun and Dong, Xiaojun and Gu, Yan and Liu, Youzhe and Sun, Yihan},
title = {{Efficient Parallel Output-Sensitive Edit Distance}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {40:1--40:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.40},
URN = {urn:nbn:de:0030-drops-186935},
doi = {10.4230/LIPIcs.ESA.2023.40},
annote = {Keywords: Edit Distance, Parallel Algorithms, String Algorithms, Dynamic Programming, Pattern Matching}
}
@InProceedings{ding_et_al:LIPIcs.ESA.2023.41,
author = {Ding, Ming and Zhang, Peng},
title = {{Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {41:1--41:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.41},
URN = {urn:nbn:de:0030-drops-186947},
doi = {10.4230/LIPIcs.ESA.2023.41},
annote = {Keywords: 1-Laplacian Solvers, Simplicial Complexes, Incomplete Nested Dissection}
}
@InProceedings{dorfman_et_al:LIPIcs.ESA.2023.42,
author = {Dorfman, Dani and Kaplan, Haim and Tarjan, Robert E. and Zwick, Uri},
title = {{Optimal Energetic Paths for Electric Cars}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {42:1--42:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.42},
URN = {urn:nbn:de:0030-drops-186955},
doi = {10.4230/LIPIcs.ESA.2023.42},
annote = {Keywords: Electric cars, Optimal Paths, Battery depletion}
}
@InProceedings{dreier_et_al:LIPIcs.ESA.2023.43,
author = {Dreier, Jan and Mock, Daniel and Rossmanith, Peter},
title = {{Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {43:1--43:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.43},
URN = {urn:nbn:de:0030-drops-186961},
doi = {10.4230/LIPIcs.ESA.2023.43},
annote = {Keywords: nowhere dense, sparsity, counting logic, dominating set, FPT}
}
@InProceedings{emek_et_al:LIPIcs.ESA.2023.44,
author = {Emek, Yuval and Gil, Yuval and Pacut, Maciej and Schmid, Stefan},
title = {{Online Algorithms with Randomly Infused Advice}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {44:1--44:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.44},
URN = {urn:nbn:de:0030-drops-186970},
doi = {10.4230/LIPIcs.ESA.2023.44},
annote = {Keywords: Online algorithms, competitive analysis, advice}
}
@InProceedings{fekete_et_al:LIPIcs.ESA.2023.45,
author = {Fekete, S\'{a}ndor P. and Krupke, Dominik and Perk, Michael and Rieck, Christian and Scheffer, Christian},
title = {{The Lawn Mowing Problem: From Algebra to Algorithms}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {45:1--45:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.45},
URN = {urn:nbn:de:0030-drops-186985},
doi = {10.4230/LIPIcs.ESA.2023.45},
annote = {Keywords: Geometric optimization, covering problems, tour problems, lawn mowing, algebraic hardness, approximation algorithms, algorithm engineering}
}
@InProceedings{ferragina_et_al:LIPIcs.ESA.2023.46,
author = {Ferragina, Paolo and Lehmann, Hans-Peter and Sanders, Peter and Vinciguerra, Giorgio},
title = {{Learned Monotone Minimal Perfect Hashing}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {46:1--46:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.46},
URN = {urn:nbn:de:0030-drops-186990},
doi = {10.4230/LIPIcs.ESA.2023.46},
annote = {Keywords: compressed data structure, monotone minimal perfect hashing, retrieval}
}
@InProceedings{figiel_et_al:LIPIcs.ESA.2023.47,
author = {Figiel, Aleksander and Koana, Tomohiro and Nichterlein, Andr\'{e} and W\"{u}nsche, Niklas},
title = {{Correlating Theory and Practice in Finding Clubs and Plexes}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {47:1--47:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.47},
URN = {urn:nbn:de:0030-drops-187000},
doi = {10.4230/LIPIcs.ESA.2023.47},
annote = {Keywords: Preprocessing, Turing kernelization, Pearson correlation coefficient}
}
@InProceedings{fomin_et_al:LIPIcs.ESA.2023.48,
author = {Fomin, Fedor V. and Golovach, Petr A. and Inamdar, Tanmay and Saurabh, Saket and Zehavi, Meirav},
title = {{Kernelization for Spreading Points}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {48:1--48:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.48},
URN = {urn:nbn:de:0030-drops-187017},
doi = {10.4230/LIPIcs.ESA.2023.48},
annote = {Keywords: parameterized algorithms, kernelization, spreading points, distant representatives, unit disk packing}
}
@InProceedings{fomin_et_al:LIPIcs.ESA.2023.49,
author = {Fomin, Fedor V. and Le, Tien-Nam and Lokshtanov, Daniel and Saurabh, Saket and Thomass\'{e}, St\'{e}phan and Zehavi, Meirav},
title = {{Lossy Kernelization for (Implicit) Hitting Set Problems}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.49},
URN = {urn:nbn:de:0030-drops-187020},
doi = {10.4230/LIPIcs.ESA.2023.49},
annote = {Keywords: Hitting Set, Lossy Kernelization}
}
@InProceedings{forster_et_al:LIPIcs.ESA.2023.50,
author = {Forster, Sebastian and Goranci, Gramoz and Nazari, Yasamin and Skarlatos, Antonis},
title = {{Bootstrapping Dynamic Distance Oracles}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {50:1--50:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.50},
URN = {urn:nbn:de:0030-drops-187031},
doi = {10.4230/LIPIcs.ESA.2023.50},
annote = {Keywords: Dynamic graph algorithms, Distance Oracles, Shortest Paths}
}
@InProceedings{funke_et_al:LIPIcs.ESA.2023.51,
author = {Funke, Daniel and H\"{u}ning, Nicolai and Sanders, Peter},
title = {{A Sweep-Plane Algorithm for Calculating the Isolation of Mountains}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {51:1--51:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.51},
URN = {urn:nbn:de:0030-drops-187040},
doi = {10.4230/LIPIcs.ESA.2023.51},
annote = {Keywords: computational geometry, Geo-information systems, sweepline algorithms}
}
@InProceedings{ganz_et_al:LIPIcs.ESA.2023.52,
author = {Ganz, Amit and Nuti, Pranav and Schwartz, Roy},
title = {{A Tight Competitive Ratio for Online Submodular Welfare Maximization}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {52:1--52:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.52},
URN = {urn:nbn:de:0030-drops-187052},
doi = {10.4230/LIPIcs.ESA.2023.52},
annote = {Keywords: Online Algorithms, Submodular Maximization, Welfare Maximization, Approximation Algorithms}
}
@InProceedings{geniet_et_al:LIPIcs.ESA.2023.53,
author = {Geniet, Colin and Thomass\'{e}, St\'{e}phan},
title = {{First Order Logic and Twin-Width in Tournaments}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {53:1--53:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.53},
URN = {urn:nbn:de:0030-drops-187061},
doi = {10.4230/LIPIcs.ESA.2023.53},
annote = {Keywords: Tournaments, twin-width, first-order logic, model checking, NIP, small classes}
}
@InProceedings{griesbach_et_al:LIPIcs.ESA.2023.54,
author = {Griesbach, Svenja M. and Hommelsheim, Felix and Klimm, Max and Schewior, Kevin},
title = {{Improved Approximation Algorithms for the Expanding Search Problem}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {54:1--54:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.54},
URN = {urn:nbn:de:0030-drops-187073},
doi = {10.4230/LIPIcs.ESA.2023.54},
annote = {Keywords: Approximation Algorithm, Expanding Search, Search Problem, Graph Exploration, Traveling Repairperson Problem}
}
@InProceedings{grunau_et_al:LIPIcs.ESA.2023.55,
author = {Grunau, Christoph and \"{O}z\"{u}do\u{g}ru, Ahmet Alper and Rozho\v{n}, V\'{a}clav},
title = {{Noisy k-Means++ Revisited}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {55:1--55:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.55},
URN = {urn:nbn:de:0030-drops-187080},
doi = {10.4230/LIPIcs.ESA.2023.55},
annote = {Keywords: clustering, k-means, k-means++, adversarial noise}
}
@InProceedings{harb_et_al:LIPIcs.ESA.2023.56,
author = {Harb, Elfarouk and Quanrud, Kent and Chekuri, Chandra},
title = {{Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {56:1--56:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.56},
URN = {urn:nbn:de:0030-drops-187091},
doi = {10.4230/LIPIcs.ESA.2023.56},
annote = {Keywords: Polymatroid, lexicographically optimum base, densest subgraph, tree packing}
}
@InProceedings{harris:LIPIcs.ESA.2023.57,
author = {Harris, David G.},
title = {{Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {57:1--57:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.57},
URN = {urn:nbn:de:0030-drops-187104},
doi = {10.4230/LIPIcs.ESA.2023.57},
annote = {Keywords: Matrix multiplication, Boolean matrix multiplication, Strassen’s algorithmkeyword}
}
@InProceedings{hebertjohnson_et_al:LIPIcs.ESA.2023.58,
author = {H\'{e}bert-Johnson, \'{U}rsula and Lokshtanov, Daniel and Vigoda, Eric},
title = {{Counting and Sampling Labeled Chordal Graphs in Polynomial Time}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {58:1--58:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.58},
URN = {urn:nbn:de:0030-drops-187119},
doi = {10.4230/LIPIcs.ESA.2023.58},
annote = {Keywords: Counting algorithms, graph sampling, chordal graphs}
}
@InProceedings{hegerfeld_et_al:LIPIcs.ESA.2023.59,
author = {Hegerfeld, Falko and Kratsch, Stefan},
title = {{Tight Algorithms for Connectivity Problems Parameterized by Clique-Width}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {59:1--59:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.59},
URN = {urn:nbn:de:0030-drops-187124},
doi = {10.4230/LIPIcs.ESA.2023.59},
annote = {Keywords: Parameterized Complexity, Connectivity, Clique-width, Cut\&Count, Lower Bound}
}
@InProceedings{hespe_et_al:LIPIcs.ESA.2023.60,
author = {Hespe, Demian and Sanders, Peter and Storandt, Sabine and Truschel, Carina},
title = {{Pareto Sums of Pareto Sets}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {60:1--60:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.60},
URN = {urn:nbn:de:0030-drops-187132},
doi = {10.4230/LIPIcs.ESA.2023.60},
annote = {Keywords: Minkowski sum, Skyline, Successive Algorithm}
}
@InProceedings{hevia_et_al:LIPIcs.ESA.2023.61,
author = {Hevia, Anthony and Kallus, Benjamin and McClintic, Summer and Reisner, Samantha and Strash, Darren and Wilson, Johnathan},
title = {{Solving Edge Clique Cover Exactly via Synergistic Data Reduction}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {61:1--61:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.61},
URN = {urn:nbn:de:0030-drops-187148},
doi = {10.4230/LIPIcs.ESA.2023.61},
annote = {Keywords: Edge clique cover, Vertex clique cover, Data reduction, Degeneracy}
}
@InProceedings{hoefer_et_al:LIPIcs.ESA.2023.62,
author = {Hoefer, Martin and Schewior, Kevin},
title = {{Threshold Testing and Semi-Online Prophet Inequalities}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {62:1--62:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.62},
URN = {urn:nbn:de:0030-drops-187159},
doi = {10.4230/LIPIcs.ESA.2023.62},
annote = {Keywords: Prophet Inequalities, Testing, Stochastic Probing}
}
@InProceedings{inamdar_et_al:LIPIcs.ESA.2023.63,
author = {Inamdar, Tanmay and Lokshtanov, Daniel and Saurabh, Saket and Surianarayanan, Vaishali},
title = {{Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability)}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {63:1--63:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.63},
URN = {urn:nbn:de:0030-drops-187167},
doi = {10.4230/LIPIcs.ESA.2023.63},
annote = {Keywords: FPT Approximation, Minimum Bisection, Unbreakable Tree Decomposition, Treewidth}
}
@InProceedings{izdebski_et_al:LIPIcs.ESA.2023.64,
author = {Izdebski, Adam and de Wolf, Ronald},
title = {{Improved Quantum Boosting}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {64:1--64:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.64},
URN = {urn:nbn:de:0030-drops-187178},
doi = {10.4230/LIPIcs.ESA.2023.64},
annote = {Keywords: Learning theory, Boosting algorithms, Quantum computing}
}
@InProceedings{jacob_et_al:LIPIcs.ESA.2023.65,
author = {Jacob, Ashwin and W{\l}odarczyk, Micha{\l} and Zehavi, Meirav},
title = {{Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {65:1--65:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.65},
URN = {urn:nbn:de:0030-drops-187184},
doi = {10.4230/LIPIcs.ESA.2023.65},
annote = {Keywords: Hamiltonian cycle, longest path, directed feedback vertex set, directed graphs, parameterized complexity}
}
@InProceedings{jansen_et_al:LIPIcs.ESA.2023.66,
author = {Jansen, Bart M. P. and de Kroon, Jari J. H. and W{\l}odarczyk, Micha{\l}},
title = {{5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {66:1--66:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.66},
URN = {urn:nbn:de:0030-drops-187195},
doi = {10.4230/LIPIcs.ESA.2023.66},
annote = {Keywords: fixed-parameter tractability, treewidth, graph decompositions}
}
@InProceedings{kaplan_et_al:LIPIcs.ESA.2023.67,
author = {Kaplan, Haim and Katz, Matthew J. and Saban, Rachel and Sharir, Micha},
title = {{The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {67:1--67:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.67},
URN = {urn:nbn:de:0030-drops-187208},
doi = {10.4230/LIPIcs.ESA.2023.67},
annote = {Keywords: Computational geometry, geometric optimization, disk graphs, BFS, Dijkstra’s algorithm, reverse shortest path}
}
@InProceedings{karczmarz_et_al:LIPIcs.ESA.2023.68,
author = {Karczmarz, Adam and Smulewicz, Marcin},
title = {{On Fully Dynamic Strongly Connected Components}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {68:1--68:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.68},
URN = {urn:nbn:de:0030-drops-187211},
doi = {10.4230/LIPIcs.ESA.2023.68},
annote = {Keywords: dynamic strongly connected components, dynamic strong connectivity, dynamic reachability}
}
@InProceedings{katzelnick_et_al:LIPIcs.ESA.2023.69,
author = {Katzelnick, Dor and Pillai, Aditya and Schwartz, Roy and Singh, Mohit},
title = {{An Improved Approximation Algorithm for the Max-3-Section Problem}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {69:1--69:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.69},
URN = {urn:nbn:de:0030-drops-187229},
doi = {10.4230/LIPIcs.ESA.2023.69},
annote = {Keywords: Approximation Algorithms, Semidefinite Programming, Max-Cut, Max-Bisection}
}
@InProceedings{kipouridis:LIPIcs.ESA.2023.70,
author = {Kipouridis, Evangelos},
title = {{Fitting Tree Metrics with Minimum Disagreements}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {70:1--70:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.70},
URN = {urn:nbn:de:0030-drops-187233},
doi = {10.4230/LIPIcs.ESA.2023.70},
annote = {Keywords: Hierarchical Clustering, Tree Metrics, Minimum Disagreements}
}
@InProceedings{klingelhoefer_et_al:LIPIcs.ESA.2023.71,
author = {Klingelhoefer, Felix and Newman, Alantha},
title = {{Coloring Tournaments with Few Colors: Algorithms and Complexity}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {71:1--71:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.71},
URN = {urn:nbn:de:0030-drops-187247},
doi = {10.4230/LIPIcs.ESA.2023.71},
annote = {Keywords: Tournaments, Graph Coloring, Algorithms, Complexity}
}
@InProceedings{kociumaka_et_al:LIPIcs.ESA.2023.72,
author = {Kociumaka, Tomasz and Polak, Adam},
title = {{Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {72:1--72:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.72},
URN = {urn:nbn:de:0030-drops-187257},
doi = {10.4230/LIPIcs.ESA.2023.72},
annote = {Keywords: Fine-grained complexity, graph algorithms, lower bounds, shortest paths}
}
@InProceedings{kogan_et_al:LIPIcs.ESA.2023.73,
author = {Kogan, Shimon and Parter, Merav},
title = {{Towards Bypassing Lower Bounds for Graph Shortcuts}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {73:1--73:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.73},
URN = {urn:nbn:de:0030-drops-187264},
doi = {10.4230/LIPIcs.ESA.2023.73},
annote = {Keywords: Directed Shortcuts, Hopsets, Emulators}
}
@InProceedings{koppl_et_al:LIPIcs.ESA.2023.74,
author = {K\"{o}ppl, Dominik and Kurpicz, Florian and Meyer, Daniel},
title = {{Faster Block Tree Construction}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {74:1--74:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.74},
URN = {urn:nbn:de:0030-drops-187274},
doi = {10.4230/LIPIcs.ESA.2023.74},
annote = {Keywords: compressed data structure, block tree, Lempel-Ziv compression, longest previous factor array, rank and select}
}
@InProceedings{kosinas:LIPIcs.ESA.2023.75,
author = {Kosinas, Evangelos},
title = {{Connectivity Queries Under Vertex Failures: Not Optimal, but Practical}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {75:1--75:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.75},
URN = {urn:nbn:de:0030-drops-187289},
doi = {10.4230/LIPIcs.ESA.2023.75},
annote = {Keywords: Graphs, Connectivity, Fault-Tolerant, Oracles}
}
@InProceedings{kurpisz_et_al:LIPIcs.ESA.2023.76,
author = {Kurpisz, Adam and Suter, Silvan},
title = {{Improved Approximations for Translational Packing of Convex Polygons}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {76:1--76:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.76},
URN = {urn:nbn:de:0030-drops-187299},
doi = {10.4230/LIPIcs.ESA.2023.76},
annote = {Keywords: Approximation algorithms, Packing problems, Convex polygons, Bin packing, Strip packing, Area minimization}
}
@InProceedings{lampis_et_al:LIPIcs.ESA.2023.77,
author = {Lampis, Michael and Vasilakis, Manolis},
title = {{Structural Parameterizations for Two Bounded Degree Problems Revisited}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {77:1--77:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.77},
URN = {urn:nbn:de:0030-drops-187302},
doi = {10.4230/LIPIcs.ESA.2023.77},
annote = {Keywords: ETH, Parameterized Complexity, SETH}
}
@InProceedings{li_et_al:LIPIcs.ESA.2023.78,
author = {Li, Zelin and Peng, Pan and Zhu, Xianbin},
title = {{Massively Parallel Algorithms for the Stochastic Block Model}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {78:1--78:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.78},
URN = {urn:nbn:de:0030-drops-187313},
doi = {10.4230/LIPIcs.ESA.2023.78},
annote = {Keywords: Massively Parallel Computation, Stochastic Block Model, Graph Algorithms}
}
@InProceedings{liang_et_al:LIPIcs.ESA.2023.79,
author = {Liang, Zihui and Khoussainov, Bakh and Takisaka, Toru and Xiao, Mingyu},
title = {{Connectivity in the Presence of an Opponent}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {79:1--79:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.79},
URN = {urn:nbn:de:0030-drops-187324},
doi = {10.4230/LIPIcs.ESA.2023.79},
annote = {Keywords: Explicit M\"{u}ller games, games played on finite graphs, winning strategies, synthesis and analysis of games}
}
@InProceedings{liang_et_al:LIPIcs.ESA.2023.80,
author = {Liang, Jingxun and Tang, Zhihao Gavin and Xu, Yixuan Even and Zhang, Yuhao and Zhou, Renfei},
title = {{On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {80:1--80:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.80},
URN = {urn:nbn:de:0030-drops-187334},
doi = {10.4230/LIPIcs.ESA.2023.80},
annote = {Keywords: Online Matching, AdWords, Ranking, Water-Filling}
}
@InProceedings{mande_et_al:LIPIcs.ESA.2023.81,
author = {Mande, Nikhil S. and de Wolf, Ronald},
title = {{Tight Bounds for Quantum Phase Estimation and Related Problems}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {81:1--81:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.81},
URN = {urn:nbn:de:0030-drops-187346},
doi = {10.4230/LIPIcs.ESA.2023.81},
annote = {Keywords: Phase estimation, quantum computing}
}
@InProceedings{mannens_et_al:LIPIcs.ESA.2023.82,
author = {Mannens, Isja and Nederlof, Jesper},
title = {{A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {82:1--82:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.82},
URN = {urn:nbn:de:0030-drops-187354},
doi = {10.4230/LIPIcs.ESA.2023.82},
annote = {Keywords: Width Parameters, Parameterized Complexity, Tutte Polynomial}
}
@InProceedings{masillo:LIPIcs.ESA.2023.83,
author = {Masillo, Francesco},
title = {{Matching Statistics Speed up BWT Construction}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {83:1--83:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.83},
URN = {urn:nbn:de:0030-drops-187360},
doi = {10.4230/LIPIcs.ESA.2023.83},
annote = {Keywords: Burrows-Wheeler Transform, matching statistics, string collections, compressed representation, data structures, efficient algorithms}
}
@InProceedings{naderi_et_al:LIPIcs.ESA.2023.84,
author = {Naderi, Ismail and Rezapour, Mohsen and Salavatipour, Mohammad R.},
title = {{Approximation Schemes for Min-Sum k-Clustering}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {84:1--84:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.84},
URN = {urn:nbn:de:0030-drops-187379},
doi = {10.4230/LIPIcs.ESA.2023.84},
annote = {Keywords: Approximation Algorithms, Clustering, Dynamic Programming}
}
@InProceedings{oh_et_al:LIPIcs.ESA.2023.85,
author = {Oh, Eunjin and Oh, Seunghyeok},
title = {{Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {85:1--85:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.85},
URN = {urn:nbn:de:0030-drops-187384},
doi = {10.4230/LIPIcs.ESA.2023.85},
annote = {Keywords: Maximum cliques, hyperbolic random graphs}
}
@InProceedings{osipov_et_al:LIPIcs.ESA.2023.86,
author = {Osipov, George and Wahlstr\"{o}m, Magnus},
title = {{Parameterized Complexity of Equality MinCSP}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {86:1--86:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.86},
URN = {urn:nbn:de:0030-drops-187393},
doi = {10.4230/LIPIcs.ESA.2023.86},
annote = {Keywords: parameterized complexity, constraint satisfaction, parameterized approximation}
}
@InProceedings{panagiotas_et_al:LIPIcs.ESA.2023.87,
author = {Panagiotas, Ioannis and Pichon, Gr\'{e}goire and Singh, Somesh and U\c{c}ar, Bora},
title = {{Engineering Fast Algorithms for the Bottleneck Matching Problem}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {87:1--87:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.87},
URN = {urn:nbn:de:0030-drops-187406},
doi = {10.4230/LIPIcs.ESA.2023.87},
annote = {Keywords: bipartite graphs, assignment problem, matching}
}
@InProceedings{pioro:LIPIcs.ESA.2023.88,
author = {Pi\'{o}ro, Krzysztof},
title = {{Subcubic Algorithm for (Unweighted) Unrooted Tree Edit Distance}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {88:1--88:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.88},
URN = {urn:nbn:de:0030-drops-187415},
doi = {10.4230/LIPIcs.ESA.2023.88},
annote = {Keywords: tree edit distance, dynamic programming, matrix multiplication}
}
@InProceedings{radoszewski:LIPIcs.ESA.2023.89,
author = {Radoszewski, Jakub},
title = {{Linear Time Construction of Cover Suffix Tree and Applications}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {89:1--89:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.89},
URN = {urn:nbn:de:0030-drops-187428},
doi = {10.4230/LIPIcs.ESA.2023.89},
annote = {Keywords: cover (quasiperiod), seed, suffix tree, run (maximal repetition)}
}
@InProceedings{rutter_et_al:LIPIcs.ESA.2023.90,
author = {Rutter, Ignaz and Stumpf, Peter},
title = {{Simultaneous Representation of Interval Graphs in the Sunflower Case}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {90:1--90:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.90},
URN = {urn:nbn:de:0030-drops-187435},
doi = {10.4230/LIPIcs.ESA.2023.90},
annote = {Keywords: Interval Graphs, Sunflower Case, Simultaneous Representation, Recognition, Geometric Intersection Graphs}
}
@InProceedings{sadigurschi_et_al:LIPIcs.ESA.2023.91,
author = {Sadigurschi, Menachem and Shechner, Moshe and Stemmer, Uri},
title = {{Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice Model}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {91:1--91:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.91},
URN = {urn:nbn:de:0030-drops-187445},
doi = {10.4230/LIPIcs.ESA.2023.91},
annote = {Keywords: streaming, adversarial streaming}
}
@InProceedings{saranurak_et_al:LIPIcs.ESA.2023.92,
author = {Saranurak, Thatchaphol and Yuan, Wuwei},
title = {{Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {92:1--92:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.92},
URN = {urn:nbn:de:0030-drops-187451},
doi = {10.4230/LIPIcs.ESA.2023.92},
annote = {Keywords: Graph algorithms, Maximal k-edge-connected subgraphs, Dynamic k-edge connectivity}
}
@InProceedings{schieber_et_al:LIPIcs.ESA.2023.93,
author = {Schieber, Baruch and Vahidi, Soroush},
title = {{Approximating Connected Maximum Cuts via Local Search}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {93:1--93:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.93},
URN = {urn:nbn:de:0030-drops-187466},
doi = {10.4230/LIPIcs.ESA.2023.93},
annote = {Keywords: approximation algorithms, graph theory, max-cut, local search}
}
@InProceedings{sellier:LIPIcs.ESA.2023.94,
author = {Sellier, Fran\c{c}ois},
title = {{Parameterized Matroid-Constrained Maximum Coverage}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {94:1--94:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.94},
URN = {urn:nbn:de:0030-drops-187475},
doi = {10.4230/LIPIcs.ESA.2023.94},
annote = {Keywords: Matroids, approximate kernel, maximum coverage}
}
@InProceedings{sonar_et_al:LIPIcs.ESA.2023.95,
author = {Sonar, Chinmay and Suri, Subhash and Xue, Jie},
title = {{Fault Tolerance in Euclidean Committee Selection}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {95:1--95:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.95},
URN = {urn:nbn:de:0030-drops-187489},
doi = {10.4230/LIPIcs.ESA.2023.95},
annote = {Keywords: Multiwinner elections, Fault tolerance, Geometric Hitting Set, EPTAS}
}
@InProceedings{sroka_et_al:LIPIcs.ESA.2023.96,
author = {Sroka, Jacek and Tyszkiewicz, Jerzy},
title = {{Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {96:1--96:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.96},
URN = {urn:nbn:de:0030-drops-187497},
doi = {10.4230/LIPIcs.ESA.2023.96},
annote = {Keywords: Aggregation over dominated points prefix sums sorting flat map range tree parallel algorithms}
}
@InProceedings{sun_et_al:LIPIcs.ESA.2023.97,
author = {Sun, Enze and Yang, Zonghan and Zhang, Yuhao},
title = {{Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {97:1--97:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.97},
URN = {urn:nbn:de:0030-drops-187500},
doi = {10.4230/LIPIcs.ESA.2023.97},
annote = {Keywords: Online Algorithm, Scheduling, Machine Minimization, Rent Minimization}
}
@InProceedings{sun_et_al:LIPIcs.ESA.2023.98,
author = {Sun, Xiaoming and Zhang, Jialin and Zhang, Zhijie},
title = {{Simple Deterministic Approximation for Submodular Multiple Knapsack Problem}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {98:1--98:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.98},
URN = {urn:nbn:de:0030-drops-187517},
doi = {10.4230/LIPIcs.ESA.2023.98},
annote = {Keywords: Submodular maximization, knapsack problem, deterministic algorithm}
}
@InProceedings{vanrenssen_et_al:LIPIcs.ESA.2023.99,
author = {van Renssen, Andr\'{e} and Sha, Yuan and Sun, Yucheng and Wong, Sampson},
title = {{The Tight Spanning Ratio of the Rectangle Delaunay Triangulation}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {99:1--99:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.99},
URN = {urn:nbn:de:0030-drops-187523},
doi = {10.4230/LIPIcs.ESA.2023.99},
annote = {Keywords: Spanners, Delaunay Triangulation, Spanning Ratio}
}
@InProceedings{verbitsky_et_al:LIPIcs.ESA.2023.100,
author = {Verbitsky, Oleg and Zhukovskii, Maksim},
title = {{Canonization of a Random Graph by Two Matrix-Vector Multiplications}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {100:1--100:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.100},
URN = {urn:nbn:de:0030-drops-187536},
doi = {10.4230/LIPIcs.ESA.2023.100},
annote = {Keywords: Graph Isomorphism, canonical labeling, random graphs, walk matrix, color refinement, linear time}
}
@InProceedings{wang_et_al:LIPIcs.ESA.2023.101,
author = {Wang, Haitao and Zhao, Yiming},
title = {{Improved Algorithms for Distance Selection and Related Problems}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {101:1--101:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.101},
URN = {urn:nbn:de:0030-drops-187544},
doi = {10.4230/LIPIcs.ESA.2023.101},
annote = {Keywords: Geometric optimization, distance selection, Fr\'{e}chet distance, range searching}
}
@InProceedings{warneke_et_al:LIPIcs.ESA.2023.102,
author = {Warneke, Rowan and Choudhury, Farhana and Wirth, Anthony},
title = {{Maximum Coverage in Random-Arrival Streams}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {102:1--102:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.102},
URN = {urn:nbn:de:0030-drops-187559},
doi = {10.4230/LIPIcs.ESA.2023.102},
annote = {Keywords: Maximum Coverage, Streaming Algorithm, Random Arrival, Greedy Algorithm, Communication Complexity}
}
@InProceedings{yang_et_al:LIPIcs.ESA.2023.103,
author = {Yang, Chuhan and Musco, Christopher},
title = {{Efficient Block Approximate Matrix Multiplication}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {103:1--103:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.103},
URN = {urn:nbn:de:0030-drops-187562},
doi = {10.4230/LIPIcs.ESA.2023.103},
annote = {Keywords: Approximate matrix multiplication, randomized numerical linear algebra, trace estimation}
}
@InProceedings{zuzic:LIPIcs.ESA.2023.104,
author = {Zuzic, Goran},
title = {{A Simple Boosting Framework for Transshipment}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {104:1--104:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.104},
URN = {urn:nbn:de:0030-drops-187570},
doi = {10.4230/LIPIcs.ESA.2023.104},
annote = {Keywords: mixed continuous-discrete optimization, boosting, multiplicative weights, theoretical computer science, shortest path, parallel algorithms}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing