@Proceedings{chan_et_al:LIPIcs.ESA.2024,
title = {{LIPIcs, Volume 308, ESA 2024, Complete Volume}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {1--1734},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024},
URN = {urn:nbn:de:0030-drops-210704},
doi = {10.4230/LIPIcs.ESA.2024},
annote = {Keywords: LIPIcs, Volume 308, ESA 2024, Complete Volume}
}
@InProceedings{chan_et_al:LIPIcs.ESA.2024.0,
author = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {0:i--0:xxii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.0},
URN = {urn:nbn:de:0030-drops-210714},
doi = {10.4230/LIPIcs.ESA.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{cohenaddad:LIPIcs.ESA.2024.1,
author = {Cohen-Addad, Vincent},
title = {{Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {1:1--1:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.1},
URN = {urn:nbn:de:0030-drops-210728},
doi = {10.4230/LIPIcs.ESA.2024.1},
annote = {Keywords: Approximation Algorithms, Clustering, Local Model}
}
@InProceedings{rotenberg:LIPIcs.ESA.2024.2,
author = {Rotenberg, Eva},
title = {{Simple}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {2:1--2:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.2},
URN = {urn:nbn:de:0030-drops-210739},
doi = {10.4230/LIPIcs.ESA.2024.2},
annote = {Keywords: Simplicity, graph algorithms, computational geometry, algorithmic simplification, data structures, combinatorics, proof simplification, dynamic graphs}
}
@InProceedings{abboud_et_al:LIPIcs.ESA.2024.3,
author = {Abboud, Amir and Grossman, Tomer and Naor, Moni and Solomon, Tomer},
title = {{From Donkeys to Kings in Tournaments}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.3},
URN = {urn:nbn:de:0030-drops-210740},
doi = {10.4230/LIPIcs.ESA.2024.3},
annote = {Keywords: Tournament Graphs, Kings, Query Complexity, Fine Grained Complexity}
}
@InProceedings{abboud_et_al:LIPIcs.ESA.2024.4,
author = {Abboud, Amir and Wallheimer, Nathan},
title = {{Worst-Case to Expander-Case Reductions: Derandomized and Generalized}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.4},
URN = {urn:nbn:de:0030-drops-210751},
doi = {10.4230/LIPIcs.ESA.2024.4},
annote = {Keywords: Fine-grained complexity, expander graphs, self-reductions, worst-case to expander-case, expander decomposition, dynamic algorithms, exact and parameterized complexity, max-cut, maximum matching, k-clique detection, densest subgraph}
}
@InProceedings{abrahamsen_et_al:LIPIcs.ESA.2024.5,
author = {Abrahamsen, Mikkel and Bercea, Ioana O. and Beretta, Lorenzo and Klausen, Jonas and Kozma, L\'{a}szl\'{o}},
title = {{Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {5:1--5:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.5},
URN = {urn:nbn:de:0030-drops-210766},
doi = {10.4230/LIPIcs.ESA.2024.5},
annote = {Keywords: sorting, online algorithm, TSP}
}
@InProceedings{agarwal_et_al:LIPIcs.ESA.2024.6,
author = {Agarwal, Pankaj K. and Ezra, Esther and Sharir, Micha},
title = {{Lower Envelopes of Surface Patches in 3-Space}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.6},
URN = {urn:nbn:de:0030-drops-210772},
doi = {10.4230/LIPIcs.ESA.2024.6},
annote = {Keywords: Hierarchical cuttings, surface patches in 3-space, lower envelopes, charging scheme, gradation}
}
@InProceedings{agarwal_et_al:LIPIcs.ESA.2024.7,
author = {Agarwal, Pankaj K. and Kaplan, Haim and Katz, Matthew J. and Sharir, Micha},
title = {{Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {7:1--7:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.7},
URN = {urn:nbn:de:0030-drops-210782},
doi = {10.4230/LIPIcs.ESA.2024.7},
annote = {Keywords: segment proximity graphs, nearest neighbor searching, dynamic data structures, BFS, DFS, unit-disk graphs}
}
@InProceedings{alexandru_et_al:LIPIcs.ESA.2024.8,
author = {Alexandru, Cezar-Mihail and Konrad, Christian},
title = {{Interval Selection in Sliding Windows}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {8:1--8:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.8},
URN = {urn:nbn:de:0030-drops-210795},
doi = {10.4230/LIPIcs.ESA.2024.8},
annote = {Keywords: Sliding window algorithms, Streaming algorithms, Interval selection}
}
@InProceedings{aman_et_al:LIPIcs.ESA.2024.9,
author = {Aman, Enver and Karthik C. S. and Punna, Sharath},
title = {{On Connections Between k-Coloring and Euclidean k-Means}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.9},
URN = {urn:nbn:de:0030-drops-210808},
doi = {10.4230/LIPIcs.ESA.2024.9},
annote = {Keywords: k-means, k-minsum, Euclidean space, fine-grained complexity}
}
@InProceedings{an_et_al:LIPIcs.ESA.2024.10,
author = {An, Shinwoo and Oh, Eunjin and Xue, Jie},
title = {{Sparse Outerstring Graphs Have Logarithmic Treewidth}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {10:1--10:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.10},
URN = {urn:nbn:de:0030-drops-210816},
doi = {10.4230/LIPIcs.ESA.2024.10},
annote = {Keywords: Outerstring graphs, geometric intersection graphs, treewidth}
}
@InProceedings{angrick_et_al:LIPIcs.ESA.2024.11,
author = {Angrick, Sebastian and Bals, Ben and Friedrich, Tobias and Gawendowicz, Hans and Hastrich, Niko and Klodt, Nicolas and Lenzner, Pascal and Schmidt, Jonas and Skretas, George and Wells, Armin},
title = {{How to Reduce Temporal Cliques to Find Sparse Spanners}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.11},
URN = {urn:nbn:de:0030-drops-210822},
doi = {10.4230/LIPIcs.ESA.2024.11},
annote = {Keywords: Temporal Graphs, temporal Clique, temporal Spanner, Reachability, Graph Connectivity, Graph Sparsification}
}
@InProceedings{arora_et_al:LIPIcs.ESA.2024.12,
author = {Arora, Vipul and Bhattacharyya, Arnab and Boban, Mathews and Guruswami, Venkatesan and Kelman, Esty},
title = {{Outlier Robust Multivariate Polynomial Regression}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.12},
URN = {urn:nbn:de:0030-drops-210830},
doi = {10.4230/LIPIcs.ESA.2024.12},
annote = {Keywords: Robust Statistics, Polynomial Regression, Sample Efficient Learning}
}
@InProceedings{ashvinkumar_et_al:LIPIcs.ESA.2024.13,
author = {Ashvinkumar, Vikrant and Bernstein, Aaron and Cao, Nairen and Grunau, Christoph and Haeupler, Bernhard and Jiang, Yonggang and Nanongkai, Danupon and Su, Hsin-Hao},
title = {{Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.13},
URN = {urn:nbn:de:0030-drops-210849},
doi = {10.4230/LIPIcs.ESA.2024.13},
annote = {Keywords: Parallel algorithm, distributed algorithm, shortest paths}
}
@InProceedings{bai_et_al:LIPIcs.ESA.2024.14,
author = {Bai, Yuhang and B\'{e}rczi, Krist\'{o}f and Cs\'{a}ji, Gergely and Schwarcz, Tam\'{a}s},
title = {{Approximating Maximum-Size Properly Colored Forests}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.14},
URN = {urn:nbn:de:0030-drops-210858},
doi = {10.4230/LIPIcs.ESA.2024.14},
annote = {Keywords: Approximation algorithm, (1,2)-traveling salesman problem, Degree bounded spanning tree, Properly colored forest}
}
@InProceedings{baligacs_et_al:LIPIcs.ESA.2024.15,
author = {Balig\'{a}cs, J\'{u}lia and Disser, Yann and Feldmann, Andreas Emil and Zych-Pawlewicz, Anna},
title = {{A (5/3+\epsilon)-Approximation for Tricolored Non-Crossing Euclidean TSP}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.15},
URN = {urn:nbn:de:0030-drops-210862},
doi = {10.4230/LIPIcs.ESA.2024.15},
annote = {Keywords: Approximation Algorithms, geometric Network Optimization, Euclidean TSP, non-crossing Structures}
}
@InProceedings{banerjee_et_al:LIPIcs.ESA.2024.16,
author = {Banerjee, Aranya and Gibney, Daniel and Thankachan, Sharma V.},
title = {{Longest Common Substring with Gaps and Related Problems}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.16},
URN = {urn:nbn:de:0030-drops-210877},
doi = {10.4230/LIPIcs.ESA.2024.16},
annote = {Keywords: Pattern Matching, Longest Common Subsequence, Episode Matching}
}
@InProceedings{banik_et_al:LIPIcs.ESA.2024.17,
author = {Banik, Aritra and Fomin, Fedor V. and Golovach, Petr A. and Inamdar, Tanmay and Jana, Satyabrata and Saurabh, Saket},
title = {{Cuts in Graphs with Matroid Constraints}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.17},
URN = {urn:nbn:de:0030-drops-210887},
doi = {10.4230/LIPIcs.ESA.2024.17},
annote = {Keywords: s-t-cut, multiway Cut, matroid, odd cycle transversal, feedback vertex set, fixed-parameter tractability}
}
@InProceedings{bannai_et_al:LIPIcs.ESA.2024.18,
author = {Bannai, Hideo and Funakoshi, Mitsuru and Hendrian, Diptarama and Matsuda, Myuji and Puglisi, Simon J.},
title = {{Height-Bounded Lempel-Ziv Encodings}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.18},
URN = {urn:nbn:de:0030-drops-210899},
doi = {10.4230/LIPIcs.ESA.2024.18},
annote = {Keywords: Lempel-Ziv parsing, data compression}
}
@InProceedings{bathie_et_al:LIPIcs.ESA.2024.19,
author = {Bathie, Gabriel and Charalampopoulos, Panagiotis and Starikovskaya, Tatiana},
title = {{Longest Common Extensions with Wildcards: Trade-Off and Applications}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {19:1--19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.19},
URN = {urn:nbn:de:0030-drops-210904},
doi = {10.4230/LIPIcs.ESA.2024.19},
annote = {Keywords: Longest common prefix, longest common extension, wildcards, Boolean matrix multiplication, approximate pattern matching, periodicity arrays}
}
@InProceedings{bathie_et_al:LIPIcs.ESA.2024.20,
author = {Bathie, Gabriel and Charalampopoulos, Panagiotis and Starikovskaya, Tatiana},
title = {{Pattern Matching with Mismatches and Wildcards}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {20:1--20:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.20},
URN = {urn:nbn:de:0030-drops-210910},
doi = {10.4230/LIPIcs.ESA.2024.20},
annote = {Keywords: pattern matching, wildcards, mismatches, Hamming distance}
}
@InProceedings{belova_et_al:LIPIcs.ESA.2024.21,
author = {Belova, Tatiana and Chukhin, Nikolai and Kulikov, Alexander S. and Mihajlin, Ivan},
title = {{Improved Space Bounds for Subset Sum}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {21:1--21:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.21},
URN = {urn:nbn:de:0030-drops-210925},
doi = {10.4230/LIPIcs.ESA.2024.21},
annote = {Keywords: algorithms, subset sum, complexity, space, upper bounds}
}
@InProceedings{berczi_et_al:LIPIcs.ESA.2024.22,
author = {B\'{e}rczi, Krist\'{o}f and Chandrasekaran, Karthekeyan and Kir\'{a}ly, Tam\'{a}s and Kulkarni, Shubhang},
title = {{Hypergraph Connectivity Augmentation in Strongly Polynomial Time}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {22:1--22:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.22},
URN = {urn:nbn:de:0030-drops-210938},
doi = {10.4230/LIPIcs.ESA.2024.22},
annote = {Keywords: Hypergraphs, Hypergraph Connectivity, Submodular Functions, Combinatorial Optimization}
}
@InProceedings{bhattacharya_et_al:LIPIcs.ESA.2024.23,
author = {Bhattacharya, Sayan and Costa, Mart{\'\i}n and Panski, Nadav and Solomon, Shay},
title = {{Density-Sensitive Algorithms for (\Delta + 1)-Edge Coloring}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.23},
URN = {urn:nbn:de:0030-drops-210945},
doi = {10.4230/LIPIcs.ESA.2024.23},
annote = {Keywords: Graph Algorithms, Edge Coloring, Arboricity}
}
@InProceedings{biedl_et_al:LIPIcs.ESA.2024.24,
author = {Biedl, Therese and Bose, Prosenjit and Murali, Karthik},
title = {{A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.24},
URN = {urn:nbn:de:0030-drops-210950},
doi = {10.4230/LIPIcs.ESA.2024.24},
annote = {Keywords: Vertex Connectivity, Edge Connectivity, 1-planar, k-planar, Linear-time}
}
@InProceedings{bilo_et_al:LIPIcs.ESA.2024.25,
author = {Bil\`{o}, Davide and Gual\`{a}, Luciano and Leucci, Stefano and Straziota, Alessandro},
title = {{Graph Spanners for Group Steiner Distances}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.25},
URN = {urn:nbn:de:0030-drops-210968},
doi = {10.4230/LIPIcs.ESA.2024.25},
annote = {Keywords: Network sparsification, Graph spanners, Group Steiner tree, Distance oracles}
}
@InProceedings{bilo_et_al:LIPIcs.ESA.2024.26,
author = {Bil\`{o}, Vittorio and Markakis, Evangelos and Vinci, Cosimo},
title = {{Achieving Envy-Freeness Through Items Sale}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.26},
URN = {urn:nbn:de:0030-drops-210977},
doi = {10.4230/LIPIcs.ESA.2024.26},
annote = {Keywords: Fair Item Allocation, Approximation Algorithms, Envy-freeness, Markets}
}
@InProceedings{biniaz:LIPIcs.ESA.2024.27,
author = {Biniaz, Ahmad},
title = {{Art Galleries and Mobile Guards: Revisiting O'Rourke’s Proof}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {27:1--27:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.27},
URN = {urn:nbn:de:0030-drops-210989},
doi = {10.4230/LIPIcs.ESA.2024.27},
annote = {Keywords: Polygon guarding, Edge guarding, Short proof, Simple algorithm}
}
@InProceedings{blank_et_al:LIPIcs.ESA.2024.28,
author = {Blank, Lotte and Driemel, Anne},
title = {{A Faster Algorithm for the Fr\'{e}chet Distance in 1D for the Imbalanced Case}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.28},
URN = {urn:nbn:de:0030-drops-210999},
doi = {10.4230/LIPIcs.ESA.2024.28},
annote = {Keywords: \{Fr\'{e}chet distance\}, distance oracle, data structures, time series}
}
@InProceedings{boissonnat_et_al:LIPIcs.ESA.2024.29,
author = {Boissonnat, Jean-Daniel and Dutta, Kunal},
title = {{A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {29:1--29:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.29},
URN = {urn:nbn:de:0030-drops-211009},
doi = {10.4230/LIPIcs.ESA.2024.29},
annote = {Keywords: Persistent homology, Gaussian kernels, Random Fourier Features, Euclidean embedding}
}
@InProceedings{bokler_et_al:LIPIcs.ESA.2024.30,
author = {B\"{o}kler, Fritz and Chimani, Markus and Jasper, Henning and Wagner, Mirko H.},
title = {{Exact Minimum Weight Spanners via Column Generation}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {30:1--30:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.30},
URN = {urn:nbn:de:0030-drops-211012},
doi = {10.4230/LIPIcs.ESA.2024.30},
annote = {Keywords: Graph spanners, ILP, algorithm engineering, experimental study}
}
@InProceedings{boneh_et_al:LIPIcs.ESA.2024.31,
author = {Boneh, Itai and Golan, Shay and Shur, Arseny},
title = {{String 2-Covers with No Length Restrictions}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {31:1--31:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.31},
URN = {urn:nbn:de:0030-drops-211029},
doi = {10.4230/LIPIcs.ESA.2024.31},
annote = {Keywords: Quasi-periodicity, String cover, Range query, Range stabbing}
}
@InProceedings{brand_et_al:LIPIcs.ESA.2024.32,
author = {Brand, Cornelius and Kouteck\'{y}, Martin and Lassota, Alexandra and Ordyniak, Sebastian},
title = {{Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.32},
URN = {urn:nbn:de:0030-drops-211033},
doi = {10.4230/LIPIcs.ESA.2024.32},
annote = {Keywords: Mixed-Integer Programming, Separable Convex Optimization, Parameterized Algorithms, Parameterized Complexity}
}
@InProceedings{bringmann_et_al:LIPIcs.ESA.2024.33,
author = {Bringmann, Karl and D\"{u}rr, Anita and Polak, Adam},
title = {{Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {33:1--33:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.33},
URN = {urn:nbn:de:0030-drops-211047},
doi = {10.4230/LIPIcs.ESA.2024.33},
annote = {Keywords: 0-1-Knapsack problem, bounded monotone min-plus convolution, fine-grained complexity}
}
@InProceedings{bringmann_et_al:LIPIcs.ESA.2024.34,
author = {Bringmann, Karl and Ghazy, Ahmed and K\"{u}nnemann, Marvin},
title = {{Exploring the Approximability Landscape of 3SUM}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.34},
URN = {urn:nbn:de:0030-drops-211057},
doi = {10.4230/LIPIcs.ESA.2024.34},
annote = {Keywords: Fine-grained Complexity, Conditional Lower Bounds, Approximation Schemes, Min-Plus Convolution}
}
@InProceedings{brodal_et_al:LIPIcs.ESA.2024.35,
author = {Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Rysgaard, Casper Moldrup},
title = {{On Finding Longest Palindromic Subsequences Using Longest Common Subsequences}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {35:1--35:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.35},
URN = {urn:nbn:de:0030-drops-211068},
doi = {10.4230/LIPIcs.ESA.2024.35},
annote = {Keywords: Palindromic subsequence, longest common subsequence, dynamic programming}
}
@InProceedings{buchin_et_al:LIPIcs.ESA.2024.36,
author = {Buchin, Kevin and Buchin, Maike and Gudmundsson, Joachim and Wong, Sampson},
title = {{Bicriteria Approximation for Minimum Dilation Graph Augmentation}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {36:1--36:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.36},
URN = {urn:nbn:de:0030-drops-211079},
doi = {10.4230/LIPIcs.ESA.2024.36},
annote = {Keywords: Greedy spanner, Graph augmentation}
}
@InProceedings{calinescu_et_al:LIPIcs.ESA.2024.37,
author = {C\u{a}linescu, Gruia and Davies, Sami and Khuller, Samir and Zhang, Shirley},
title = {{Online Flexible Busy Time Scheduling on Heterogeneous Machines}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {37:1--37:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.37},
URN = {urn:nbn:de:0030-drops-211083},
doi = {10.4230/LIPIcs.ESA.2024.37},
annote = {Keywords: Online algorithms, Scheduling, Competitive analysis}
}
@InProceedings{calinescu_et_al:LIPIcs.ESA.2024.38,
author = {C\u{a}linescu, Gruia and Uniyal, Sumedha},
title = {{Local Optimization Algorithms for Maximum Planar Subgraph}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {38:1--38:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.38},
URN = {urn:nbn:de:0030-drops-211090},
doi = {10.4230/LIPIcs.ESA.2024.38},
annote = {Keywords: planar graph, maximum subgraph, approximation algorithm, matroid parity, local optimization}
}
@InProceedings{canesmer_et_al:LIPIcs.ESA.2024.39,
author = {Can Esmer, Bar{\i}\c{s} and Focke, Jacob and Marx, D\'{a}niel and Rz\k{a}\.{z}ewski, Pawe{\l}},
title = {{List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {39:1--39:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.39},
URN = {urn:nbn:de:0030-drops-211103},
doi = {10.4230/LIPIcs.ESA.2024.39},
annote = {Keywords: Graph Homomorphism, List Homomorphism, Vertex Deletion, Edge Deletion, Multiway Cut, Parameterized Complexity, Tight Bounds, Treewidth, SETH}
}
@InProceedings{chakrabarti_et_al:LIPIcs.ESA.2024.40,
author = {Chakrabarti, Amit and McGregor, Andrew and Wirth, Anthony},
title = {{Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {40:1--40:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.40},
URN = {urn:nbn:de:0030-drops-211114},
doi = {10.4230/LIPIcs.ESA.2024.40},
annote = {Keywords: Data Stream Computation, Maximum Coverage, Submodular Maximization}
}
@InProceedings{chekuri_et_al:LIPIcs.ESA.2024.41,
author = {Chekuri, Chandra and Jain, Rhea},
title = {{Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {41:1--41:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.41},
URN = {urn:nbn:de:0030-drops-211124},
doi = {10.4230/LIPIcs.ESA.2024.41},
annote = {Keywords: Buy-at-bulk, Hop-constrained network design, LP integrality gap, Fault-tolerant network design}
}
@InProceedings{chekuri_et_al:LIPIcs.ESA.2024.42,
author = {Chekuri, Chandra and Jain, Rhea and Kulkarni, Shubhang and Zheng, Da Wei and Zhu, Weihao},
title = {{From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {42:1--42:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.42},
URN = {urn:nbn:de:0030-drops-211134},
doi = {10.4230/LIPIcs.ESA.2024.42},
annote = {Keywords: Directed Planar Graphs, Submodular Functions, Steiner Tree, Network Design}
}
@InProceedings{cslovjecsek_et_al:LIPIcs.ESA.2024.43,
author = {Cslovjecsek, Jana and Pilipczuk, Micha{\l} and W\k{e}grzycki, Karol},
title = {{Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {43:1--43:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.43},
URN = {urn:nbn:de:0030-drops-211146},
doi = {10.4230/LIPIcs.ESA.2024.43},
annote = {Keywords: parameterized approximation, Maximum Weight Independent Set, rectangles, segments}
}
@InProceedings{dallant_et_al:LIPIcs.ESA.2024.44,
author = {Dallant, Justin and Haagensen, Frederik and Jacob, Riko and Kozma, L\'{a}szl\'{o} and Wild, Sebastian},
title = {{An Optimal Randomized Algorithm for Finding the Saddlepoint}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {44:1--44:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.44},
URN = {urn:nbn:de:0030-drops-211154},
doi = {10.4230/LIPIcs.ESA.2024.44},
annote = {Keywords: saddlepoint, matrix, comparison, search, randomized algorithms}
}
@InProceedings{dey_et_al:LIPIcs.ESA.2024.45,
author = {Dey, Dipan and Gupta, Manoj},
title = {{Near Optimal Dual Fault Tolerant Distance Oracle}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {45:1--45:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.45},
URN = {urn:nbn:de:0030-drops-211164},
doi = {10.4230/LIPIcs.ESA.2024.45},
annote = {Keywords: Distance Sensitive Oracle, Dual Fault Distance Oracle}
}
@InProceedings{ding_et_al:LIPIcs.ESA.2024.46,
author = {Ding, Matthew and Li, Jason},
title = {{Deterministic Minimum Steiner Cut in Maximum Flow Time}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.46},
URN = {urn:nbn:de:0030-drops-211174},
doi = {10.4230/LIPIcs.ESA.2024.46},
annote = {Keywords: graph algorithms, minimum cut, deterministic}
}
@InProceedings{disser_et_al:LIPIcs.ESA.2024.47,
author = {Disser, Yann and Griesbach, Svenja M. and Klimm, Max and Lutz, Annette},
title = {{Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {47:1--47:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.47},
URN = {urn:nbn:de:0030-drops-211188},
doi = {10.4230/LIPIcs.ESA.2024.47},
annote = {Keywords: incremental optimization, competitive analysis, prize-collecting Steiner-tree}
}
@InProceedings{dogeas_et_al:LIPIcs.ESA.2024.48,
author = {Dogeas, Konstantinos and Erlebach, Thomas and Liang, Ya-Chun},
title = {{Scheduling with Obligatory Tests}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {48:1--48:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.48},
URN = {urn:nbn:de:0030-drops-211194},
doi = {10.4230/LIPIcs.ESA.2024.48},
annote = {Keywords: Competitive ratio, Online algorithm, Scheduling with testing, Sum of completion times}
}
@InProceedings{dong_et_al:LIPIcs.ESA.2024.49,
author = {Dong, Sally and Ye, Guanghao},
title = {{Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.49},
URN = {urn:nbn:de:0030-drops-211207},
doi = {10.4230/LIPIcs.ESA.2024.49},
annote = {Keywords: Min-cost flow, tree decomposition, interior point method, bounded treewidth graphs}
}
@InProceedings{dubois:LIPIcs.ESA.2024.50,
author = {Dubois, Lo\"{i}c},
title = {{Making Multicurves Cross Minimally on Surfaces}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {50:1--50:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.50},
URN = {urn:nbn:de:0030-drops-211216},
doi = {10.4230/LIPIcs.ESA.2024.50},
annote = {Keywords: Algorithms, Topology, Surfaces, Closed Curves, Geometric Intersection Number}
}
@InProceedings{duraj_et_al:LIPIcs.ESA.2024.51,
author = {Duraj, Lech and Konieczny, Filip and Pot\k{e}pa, Krzysztof},
title = {{Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {51:1--51:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.51},
URN = {urn:nbn:de:0030-drops-211229},
doi = {10.4230/LIPIcs.ESA.2024.51},
annote = {Keywords: Graph Diameter, Geometric Intersection Graphs, Vapnik-Chervonenkis Dimension}
}
@InProceedings{feder_et_al:LIPIcs.ESA.2024.52,
author = {Feder, Evgeniy and Paramonov, Anton and Mavrin, Pavel and Salem, Iosif and Aksenov, Vitaly and Schmid, Stefan},
title = {{Toward Self-Adjusting k-Ary Search Tree Networks}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.52},
URN = {urn:nbn:de:0030-drops-211235},
doi = {10.4230/LIPIcs.ESA.2024.52},
annote = {Keywords: self-adjusting networks, networks, splay-tree, k-ary tree}
}
@InProceedings{ferdous_et_al:LIPIcs.ESA.2024.53,
author = {Ferdous, S M and Samineni, Bhargav and Pothen, Alex and Halappanavar, Mahantesh and Krishnamoorthy, Bala},
title = {{Semi-Streaming Algorithms for Weighted k-Disjoint Matchings}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {53:1--53:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.53},
URN = {urn:nbn:de:0030-drops-211245},
doi = {10.4230/LIPIcs.ESA.2024.53},
annote = {Keywords: Matchings, Semi-Streaming Algorithms, Approximation Algorithms}
}
@InProceedings{fleischhacker_et_al:LIPIcs.ESA.2024.54,
author = {Fleischhacker, Nils and Larsen, Kasper Green and Obremski, Maciej and Simkin, Mark},
title = {{Invertible Bloom Lookup Tables with Less Memory and Randomness}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {54:1--54:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.54},
URN = {urn:nbn:de:0030-drops-211252},
doi = {10.4230/LIPIcs.ESA.2024.54},
annote = {Keywords: Invertible Bloom Lookup Tables}
}
@InProceedings{focke_et_al:LIPIcs.ESA.2024.55,
author = {Focke, Jacob and Frei, Fabian and Li, Shaohua and Marx, D\'{a}niel and Schepper, Philipp and Sharma, Roohani and W\k{e}grzycki, Karol},
title = {{Hitting Meets Packing: How Hard Can It Be?}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {55:1--55:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.55},
URN = {urn:nbn:de:0030-drops-211261},
doi = {10.4230/LIPIcs.ESA.2024.55},
annote = {Keywords: Hitting, Packing, Covering, Parameterized Algorithms, Lower Bounds, Treewidth}
}
@InProceedings{fox:LIPIcs.ESA.2024.56,
author = {Fox, Emily},
title = {{A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge Costs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {56:1--56:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.56},
URN = {urn:nbn:de:0030-drops-211270},
doi = {10.4230/LIPIcs.ESA.2024.56},
annote = {Keywords: Transshipment, minimum cost flow, approximation algorithms}
}
@InProceedings{fried_et_al:LIPIcs.ESA.2024.57,
author = {Fried, Dvir and Kopelowitz, Tsvi and Porat, Ely},
title = {{Removing the log Factor from (min,+)-Products on Bounded Range Integer Matrices}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {57:1--57:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.57},
URN = {urn:nbn:de:0030-drops-211283},
doi = {10.4230/LIPIcs.ESA.2024.57},
annote = {Keywords: FMM, (min , +)-product, FFT}
}
@InProceedings{garg_et_al:LIPIcs.ESA.2024.58,
author = {Garg, Mohit and Kar, Debajyoti and Khan, Arindam},
title = {{Random-Order Online Independent Set of Intervals and Hyperrectangles}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {58:1--58:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.58},
URN = {urn:nbn:de:0030-drops-211298},
doi = {10.4230/LIPIcs.ESA.2024.58},
annote = {Keywords: Online Algorithms, Random-Order Model, Maximum Independent Set of Rectangles, Hyperrectangles, Fat Objects, Interval Scheduling}
}
@InProceedings{gawrychowski_et_al:LIPIcs.ESA.2024.59,
author = {Gawrychowski, Pawe{\l} and Wasylkiewicz, Mateusz},
title = {{Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {59:1--59:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.59},
URN = {urn:nbn:de:0030-drops-211301},
doi = {10.4230/LIPIcs.ESA.2024.59},
annote = {Keywords: perfect matching, cubic graphs, bridgeless graphs, link-cut tree}
}
@InProceedings{ghosh_et_al:LIPIcs.ESA.2024.60,
author = {Ghosh, Prantar and Kuchlous, Sahil},
title = {{New Algorithms and Lower Bounds for Streaming Tournaments}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {60:1--60:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.60},
URN = {urn:nbn:de:0030-drops-211318},
doi = {10.4230/LIPIcs.ESA.2024.60},
annote = {Keywords: tournaments, streaming algorithms, graph algorithms, communication complexity, strongly connected components, reachability, feedback arc set}
}
@InProceedings{gottesburen_et_al:LIPIcs.ESA.2024.61,
author = {Gottesb\"{u}ren, Lars and Parotsidis, Nikos and Gutenberg, Maximilian Probst},
title = {{Practical Expander Decomposition}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {61:1--61:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.61},
URN = {urn:nbn:de:0030-drops-211323},
doi = {10.4230/LIPIcs.ESA.2024.61},
annote = {Keywords: Expander Decomposition, Clustering, Graph Algorithms}
}
@InProceedings{griesbach_et_al:LIPIcs.ESA.2024.62,
author = {Griesbach, Svenja M. and Klimm, Max and Warode, Philipp and Ziemke, Theresa},
title = {{Optimizing Throughput and Makespan of Queuing Systems by Information Design}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {62:1--62:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.62},
URN = {urn:nbn:de:0030-drops-211336},
doi = {10.4230/LIPIcs.ESA.2024.62},
annote = {Keywords: Information Design, Dynamic Flows, Public Signals, Convex Envelope}
}
@InProceedings{gurjar_et_al:LIPIcs.ESA.2024.63,
author = {Gurjar, Rohit and Oki, Taihei and Raj, Roshan},
title = {{Fractional Linear Matroid Matching Is in Quasi-NC}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {63:1--63:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.63},
URN = {urn:nbn:de:0030-drops-211344},
doi = {10.4230/LIPIcs.ESA.2024.63},
annote = {Keywords: parallel algorithms, hitting set, non-commutative rank, Brascamp-Lieb polytope, algebraic algorithms}
}
@InProceedings{hamada_et_al:LIPIcs.ESA.2024.64,
author = {Hamada, Kou and Chakraborty, Sankardeep and Jo, Seungbum and Koriyama, Takuto and Sadakane, Kunihiko and Satti, Srinivasa Rao},
title = {{A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {64:1--64:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.64},
URN = {urn:nbn:de:0030-drops-211359},
doi = {10.4230/LIPIcs.ESA.2024.64},
annote = {Keywords: Hypersuccinct trees, Succinct data structures, Range minimum queries, Binary trees}
}
@InProceedings{harada_et_al:LIPIcs.ESA.2024.65,
author = {Harada, Kaito and Kitamura, Naoki and Izumi, Taisuke and Masuzawa, Toshimitsu},
title = {{A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {65:1--65:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.65},
URN = {urn:nbn:de:0030-drops-211367},
doi = {10.4230/LIPIcs.ESA.2024.65},
annote = {Keywords: data structure, distance sensitivity oracle, replacement path problem, graph algorithm}
}
@InProceedings{harb_et_al:LIPIcs.ESA.2024.66,
author = {Harb, Elfarouk and Huang, Zhengcheng and Zheng, Da Wei},
title = {{Shortest Path Separators in Unit Disk Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {66:1--66:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.66},
URN = {urn:nbn:de:0030-drops-211375},
doi = {10.4230/LIPIcs.ESA.2024.66},
annote = {Keywords: Balanced shortest path separators, unit disk graphs, crossings}
}
@InProceedings{hathcock_et_al:LIPIcs.ESA.2024.67,
author = {Hathcock, Daniel and Zlatin, Michael},
title = {{Approximation Algorithms for Steiner Connectivity Augmentation}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {67:1--67:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.67},
URN = {urn:nbn:de:0030-drops-211387},
doi = {10.4230/LIPIcs.ESA.2024.67},
annote = {Keywords: Approximation Algorithms, Steiner Connectivity, Network Design}
}
@InProceedings{heeger_et_al:LIPIcs.ESA.2024.68,
author = {Heeger, Klaus and Hermelin, Danny},
title = {{Minimizing the Weighted Number of Tardy Jobs Is W\lbrack1\rbrack-Hard}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {68:1--68:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.68},
URN = {urn:nbn:de:0030-drops-211392},
doi = {10.4230/LIPIcs.ESA.2024.68},
annote = {Keywords: single-machine scheduling, number of different weights, number of different processing times}
}
@InProceedings{hermann_et_al:LIPIcs.ESA.2024.69,
author = {Hermann, Stefan and Lehmann, Hans-Peter and Pibiri, Giulio Ermanno and Sanders, Peter and Walzer, Stefan},
title = {{PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {69:1--69:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.69},
URN = {urn:nbn:de:0030-drops-211405},
doi = {10.4230/LIPIcs.ESA.2024.69},
annote = {Keywords: Compressed Data Structures, Minimal Perfect Hashing, GPU}
}
@InProceedings{vanderhoog_et_al:LIPIcs.ESA.2024.70,
author = {van der Hoog, Ivor and Parada, Irene and Rotenberg, Eva},
title = {{Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {70:1--70:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.70},
URN = {urn:nbn:de:0030-drops-211410},
doi = {10.4230/LIPIcs.ESA.2024.70},
annote = {Keywords: dynamic graphs, data structures, computational geometry, graph drawing, graph algorithms, upward planarity}
}
@InProceedings{hourani_et_al:LIPIcs.ESA.2024.71,
author = {Hourani, Khalid and Moses Jr., William K. and Pandurangan, Gopal},
title = {{Towards Communication-Efficient Peer-To-Peer Networks}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {71:1--71:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.71},
URN = {urn:nbn:de:0030-drops-211428},
doi = {10.4230/LIPIcs.ESA.2024.71},
annote = {Keywords: Peer-to-Peer Networks, Overlay Construction Protocol, Expanders, Broadcast, Geometric Routing}
}
@InProceedings{hu_et_al:LIPIcs.ESA.2024.72,
author = {Hu, Bingbing and Kosinas, Evangelos and Polak, Adam},
title = {{Connectivity Oracles for Predictable Vertex Failures}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {72:1--72:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.72},
URN = {urn:nbn:de:0030-drops-211437},
doi = {10.4230/LIPIcs.ESA.2024.72},
annote = {Keywords: Data structures, graph connectivity, algorithms with predictions}
}
@InProceedings{huang_et_al:LIPIcs.ESA.2024.73,
author = {Huang, Zhiyi and Parsaeian, Zahra and Zhu, Zixuan},
title = {{Laminar Matroid Secretary: Greedy Strikes Back}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {73:1--73:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.73},
URN = {urn:nbn:de:0030-drops-211443},
doi = {10.4230/LIPIcs.ESA.2024.73},
annote = {Keywords: Matroid Secretary, Greedy Algorithm, Laminar Matroid}
}
@InProceedings{hyattdenesik_et_al:LIPIcs.ESA.2024.74,
author = {Hyatt-Denesik, Dylan and Jabal-Ameli, Afrouz and Sanit\`{a}, Laura},
title = {{Improved Approximations for Flexible Network Design}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {74:1--74:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.74},
URN = {urn:nbn:de:0030-drops-211456},
doi = {10.4230/LIPIcs.ESA.2024.74},
annote = {Keywords: Approximation Algorithms, Network Design, Flexible Connectivity}
}
@InProceedings{iwamasa_et_al:LIPIcs.ESA.2024.75,
author = {Iwamasa, Yuni and Kobayashi, Yusuke and Takazawa, Kenjiro},
title = {{Finding a Maximum Restricted t-Matching via Boolean Edge-CSP}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {75:1--75:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.75},
URN = {urn:nbn:de:0030-drops-211463},
doi = {10.4230/LIPIcs.ESA.2024.75},
annote = {Keywords: Polynomial algorithm, C\underlinek-free 2-matching, Jump system, Boolean edge-CSP}
}
@InProceedings{jansen_et_al:LIPIcs.ESA.2024.76,
author = {Jansen, Bart M.P. and Swennenhuis, C\'{e}line M.F.},
title = {{Steiner Tree Parameterized by Multiway Cut and Even Less}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {76:1--76:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.76},
URN = {urn:nbn:de:0030-drops-211471},
doi = {10.4230/LIPIcs.ESA.2024.76},
annote = {Keywords: fixed-parameter tractability, Steiner Tree, structural parameterization, H-treewidth}
}
@InProceedings{katz_et_al:LIPIcs.ESA.2024.77,
author = {Katz, Matthew J. and Saban, Rachel and Sharir, Micha},
title = {{Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {77:1--77:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.77},
URN = {urn:nbn:de:0030-drops-211482},
doi = {10.4230/LIPIcs.ESA.2024.77},
annote = {Keywords: 1.5-dimensional terrain, visibility, visibility graph, reverse shortest path, parametric search, shrink-and-bifurcate, range searching}
}
@InProceedings{kim_et_al:LIPIcs.ESA.2024.78,
author = {Kim, Justin and Varki, Rahul and Oliva, Marco and Boucher, Christina},
title = {{Re²Pair: Increasing the Scalability of RePair by Decreasing Memory Usage}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {78:1--78:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.78},
URN = {urn:nbn:de:0030-drops-211496},
doi = {10.4230/LIPIcs.ESA.2024.78},
annote = {Keywords: RePair, Compressed Data Structures, Prefix-free Parsing}
}
@InProceedings{kogan_et_al:LIPIcs.ESA.2024.79,
author = {Kogan, Shimon and Parter, Merav},
title = {{Giving Some Slack: Shortcuts and Transitive Closure Compressions}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {79:1--79:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.79},
URN = {urn:nbn:de:0030-drops-211509},
doi = {10.4230/LIPIcs.ESA.2024.79},
annote = {Keywords: Reachability Shortcuts, Width, DAG}
}
@InProceedings{kogan_et_al:LIPIcs.ESA.2024.80,
author = {Kogan, Shimon and Parter, Merav},
title = {{The Algorithmic Power of the Greene-Kleitman Theorem}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {80:1--80:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.80},
URN = {urn:nbn:de:0030-drops-211512},
doi = {10.4230/LIPIcs.ESA.2024.80},
annote = {Keywords: Chains, Antichains, DAG}
}
@InProceedings{kowalik:LIPIcs.ESA.2024.81,
author = {Kowalik, {\L}ukasz},
title = {{Edge-Coloring Sparse Graphs with \Delta Colors in Quasilinear Time}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {81:1--81:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.81},
URN = {urn:nbn:de:0030-drops-211523},
doi = {10.4230/LIPIcs.ESA.2024.81},
annote = {Keywords: edge coloring, algorithm, sparse, graph, quasilinear}
}
@InProceedings{kraiczy_et_al:LIPIcs.ESA.2024.82,
author = {Kraiczy, Sonja and Elkind, Edith},
title = {{A Lower Bound for Local Search Proportional Approval Voting}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {82:1--82:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.82},
URN = {urn:nbn:de:0030-drops-211538},
doi = {10.4230/LIPIcs.ESA.2024.82},
annote = {Keywords: Computational Social Choice, Committee Elections, Local Search, Fairness}
}
@InProceedings{kurpicz_et_al:LIPIcs.ESA.2024.83,
author = {Kurpicz, Florian and Mehnert, Pascal and Sanders, Peter and Schimek, Matthias},
title = {{Scalable Distributed String Sorting}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {83:1--83:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.83},
URN = {urn:nbn:de:0030-drops-211541},
doi = {10.4230/LIPIcs.ESA.2024.83},
annote = {Keywords: sorting, strings, distributed-memory computing, distributed membership filters, scalability}
}
@InProceedings{leonhardt_et_al:LIPIcs.ESA.2024.84,
author = {Leonhardt, Alexander and Meyer, Ulrich and Penschuck, Manuel},
title = {{Insights into (k, \rho)-Shortcutting Algorithms}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {84:1--84:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.84},
URN = {urn:nbn:de:0030-drops-211554},
doi = {10.4230/LIPIcs.ESA.2024.84},
annote = {Keywords: Complexity, Approximation, Optimal algorithms, Parallel shortest path}
}
@InProceedings{lima_et_al:LIPIcs.ESA.2024.85,
author = {Lima, Paloma T. and Milani\v{c}, Martin and Mur\v{s}i\v{c}, Peter and Okrasa, Karolina and Rz\k{a}\.{z}ewski, Pawe{\l} and \v{S}torgel, Kenny},
title = {{Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {85:1--85:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.85},
URN = {urn:nbn:de:0030-drops-211569},
doi = {10.4230/LIPIcs.ESA.2024.85},
annote = {Keywords: induced matching treewidth, tree-independence number, feedback vertex set, induced packing, algorithmic meta-theorem}
}
@InProceedings{liptak_et_al:LIPIcs.ESA.2024.86,
author = {Lipt\'{a}k, Zsuzsanna and Masillo, Francesco and Navarro, Gonzalo},
title = {{A Textbook Solution for Dynamic Strings}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {86:1--86:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.86},
URN = {urn:nbn:de:0030-drops-211576},
doi = {10.4230/LIPIcs.ESA.2024.86},
annote = {Keywords: dynamic strings, splay trees, dynamic data structures, LCP, circular strings}
}
@InProceedings{majewski_et_al:LIPIcs.ESA.2024.87,
author = {Majewski, Konrad and Pilipczuk, Micha{\l} and Zych-Pawlewicz, Anna},
title = {{Parameterized Dynamic Data Structure for Split Completion}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {87:1--87:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.87},
URN = {urn:nbn:de:0030-drops-211587},
doi = {10.4230/LIPIcs.ESA.2024.87},
annote = {Keywords: parameterized complexity, dynamic data structures, split graphs}
}
@InProceedings{mccauley:LIPIcs.ESA.2024.88,
author = {McCauley, Samuel},
title = {{Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {88:1--88:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.88},
URN = {urn:nbn:de:0030-drops-211590},
doi = {10.4230/LIPIcs.ESA.2024.88},
annote = {Keywords: similarity search, locality-sensitive hashing, randomized algorithms, data structures, space efficiency, function inversion}
}
@InProceedings{mitrovic_et_al:LIPIcs.ESA.2024.89,
author = {Mitrovi\'{c}, Slobodan and Rubinfeld, Ronitt and Singhal, Mihir},
title = {{Locally Computing Edge Orientations}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {89:1--89:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.89},
URN = {urn:nbn:de:0030-drops-211603},
doi = {10.4230/LIPIcs.ESA.2024.89},
annote = {Keywords: local computation algorithms, edge orientation, tree coloring}
}
@InProceedings{naumann_et_al:LIPIcs.ESA.2024.90,
author = {Naumann, Alexander and Bonerath, Annika and Haunert, Jan-Henrik},
title = {{Many-To-Many Polygon Matching \`{a} La Jaccard}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {90:1--90:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.90},
URN = {urn:nbn:de:0030-drops-211614},
doi = {10.4230/LIPIcs.ESA.2024.90},
annote = {Keywords: polygon matching, exact algorithm, Jaccard index}
}
@InProceedings{nie_et_al:LIPIcs.ESA.2024.91,
author = {Nie, Zipei and Zhou, Hang},
title = {{Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation Algorithm}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {91:1--91:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.91},
URN = {urn:nbn:de:0030-drops-211627},
doi = {10.4230/LIPIcs.ESA.2024.91},
annote = {Keywords: capacitated vehicle routing, approximation algorithm, combinatorial optimization}
}
@InProceedings{nutov:LIPIcs.ESA.2024.92,
author = {Nutov, Zeev},
title = {{Parameterized Algorithms for Node Connectivity Augmentation Problems}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {92:1--92:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.92},
URN = {urn:nbn:de:0030-drops-211639},
doi = {10.4230/LIPIcs.ESA.2024.92},
annote = {Keywords: node connectivity augmentation, fixed-parameter tractability}
}
@InProceedings{osipov_et_al:LIPIcs.ESA.2024.93,
author = {Osipov, George and Pilipczuk, Marcin and Wahlstr\"{o}m, Magnus},
title = {{Parameterized Complexity of MinCSP over the Point Algebra}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {93:1--93:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.93},
URN = {urn:nbn:de:0030-drops-211640},
doi = {10.4230/LIPIcs.ESA.2024.93},
annote = {Keywords: parameterized complexity, constraint satisfaction, point algebra, multicut, feedback arc set}
}
@InProceedings{pereira_et_al:LIPIcs.ESA.2024.94,
author = {Pereira, Felipe de Carvalho and de Rezende, Pedro Jussieu and Yunes, Tallys and Morato, Luiz Fernando Batista},
title = {{A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {94:1--94:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.94},
URN = {urn:nbn:de:0030-drops-211651},
doi = {10.4230/LIPIcs.ESA.2024.94},
annote = {Keywords: Graph Burning, Burning Number, Burning Sequence, Set Covering, Integer Programming, Row Generation}
}
@InProceedings{rajaraman_et_al:LIPIcs.ESA.2024.95,
author = {Rajaraman, Rajmohan and Wasim, Omer},
title = {{Competitive Capacitated Online Recoloring}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {95:1--95:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.95},
URN = {urn:nbn:de:0030-drops-211666},
doi = {10.4230/LIPIcs.ESA.2024.95},
annote = {Keywords: online algorithms, competitive ratio, recoloring, resource augmentation}
}
@InProceedings{randolph_et_al:LIPIcs.ESA.2024.96,
author = {Randolph, Tim and W\k{e}grzycki, Karol},
title = {{Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {96:1--96:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.96},
URN = {urn:nbn:de:0030-drops-211672},
doi = {10.4230/LIPIcs.ESA.2024.96},
annote = {Keywords: Parameterized algorithms, parameterized complexity, additive combinatorics, Subset Sum, integer programming, doubling constant}
}
@InProceedings{reinstadtler_et_al:LIPIcs.ESA.2024.97,
author = {Reinst\"{a}dtler, Henrik and Schulz, Christian and U\c{c}ar, Bora},
title = {{Engineering Edge Orientation Algorithms}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {97:1--97:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.97},
URN = {urn:nbn:de:0030-drops-211682},
doi = {10.4230/LIPIcs.ESA.2024.97},
annote = {Keywords: edge orientation, pseudoarboricity, graph algorithms}
}
@InProceedings{schwartzman:LIPIcs.ESA.2024.98,
author = {Schwartzman, Gregory},
title = {{Local Max-Cut on Sparse Graphs}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {98:1--98:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.98},
URN = {urn:nbn:de:0030-drops-211694},
doi = {10.4230/LIPIcs.ESA.2024.98},
annote = {Keywords: Algorithms, smoothed analysis}
}
@InProceedings{terao_et_al:LIPIcs.ESA.2024.99,
author = {Terao, Tatsuya and Mori, Ryuhei},
title = {{Parameterized Quantum Query Algorithms for Graph Problems}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {99:1--99:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.99},
URN = {urn:nbn:de:0030-drops-211707},
doi = {10.4230/LIPIcs.ESA.2024.99},
annote = {Keywords: Quantum query complexity, parameterized algorithms, vertex cover, matching, kernelization}
}
@InProceedings{latour_et_al:LIPIcs.ESA.2024.100,
author = {la Tour, Max Dupr\'{e} and Henzinger, Monika and Saulpic, David},
title = {{Fully Dynamic k-Means Coreset in Near-Optimal Update Time}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {100:1--100:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.100},
URN = {urn:nbn:de:0030-drops-211716},
doi = {10.4230/LIPIcs.ESA.2024.100},
annote = {Keywords: clustering, fully-dynamic, coreset, k-means}
}
@InProceedings{wang_et_al:LIPIcs.ESA.2024.101,
author = {Wang, Qisheng and Zhang, Zhicheng},
title = {{Time-Efficient Quantum Entropy Estimator via Samplizer}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {101:1--101:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.101},
URN = {urn:nbn:de:0030-drops-211722},
doi = {10.4230/LIPIcs.ESA.2024.101},
annote = {Keywords: Quantum computing, entropy estimation, von Neumann entropy, R\'{e}nyi entropy, sample complexity}
}
@InProceedings{woydt_et_al:LIPIcs.ESA.2024.102,
author = {Woydt, Henning Martin and Komusiewicz, Christian and Sommer, Frank},
title = {{SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {102:1--102:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.102},
URN = {urn:nbn:de:0030-drops-211730},
doi = {10.4230/LIPIcs.ESA.2024.102},
annote = {Keywords: Branch-and-Cut, Lazy Evaluations, Facility Location, Group Closeness Centrality, Partial Dominating Set}
}
@InProceedings{wu_et_al:LIPIcs.ESA.2024.103,
author = {Wu, Pu and Gu, Huanyu and Jiang, Huiqin and Shao, Zehui and Xu, Jin},
title = {{A Faster Algorithm for the 4-Coloring Problem}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {103:1--103:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.103},
URN = {urn:nbn:de:0030-drops-211749},
doi = {10.4230/LIPIcs.ESA.2024.103},
annote = {Keywords: Graph coloring, Graph algorithms, Exact algorithms}
}
@InProceedings{xiao:LIPIcs.ESA.2024.104,
author = {Xiao, Mingyu},
title = {{Solving Directed Multiway Cut Faster Than 2ⁿ}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {104:1--104:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.104},
URN = {urn:nbn:de:0030-drops-211758},
doi = {10.4230/LIPIcs.ESA.2024.104},
annote = {Keywords: Exact Algorithms, Parameterized Algorithms, Directed Multiway Cut, Directed Multicut, Directed Graphs}
}
@InProceedings{yoshinaga_et_al:LIPIcs.ESA.2024.105,
author = {Yoshinaga, Toru and Kawase, Yasushi},
title = {{The Last Success Problem with Samples}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {105:1--105:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John 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.2024.105},
URN = {urn:nbn:de:0030-drops-211762},
doi = {10.4230/LIPIcs.ESA.2024.105},
annote = {Keywords: The Last Success Problem, Secretary Problem, Sample Information Model, Optimal Stopping, Online 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