29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 1-1340, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Proceedings{mutzel_et_al:LIPIcs.ESA.2021, title = {{LIPIcs, Volume 204, ESA 2021, Complete Volume}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {1--1340}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021}, URN = {urn:nbn:de:0030-drops-145808}, doi = {10.4230/LIPIcs.ESA.2021}, annote = {Keywords: LIPIcs, Volume 204, ESA 2021, Complete Volume} }
29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{mutzel_et_al:LIPIcs.ESA.2021.0, author = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.0}, URN = {urn:nbn:de:0030-drops-145816}, doi = {10.4230/LIPIcs.ESA.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Lukas Glomb, Benno Hoch, Frauke Liers, and Florian Rösel. Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk). In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 1:1-1:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{glomb_et_al:LIPIcs.ESA.2021.1, author = {Glomb, Lukas and Hoch, Benno and Liers, Frauke and R\"{o}sel, Florian}, title = {{Network Planning and Routing Problems over Time: Models, Complexity and Algorithms}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {1:1--1:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.1}, URN = {urn:nbn:de:0030-drops-145822}, doi = {10.4230/LIPIcs.ESA.2021.1}, annote = {Keywords: network problems over time, rolling-horizon, complexity, approximation} }
Aaron Roth. A User Friendly Power Tool for Deriving Online Learning Algorithms (Invited Talk). In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{roth:LIPIcs.ESA.2021.2, author = {Roth, Aaron}, title = {{A User Friendly Power Tool for Deriving Online Learning Algorithms}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.2}, URN = {urn:nbn:de:0030-drops-145835}, doi = {10.4230/LIPIcs.ESA.2021.2}, annote = {Keywords: Online Learning, Multicalibration, Multivalidity, Blackwell Approachability} }
Saman Ahmadi, Guido Tack, Daniel Harabor, and Philip Kilby. Bi-Objective Search with Bi-Directional A*. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ahmadi_et_al:LIPIcs.ESA.2021.3, author = {Ahmadi, Saman and Tack, Guido and Harabor, Daniel and Kilby, Philip}, title = {{Bi-Objective Search with Bi-Directional A*}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.3}, URN = {urn:nbn:de:0030-drops-145849}, doi = {10.4230/LIPIcs.ESA.2021.3}, annote = {Keywords: Bi-objective search, heuristic search, shortest path problem} }
Maor Akav and Liam Roditty. A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 4:1-4:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{akav_et_al:LIPIcs.ESA.2021.4, author = {Akav, Maor and Roditty, Liam}, title = {{A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {4:1--4:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.4}, URN = {urn:nbn:de:0030-drops-145858}, doi = {10.4230/LIPIcs.ESA.2021.4}, annote = {Keywords: Graph algorithms, Approximate All Pairs of Shortest Paths, Distance Oracles} }
Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savić, Hendrik Schrezenmaier, Carlos Seara, and Martin Suderland. The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{alegria_et_al:LIPIcs.ESA.2021.5, author = {Alegr{\'\i}a, Carlos and Mantas, Ioannis and Papadopoulou, Evanthia and Savi\'{c}, Marko and Schrezenmaier, Hendrik and Seara, Carlos and Suderland, Martin}, title = {{The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.5}, URN = {urn:nbn:de:0030-drops-145865}, doi = {10.4230/LIPIcs.ESA.2021.5}, annote = {Keywords: rotating rays, Voronoi diagram, oriented angular distance, Brocard angle, floodlight illumination, coverage problems, art gallery problems} }
Markus Anders and Pascal Schweitzer. Parallel Computation of Combinatorial Symmetries. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{anders_et_al:LIPIcs.ESA.2021.6, author = {Anders, Markus and Schweitzer, Pascal}, title = {{Parallel Computation of Combinatorial Symmetries}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.6}, URN = {urn:nbn:de:0030-drops-145875}, doi = {10.4230/LIPIcs.ESA.2021.6}, annote = {Keywords: graph isomorphism, automorphism groups, algorithm engineering, parallel algorithms} }
Sepehr Assadi, Deeparnab Chakrabarty, and Sanjeev Khanna. Graph Connectivity and Single Element Recovery via Linear and OR Queries. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 7:1-7:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{assadi_et_al:LIPIcs.ESA.2021.7, author = {Assadi, Sepehr and Chakrabarty, Deeparnab and Khanna, Sanjeev}, title = {{Graph Connectivity and Single Element Recovery via Linear and OR Queries}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {7:1--7:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.7}, URN = {urn:nbn:de:0030-drops-145880}, doi = {10.4230/LIPIcs.ESA.2021.7}, annote = {Keywords: Query Models, Graph Connectivity, Group Testing, Duality} }
Sepehr Assadi and Shay Solomon. Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{assadi_et_al:LIPIcs.ESA.2021.8, author = {Assadi, Sepehr and Solomon, Shay}, title = {{Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.8}, URN = {urn:nbn:de:0030-drops-145899}, doi = {10.4230/LIPIcs.ESA.2021.8}, annote = {Keywords: dynamic graph algorithms, hypergraph, maximal matching, matching, set cover} }
Nikhil Ayyadevara and Ashish Chiplunkar. The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 9:1-9:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ayyadevara_et_al:LIPIcs.ESA.2021.9, author = {Ayyadevara, Nikhil and Chiplunkar, Ashish}, title = {{The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {9:1--9:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.9}, URN = {urn:nbn:de:0030-drops-145904}, doi = {10.4230/LIPIcs.ESA.2021.9}, annote = {Keywords: weighted k-server, competitive analysis} }
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schlöter. Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bampis_et_al:LIPIcs.ESA.2021.10, author = {Bampis, Evripidis and D\"{u}rr, Christoph and Erlebach, Thomas and de Lima, Murilo Santos and Megow, Nicole and Schl\"{o}ter, Jens}, title = {{Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.10}, URN = {urn:nbn:de:0030-drops-145910}, doi = {10.4230/LIPIcs.ESA.2021.10}, annote = {Keywords: Explorable uncertainty, queries, stochastic optimization, graph orientation, selection problems} }
Jørgen Bang-Jensen, Kristine Vitting Klinkby, and Saket Saurabh. k-Distinct Branchings Admits a Polynomial Kernel. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bangjensen_et_al:LIPIcs.ESA.2021.11, author = {Bang-Jensen, J{\o}rgen and Klinkby, Kristine Vitting and Saurabh, Saket}, title = {{k-Distinct Branchings Admits a Polynomial Kernel}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.11}, URN = {urn:nbn:de:0030-drops-145925}, doi = {10.4230/LIPIcs.ESA.2021.11}, annote = {Keywords: Digraphs, Polynomial Kernel, In-branching, Out-Branching} }
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, and Clifford Stein. Incremental Edge Orientation in Forests. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 12:1-12:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bender_et_al:LIPIcs.ESA.2021.12, author = {Bender, Michael A. and Kopelowitz, Tsvi and Kuszmaul, William and Porat, Ely and Stein, Clifford}, title = {{Incremental Edge Orientation in Forests}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {12:1--12:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.12}, URN = {urn:nbn:de:0030-drops-145933}, doi = {10.4230/LIPIcs.ESA.2021.12}, annote = {Keywords: edge orientation, graph algorithms, Cuckoo hashing, hash functions} }
Mark de Berg, Morteza Monemizadeh, and Yu Zhong. k-Center Clustering with Outliers in the Sliding-Window Model. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{deberg_et_al:LIPIcs.ESA.2021.13, author = {de Berg, Mark and Monemizadeh, Morteza and Zhong, Yu}, title = {{k-Center Clustering with Outliers in the Sliding-Window Model}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.13}, URN = {urn:nbn:de:0030-drops-145945}, doi = {10.4230/LIPIcs.ESA.2021.13}, annote = {Keywords: Streaming algorithms, k-center problem, sliding window, bounded doubling dimension} }
Aaron Bernstein, Aditi Dudeja, and Seth Pettie. Incremental SCC Maintenance in Sparse Graphs. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bernstein_et_al:LIPIcs.ESA.2021.14, author = {Bernstein, Aaron and Dudeja, Aditi and Pettie, Seth}, title = {{Incremental SCC Maintenance in Sparse Graphs}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.14}, URN = {urn:nbn:de:0030-drops-145950}, doi = {10.4230/LIPIcs.ESA.2021.14}, annote = {Keywords: Directed Graphs, Strongly Connected Components, Dynamic Graph Algorithms} }
Nico Bertram, Jonas Ellert, and Johannes Fischer. Lyndon Words Accelerate Suffix Sorting. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 15:1-15:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bertram_et_al:LIPIcs.ESA.2021.15, author = {Bertram, Nico and Ellert, Jonas and Fischer, Johannes}, title = {{Lyndon Words Accelerate Suffix Sorting}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.15}, URN = {urn:nbn:de:0030-drops-145961}, doi = {10.4230/LIPIcs.ESA.2021.15}, annote = {Keywords: Suffix array, suffix sorting, Lyndon words, string algorithms} }
Sujoy Bhore and Csaba D. Tóth. Online Euclidean Spanners. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 16:1-16:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bhore_et_al:LIPIcs.ESA.2021.16, author = {Bhore, Sujoy and T\'{o}th, Csaba D.}, title = {{Online Euclidean Spanners}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {16:1--16:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.16}, URN = {urn:nbn:de:0030-drops-145974}, doi = {10.4230/LIPIcs.ESA.2021.16}, annote = {Keywords: Geometric spanner, (1+\epsilon)-spanner, minimum weight, online algorithm} }
Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, and Graeme Stroud. Distant Representatives for Rectangles in the Plane. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 17:1-17:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{biedl_et_al:LIPIcs.ESA.2021.17, author = {Biedl, Therese and Lubiw, Anna and Naredla, Anurag Murty and Ralbovsky, Peter Dominik and Stroud, Graeme}, title = {{Distant Representatives for Rectangles in the Plane}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {17:1--17:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.17}, URN = {urn:nbn:de:0030-drops-145982}, doi = {10.4230/LIPIcs.ESA.2021.17}, annote = {Keywords: Distant representatives, blocker shapes, matching, approximation algorithm, APX-hardness} }
Davide Bilò, Sarel Cohen, Tobias Friedrich, and Martin Schirneck. Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bilo_et_al:LIPIcs.ESA.2021.18, author = {Bil\`{o}, Davide and Cohen, Sarel and Friedrich, Tobias and Schirneck, Martin}, title = {{Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.18}, URN = {urn:nbn:de:0030-drops-145999}, doi = {10.4230/LIPIcs.ESA.2021.18}, annote = {Keywords: derandomization, distance sensitivity oracle, single-source replacement paths, space lower bound} }
Thomas Bläsius, Simon D. Fink, and Ignaz Rutter. Synchronized Planarity with Applications to Constrained Planarity Problems. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{blasius_et_al:LIPIcs.ESA.2021.19, author = {Bl\"{a}sius, Thomas and Fink, Simon D. and Rutter, Ignaz}, title = {{Synchronized Planarity with Applications to Constrained Planarity Problems}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.19}, URN = {urn:nbn:de:0030-drops-146009}, doi = {10.4230/LIPIcs.ESA.2021.19}, annote = {Keywords: Planarity Testing, Constrained Planarity, Cluster Planarity, Atomic Embeddability} }
Thomas Bläsius, Tobias Friedrich, and Maximilian Katzmann. Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 20:1-20:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{blasius_et_al:LIPIcs.ESA.2021.20, author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Katzmann, Maximilian}, title = {{Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.20}, URN = {urn:nbn:de:0030-drops-146012}, doi = {10.4230/LIPIcs.ESA.2021.20}, annote = {Keywords: vertex cover, approximation, random graphs, hyperbolic geometry, efficient algorithm} }
Thomas Bläsius, Tobias Friedrich, and Christopher Weyand. Efficiently Computing Maximum Flows in Scale-Free Networks. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{blasius_et_al:LIPIcs.ESA.2021.21, author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Weyand, Christopher}, title = {{Efficiently Computing Maximum Flows in Scale-Free Networks}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.21}, URN = {urn:nbn:de:0030-drops-146029}, doi = {10.4230/LIPIcs.ESA.2021.21}, annote = {Keywords: graphs, flow, network, scale-free} }
Alexander Braun, Matthias Buttkus, and Thomas Kesselheim. Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{braun_et_al:LIPIcs.ESA.2021.22, author = {Braun, Alexander and Buttkus, Matthias and Kesselheim, Thomas}, title = {{Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.22}, URN = {urn:nbn:de:0030-drops-146038}, doi = {10.4230/LIPIcs.ESA.2021.22}, annote = {Keywords: Prophet Inequalities, Monotone Hazard Rate, Competitive Analysis, Posted Prices, Combinatorial Auctions, Matching} }
David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie. Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{caballero_et_al:LIPIcs.ESA.2021.23, author = {Caballero, David and Gomez, Timothy and Schweller, Robert and Wylie, Tim}, title = {{Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.23}, URN = {urn:nbn:de:0030-drops-146047}, doi = {10.4230/LIPIcs.ESA.2021.23}, annote = {Keywords: self-assembly, covert computation, staged self-assembly, assembly verification} }
Jean Cardinal, Justin Dallant, and John Iacono. An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cardinal_et_al:LIPIcs.ESA.2021.24, author = {Cardinal, Jean and Dallant, Justin and Iacono, John}, title = {{An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.24}, URN = {urn:nbn:de:0030-drops-146057}, doi = {10.4230/LIPIcs.ESA.2021.24}, annote = {Keywords: computational geometry, instance-optimality, colored point sets, empty rectangles, visibility} }
Jean Cardinal, John Iacono, and Grigorios Koumoutsos. Worst-Case Efficient Dynamic Geometric Independent Set. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cardinal_et_al:LIPIcs.ESA.2021.25, author = {Cardinal, Jean and Iacono, John and Koumoutsos, Grigorios}, title = {{Worst-Case Efficient Dynamic Geometric Independent Set}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {25:1--25:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.25}, URN = {urn:nbn:de:0030-drops-146061}, doi = {10.4230/LIPIcs.ESA.2021.25}, annote = {Keywords: Maximum independent set, deamortization, approximation} }
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, and Ziena Zeif. Balanced Crown Decomposition for Connectivity Constraints. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{casel_et_al:LIPIcs.ESA.2021.26, author = {Casel, Katrin and Friedrich, Tobias and Issac, Davis and Niklanovits, Aikaterini and Zeif, Ziena}, title = {{Balanced Crown Decomposition for Connectivity Constraints}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.26}, URN = {urn:nbn:de:0030-drops-146076}, doi = {10.4230/LIPIcs.ESA.2021.26}, annote = {Keywords: crown decomposition, connected partition, balanced partition, approximation algorithms} }
Timothy M. Chan. All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 27:1-27:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chan:LIPIcs.ESA.2021.27, author = {Chan, Timothy M.}, title = {{All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {27:1--27:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.27}, URN = {urn:nbn:de:0030-drops-146086}, doi = {10.4230/LIPIcs.ESA.2021.27}, annote = {Keywords: Shortest paths, approximation, matrix multiplication} }
Timothy M. Chan and Zhengcheng Huang. Dynamic Colored Orthogonal Range Searching. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 28:1-28:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chan_et_al:LIPIcs.ESA.2021.28, author = {Chan, Timothy M. and Huang, Zhengcheng}, title = {{Dynamic Colored Orthogonal Range Searching}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {28:1--28:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.28}, URN = {urn:nbn:de:0030-drops-146090}, doi = {10.4230/LIPIcs.ESA.2021.28}, annote = {Keywords: Range searching, dynamic data structures, word RAM} }