LIPIcs, Volume 274
ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands
Editors: Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman
LIPIcs, Volume 157
FUN 2021, May 30 to June 1, 2021, Favignana Island, Sicily, Italy
Editors: Martin Farach-Colton, Giuseppe Prencipe, and Ryuhei Uehara
Published in: Dagstuhl Reports, Volume 13, Issue 2 (2023)
Martin Farach-Colton, Fabian Daniel Kuhn, Ronitt Rubinfeld, and Przemysław Uznański. From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071). In Dagstuhl Reports, Volume 13, Issue 2, pp. 33-46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@Article{farachcolton_et_al:DagRep.13.2.33, author = {Farach-Colton, Martin and Kuhn, Fabian Daniel and Rubinfeld, Ronitt and Uzna\'{n}ski, Przemys{\l}aw}, title = {{From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071)}}, pages = {33--46}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {13}, number = {2}, editor = {Farach-Colton, Martin and Kuhn, Fabian Daniel and Rubinfeld, Ronitt and Uzna\'{n}ski, Przemys{\l}aw}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.2.33}, URN = {urn:nbn:de:0030-drops-191809}, doi = {10.4230/DagRep.13.2.33}, annote = {Keywords: external memory, local algorithms, sublinear algorithms} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 1-1700, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@Proceedings{gortz_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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 0:i-0:xxii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{gortz_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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Martin Dietzfelbinger. On Hashing by (Random) Equations (Invited Talk). In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, p. 1:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Amir Abboud, Mina Dalirrooyfard, Ray Li, and Virginia Vassilevska Williams. On Diameter Approximation in Directed Graphs. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 2:1-2:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., and Ron Safier. Can You Solve Closest String Faster Than Exhaustive Search?. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 3:1-3:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Amir Abboud, Shay Mozes, and Oren Weimann. What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 4:1-4:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Ahmed Abdelkader and David M. Mount. Smooth Distance Approximation. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 5:1-5:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, and Thomas Weighill. Reconfiguration of Polygonal Subdivisions via Recombination. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 6:1-6:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, and Zixuan Xu. Faster Detours in Undirected Graphs. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 7:1-7:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Shyan Akmal and Nicole Wein. A Local-To-Global Theorem for Congested Shortest Paths. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 8:1-8:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt. Axis-Parallel Right Angle Crossing Graphs. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 9:1-9:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Simon Apers, Stacey Jeffery, Galina Pass, and Michael Walter. (No) Quantum Space-Time Tradeoff for USTCON. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 10:1-10:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Feedback for Dagstuhl Publishing