@Proceedings{bringmann_et_al:LIPIcs.ICALP.2024,
title = {{LIPIcs, Volume 297, ICALP 2024, Complete Volume}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {1--2938},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024},
URN = {urn:nbn:de:0030-drops-201424},
doi = {10.4230/LIPIcs.ICALP.2024},
annote = {Keywords: LIPIcs, Volume 297, ICALP 2024, Complete Volume}
}
@InProceedings{bringmann_et_al:LIPIcs.ICALP.2024.0,
author = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {0:i--0:xl},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.0},
URN = {urn:nbn:de:0030-drops-201437},
doi = {10.4230/LIPIcs.ICALP.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{dawar:LIPIcs.ICALP.2024.1,
author = {Dawar, Anuj},
title = {{Limits of Symmetric Computation}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {1:1--1:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.1},
URN = {urn:nbn:de:0030-drops-201444},
doi = {10.4230/LIPIcs.ICALP.2024.1},
annote = {Keywords: Logic, Complexity Theory, Symmetric Computation}
}
@InProceedings{elkind:LIPIcs.ICALP.2024.2,
author = {Elkind, Edith},
title = {{Group Fairness: Multiwinner Voting and Beyond}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.2},
URN = {urn:nbn:de:0030-drops-201459},
doi = {10.4230/LIPIcs.ICALP.2024.2},
annote = {Keywords: multiwinner voting, participatory budgeting, justified representation}
}
@InProceedings{nanongkai:LIPIcs.ICALP.2024.3,
author = {Nanongkai, Danupon},
title = {{Cross-Paradigm Graph Algorithms}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.3},
URN = {urn:nbn:de:0030-drops-201467},
doi = {10.4230/LIPIcs.ICALP.2024.3},
annote = {Keywords: Graph Algorithms and Complexity, Efficient Algorithms, Models of Computation}
}
@InProceedings{parter:LIPIcs.ICALP.2024.4,
author = {Parter, Merav},
title = {{Graphs Shortcuts: New Bounds and Algorithms}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {4:1--4:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.4},
URN = {urn:nbn:de:0030-drops-201476},
doi = {10.4230/LIPIcs.ICALP.2024.4},
annote = {Keywords: Shortcuts, Spanners, Distance Preservers}
}
@InProceedings{abbasi_et_al:LIPIcs.ICALP.2024.5,
author = {Abbasi, Fateme and Adamczyk, Marek and Bosch-Calvo, Miguel and Byrka, Jaros{\l}aw and Grandoni, Fabrizio and Sornat, Krzysztof and Tinguely, Antoine},
title = {{An O(loglog n)-Approximation for Submodular Facility Location}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.5},
URN = {urn:nbn:de:0030-drops-201488},
doi = {10.4230/LIPIcs.ICALP.2024.5},
annote = {Keywords: approximation algorithms, facility location, submodular facility location, universal stochastic facility location}
}
@InProceedings{abbasi_et_al:LIPIcs.ICALP.2024.6,
author = {Abbasi, Fateme and Banerjee, Sandip and Byrka, Jaros{\l}aw and Chalermsook, Parinya and Gadekar, Ameet and Khodamoradi, Kamyar and Marx, D\'{a}niel and Sharma, Roohani and Spoerhase, Joachim},
title = {{Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.6},
URN = {urn:nbn:de:0030-drops-201494},
doi = {10.4230/LIPIcs.ICALP.2024.6},
annote = {Keywords: Clustering, approximation algorithms, parameterized complexity}
}
@InProceedings{abboud_et_al:LIPIcs.ICALP.2024.7,
author = {Abboud, Elie and Ron-Zewi, Noga},
title = {{Finer-Grained Reductions in Fine-Grained Hardness of Approximation}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.7},
URN = {urn:nbn:de:0030-drops-201507},
doi = {10.4230/LIPIcs.ICALP.2024.7},
annote = {Keywords: Fine-grained complexity, conditional lower bound, fine-grained reduction, Approximation algorithms, Analysis of algorithms, Computational geometry, Computational and structural complexity theory}
}
@InProceedings{acharya_et_al:LIPIcs.ICALP.2024.8,
author = {Acharya, Pritam and Bhore, Sujoy and Gupta, Aaryan and Khan, Arindam and Mondal, Bratin and Wiese, Andreas},
title = {{Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {8:1--8:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.8},
URN = {urn:nbn:de:0030-drops-201511},
doi = {10.4230/LIPIcs.ICALP.2024.8},
annote = {Keywords: Approximation Algorithms, Polygon Packing, Circle Packing, Sphere Packing, Geometric Knapsack, Resource Augmentation}
}
@InProceedings{akmal_et_al:LIPIcs.ICALP.2024.9,
author = {Akmal, Shyan and Vassilevska Williams, Virginia and Wein, Nicole},
title = {{Detecting Disjoint Shortest Paths in Linear Time and More}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.9},
URN = {urn:nbn:de:0030-drops-201529},
doi = {10.4230/LIPIcs.ICALP.2024.9},
annote = {Keywords: disjoint shortest paths, algebraic graph algorithms, disjoint paths, fine-grained complexity, clique}
}
@InProceedings{anand_et_al:LIPIcs.ICALP.2024.10,
author = {Anand, Emile and van den Brand, Jan and Ghadiri, Mehrdad and Zhang, Daniel J.},
title = {{The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.10},
URN = {urn:nbn:de:0030-drops-201538},
doi = {10.4230/LIPIcs.ICALP.2024.10},
annote = {Keywords: Data Structures, Online Algorithms, Bit Complexity}
}
@InProceedings{anand_et_al:LIPIcs.ICALP.2024.11,
author = {Anand, Konrad and Feng, Weiming and Freifeld, Graham and Guo, Heng and Wang, Jiaheng},
title = {{Approximate Counting for Spin Systems in Sub-Quadratic Time}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.11},
URN = {urn:nbn:de:0030-drops-201543},
doi = {10.4230/LIPIcs.ICALP.2024.11},
annote = {Keywords: Randomised algorithm, Approximate counting, Spin system, Sub-quadratic algorithm}
}
@InProceedings{arteche_et_al:LIPIcs.ICALP.2024.12,
author = {Arteche, Noel and Khaniki, Erfan and Pich, J\'{a}n and Santhanam, Rahul},
title = {{From Proof Complexity to Circuit Complexity via Interactive Protocols}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.12},
URN = {urn:nbn:de:0030-drops-201557},
doi = {10.4230/LIPIcs.ICALP.2024.12},
annote = {Keywords: proof complexity, circuit complexity, interactive protocols}
}
@InProceedings{arunachalam_et_al:LIPIcs.ICALP.2024.13,
author = {Arunachalam, Srinivasan and Dutt, Arkopal and Escudero Guti\'{e}rrez, Francisco and Palazuelos, Carlos},
title = {{Learning Low-Degree Quantum Objects}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {13:1--13:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.13},
URN = {urn:nbn:de:0030-drops-201563},
doi = {10.4230/LIPIcs.ICALP.2024.13},
annote = {Keywords: Tomography}
}
@InProceedings{arvind_et_al:LIPIcs.ICALP.2024.14,
author = {Arvind, Vikraman and Joglekar, Pushkar S.},
title = {{A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {14:1--14:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.14},
URN = {urn:nbn:de:0030-drops-201571},
doi = {10.4230/LIPIcs.ICALP.2024.14},
annote = {Keywords: noncommutative rank, rational formulas, identity testing, parallel complexity}
}
@InProceedings{azar_et_al:LIPIcs.ICALP.2024.15,
author = {Azar, Yossi and Lewkowicz, Shahar and Vainstein, Danny},
title = {{List Update with Delays or Time Windows}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {15:1--15:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.15},
URN = {urn:nbn:de:0030-drops-201583},
doi = {10.4230/LIPIcs.ICALP.2024.15},
annote = {Keywords: Online, List Update, Delay, Time Window, Deadline}
}
@InProceedings{baraskar_et_al:LIPIcs.ICALP.2024.16,
author = {Baraskar, Omkar and Dewan, Agrim and Saha, Chandan and Sinha, Pulkit},
title = {{NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {16:1--16:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.16},
URN = {urn:nbn:de:0030-drops-201598},
doi = {10.4230/LIPIcs.ICALP.2024.16},
annote = {Keywords: Equivalence testing, MCSP, sparse polynomials, 3SAT}
}
@InProceedings{baswana_et_al:LIPIcs.ICALP.2024.17,
author = {Baswana, Surender and Bhanja, Koustav},
title = {{Vital Edges for (s,t)-Mincut: Efficient Algorithms, Compact Structures, \& Optimal Sensitivity Oracles}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {17:1--17:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.17},
URN = {urn:nbn:de:0030-drops-201601},
doi = {10.4230/LIPIcs.ICALP.2024.17},
annote = {Keywords: maxflow, vital edges, graph algorithms, structures, st-cuts, sensitivity oracle}
}
@InProceedings{bateni_et_al:LIPIcs.ICALP.2024.18,
author = {Bateni, MohammadHossein and Dhulipala, Laxman and Gowda, Kishen N. and Hershkowitz, D. Ellis and Jayaram, Rajesh and {\L}\k{a}cki, Jakub},
title = {{It’s Hard to HAC Average Linkage!}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.18},
URN = {urn:nbn:de:0030-drops-201613},
doi = {10.4230/LIPIcs.ICALP.2024.18},
annote = {Keywords: Clustering, Hierarchical Graph Clustering, HAC, Fine-Grained Complexity, Parallel Algorithms, CC}
}
@InProceedings{behnezhad_et_al:LIPIcs.ICALP.2024.19,
author = {Behnezhad, Soheil and Roghani, Mohammad and Rubinstein, Aviad and Saberi, Amin},
title = {{Sublinear Algorithms for TSP via Path Covers}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.19},
URN = {urn:nbn:de:0030-drops-201623},
doi = {10.4230/LIPIcs.ICALP.2024.19},
annote = {Keywords: Sublinear Algorithms, Traveling Salesman Problem, Approximation Algorithm, (1, 2)-TSP, Graphic TSP}
}
@InProceedings{belazzougui_et_al:LIPIcs.ICALP.2024.20,
author = {Belazzougui, Djamal and Kucherov, Gregory and Walzer, Stefan},
title = {{Better Space-Time-Robustness Trade-Offs for Set Reconciliation}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.20},
URN = {urn:nbn:de:0030-drops-201639},
doi = {10.4230/LIPIcs.ICALP.2024.20},
annote = {Keywords: data structures, hashing, set reconciliation, invertible Bloom lookup tables, random hypergraphs, BCH codes}
}
@InProceedings{bendavid_et_al:LIPIcs.ICALP.2024.21,
author = {Ben-David, Shalev and Kundu, Srijita},
title = {{Oracle Separation of QMA and QCMA with Bounded Adaptivity}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {21:1--21:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.21},
URN = {urn:nbn:de:0030-drops-201642},
doi = {10.4230/LIPIcs.ICALP.2024.21},
annote = {Keywords: Quantum computing, computational complexity}
}
@InProceedings{bentert_et_al:LIPIcs.ICALP.2024.22,
author = {Bentert, Matthias and Drange, P\r{a}l Gr{\o}n\r{a}s and Fomin, Fedor V. and Golovach, Petr A. and Korhonen, Tuukka},
title = {{Two-Sets Cut-Uncut on Planar Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.22},
URN = {urn:nbn:de:0030-drops-201654},
doi = {10.4230/LIPIcs.ICALP.2024.22},
annote = {Keywords: planar graphs, cut-uncut, group-constrained paths}
}
@InProceedings{berczi_et_al:LIPIcs.ICALP.2024.23,
author = {B\'{e}rczi, Krist\'{o}f and Chandrasekaran, Karthekeyan and Kir\'{a}ly, Tam\'{a}s and Kulkarni, Shubhang},
title = {{Splitting-Off in Hypergraphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {23:1--23:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.23},
URN = {urn:nbn:de:0030-drops-201660},
doi = {10.4230/LIPIcs.ICALP.2024.23},
annote = {Keywords: Hypergraphs, Hypergraph Connectivity, Splitting-off, Constructive Characterizations, Hypergraph Orientations, Submodular Functions, Combinatorial Optimization}
}
@InProceedings{bhattacharjee_et_al:LIPIcs.ICALP.2024.24,
author = {Bhattacharjee, Somnath and Bl\"{a}ser, Markus and Dutta, Pranjal and Mukherjee, Saswata},
title = {{Exponential Lower Bounds via Exponential Sums}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {24:1--24:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.24},
URN = {urn:nbn:de:0030-drops-201677},
doi = {10.4230/LIPIcs.ICALP.2024.24},
annote = {Keywords: Algebraic complexity, parameterized complexity, exponential sums, counting hierarchy, tau conjecture}
}
@InProceedings{bhattacharyya_et_al:LIPIcs.ICALP.2024.25,
author = {Bhattacharyya, Chiranjib and Kannan, Ravindran and Kumar, Amit},
title = {{Random Separating Hyperplane Theorem and Learning Polytopes}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.25},
URN = {urn:nbn:de:0030-drops-201687},
doi = {10.4230/LIPIcs.ICALP.2024.25},
annote = {Keywords: Separating Hyperplane Theorem, Learning Polytopes, Optimization Oracles}
}
@InProceedings{bjorklund_et_al:LIPIcs.ICALP.2024.26,
author = {Bj\"{o}rklund, Andreas and Kaski, Petteri and Nederlof, Jesper},
title = {{Another Hamiltonian Cycle in Bipartite Pfaffian Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {26:1--26:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.26},
URN = {urn:nbn:de:0030-drops-201692},
doi = {10.4230/LIPIcs.ICALP.2024.26},
annote = {Keywords: Another Hamiltonian cycle, Pfaffian graph, planar graph, Thomason’s lollipop method}
}
@InProceedings{bodwin_et_al:LIPIcs.ICALP.2024.27,
author = {Bodwin, Greg and Deng, Chengyuan and Gao, Jie and Hoppenworth, Gary and Upadhyay, Jalaj and Wang, Chen},
title = {{The Discrepancy of Shortest Paths}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {27:1--27:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.27},
URN = {urn:nbn:de:0030-drops-201705},
doi = {10.4230/LIPIcs.ICALP.2024.27},
annote = {Keywords: Discrepancy, hereditary discrepancy, shortest paths, differential privacy}
}
@InProceedings{bodwin_et_al:LIPIcs.ICALP.2024.28,
author = {Bodwin, Greg and Hoppenworth, Gary and Vassilevska Williams, Virginia and Wein, Nicole and Xu, Zixuan},
title = {{Additive Spanner Lower Bounds with Optimal Inner Graph Structure}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {28:1--28:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.28},
URN = {urn:nbn:de:0030-drops-201715},
doi = {10.4230/LIPIcs.ICALP.2024.28},
annote = {Keywords: Additive Spanners, Graph Theory}
}
@InProceedings{bojikian_et_al:LIPIcs.ICALP.2024.29,
author = {Bojikian, Narek and Kratsch, Stefan},
title = {{A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {29:1--29:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.29},
URN = {urn:nbn:de:0030-drops-201728},
doi = {10.4230/LIPIcs.ICALP.2024.29},
annote = {Keywords: Parameterized complexity, Steiner tree, clique-width}
}
@InProceedings{boneh_et_al:LIPIcs.ICALP.2024.30,
author = {Boneh, Itai and Golan, Shay and Mozes, Shay and Weimann, Oren},
title = {{\~{O}ptimal Dynamic Time Warping on Run-Length Encoded Strings}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {30:1--30:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.30},
URN = {urn:nbn:de:0030-drops-201730},
doi = {10.4230/LIPIcs.ICALP.2024.30},
annote = {Keywords: Dynamic time warping, Fr\'{e}chet distance, edit distance, run-length encoding}
}
@InProceedings{bonnet_et_al:LIPIcs.ICALP.2024.31,
author = {Bonnet, \'{E}douard and Duron, Julien and Sylvester, John and Zamaraev, Viktor and Zhukovskii, Maksim},
title = {{Tight Bounds on Adjacency Labels for Monotone Graph Classes}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {31:1--31:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.31},
URN = {urn:nbn:de:0030-drops-201741},
doi = {10.4230/LIPIcs.ICALP.2024.31},
annote = {Keywords: Adjacency labeling, degeneracy, monotone classes, small classes, factorial classes, implicit graph conjecture}
}
@InProceedings{borzechowski_et_al:LIPIcs.ICALP.2024.32,
author = {Borzechowski, Michaela and Fearnley, John and Gordon, Spencer and Savani, Rahul and Schnider, Patrick and Weber, Simon},
title = {{Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.32},
URN = {urn:nbn:de:0030-drops-201751},
doi = {10.4230/LIPIcs.ICALP.2024.32},
annote = {Keywords: P-LCP, Unique Sink Orientation, \alpha-Ham Sandwich, search complexity, TFNP, UEOPL}
}
@InProceedings{bougeret_et_al:LIPIcs.ICALP.2024.33,
author = {Bougeret, Marin and Jansen, Bart M. P. and Sau, Ignasi},
title = {{Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {33:1--33:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.33},
URN = {urn:nbn:de:0030-drops-201766},
doi = {10.4230/LIPIcs.ICALP.2024.33},
annote = {Keywords: hitting subgraphs, hitting induced subgraphs, parameterized complexity, polynomial kernel, complexity dichotomy, elimination distance}
}
@InProceedings{canesmer_et_al:LIPIcs.ICALP.2024.34,
author = {Can Esmer, Bar{\i}\c{s} and Focke, Jacob and Marx, D\'{a}niel and Rz\k{a}\.{z}ewski, Pawe{\l}},
title = {{Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {34:1--34:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.34},
URN = {urn:nbn:de:0030-drops-201772},
doi = {10.4230/LIPIcs.ICALP.2024.34},
annote = {Keywords: Parameterized Complexity, Tight Bounds, Hub, Treewidth, Strong Exponential Time Hypothesis, Vertex Coloring, Vertex Deletion, Edge Deletion, Triangle Packing, Triangle Partition, Set Cover Hypothesis, Dominating Set}
}
@InProceedings{carlson_et_al:LIPIcs.ICALP.2024.35,
author = {Carlson, Charlie and Davies, Ewan and Kolla, Alexandra and Potukuchi, Aditya},
title = {{A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {35:1--35:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.35},
URN = {urn:nbn:de:0030-drops-201782},
doi = {10.4230/LIPIcs.ICALP.2024.35},
annote = {Keywords: approximate counting, independent sets, bipartite graphs, graph containers}
}
@InProceedings{cautres_et_al:LIPIcs.ICALP.2024.36,
author = {Cautr\`{e}s, Maxime and Claudet, Nathan and Mhalla, Mehdi and Perdrix, Simon and Savin, Valentin and Thomass\'{e}, St\'{e}phan},
title = {{Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {36:1--36:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.36},
URN = {urn:nbn:de:0030-drops-201796},
doi = {10.4230/LIPIcs.ICALP.2024.36},
annote = {Keywords: Quantum networks, graph states, vertex-minors, k-pairability}
}
@InProceedings{censorhillel_et_al:LIPIcs.ICALP.2024.37,
author = {Censor-Hillel, Keren and Even, Tomer and Vassilevska Williams, Virginia},
title = {{Fast Approximate Counting of Cycles}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {37:1--37:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.37},
URN = {urn:nbn:de:0030-drops-201809},
doi = {10.4230/LIPIcs.ICALP.2024.37},
annote = {Keywords: Approximate triangle counting, Approximate cycle counting Fast matrix multiplication, Fast rectangular matrix multiplication}
}
@InProceedings{chalermsook_et_al:LIPIcs.ICALP.2024.38,
author = {Chalermsook, Parinya and Gupta, Manoj and Jiamjitrak, Wanchote and Pareek, Akash and Yingchareonthawornchai, Sorrachai},
title = {{The Group Access Bounds for Binary Search Trees}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {38:1--38:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.38},
URN = {urn:nbn:de:0030-drops-201817},
doi = {10.4230/LIPIcs.ICALP.2024.38},
annote = {Keywords: Dynamic Optimality, Binary Search Tree, Online Algorithm}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.ICALP.2024.39,
author = {Charalampopoulos, Panagiotis and Gawrychowski, Pawe{\l} and Ghazawi, Samah},
title = {{Optimal Bounds for Distinct Quartics}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {39:1--39:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.39},
URN = {urn:nbn:de:0030-drops-201823},
doi = {10.4230/LIPIcs.ICALP.2024.39},
annote = {Keywords: 2D strings, quartics, repetitions, periodicity}
}
@InProceedings{chechik_et_al:LIPIcs.ICALP.2024.40,
author = {Chechik, Shiri and Mukhtar, Doron and Zhang, Tianyi},
title = {{Streaming Edge Coloring with Subquadratic Palette Size}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {40:1--40:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.40},
URN = {urn:nbn:de:0030-drops-201831},
doi = {10.4230/LIPIcs.ICALP.2024.40},
annote = {Keywords: graph algorithms, streaming algorithms, edge coloring}
}
@InProceedings{chechik_et_al:LIPIcs.ICALP.2024.41,
author = {Chechik, Shiri and Zhang, Tianyi},
title = {{Faster Algorithms for Dual-Failure Replacement Paths}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {41:1--41:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.41},
URN = {urn:nbn:de:0030-drops-201849},
doi = {10.4230/LIPIcs.ICALP.2024.41},
annote = {Keywords: graph algorithms, shortest paths, replacement paths}
}
@InProceedings{chechik_et_al:LIPIcs.ICALP.2024.42,
author = {Chechik, Shiri and Zhang, Tianyi},
title = {{Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {42:1--42:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.42},
URN = {urn:nbn:de:0030-drops-201859},
doi = {10.4230/LIPIcs.ICALP.2024.42},
annote = {Keywords: graph algorithms, shortest paths, distance oracles}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2024.43,
author = {Chen, Chung Shue and Keevash, Peter and Kennedy, Sean and de Panafieu, \'{E}lie and Vetta, Adrian},
title = {{Robot Positioning Using Torus Packing for Multisets}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {43:1--43:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.43},
URN = {urn:nbn:de:0030-drops-201862},
doi = {10.4230/LIPIcs.ICALP.2024.43},
annote = {Keywords: Universal cycles, positioning systems, de Bruijn sequences}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2024.44,
author = {Chen, Junjie and Li, Minming and Xu, Haifeng and Zuo, Song},
title = {{Bayesian Calibrated Click-Through Auctions}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {44:1--44:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.44},
URN = {urn:nbn:de:0030-drops-201878},
doi = {10.4230/LIPIcs.ICALP.2024.44},
annote = {Keywords: information design, ad auctions, online advertising, mechanism design}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2024.45,
author = {Chen, Li and Ye, Mingquan},
title = {{High-Accuracy Multicommodity Flows via Iterative Refinement}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {45:1--45:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.45},
URN = {urn:nbn:de:0030-drops-201887},
doi = {10.4230/LIPIcs.ICALP.2024.45},
annote = {Keywords: High-accuracy multicommodity flow, Iterative refinement framework, Convex flow solver}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2024.46,
author = {Chen, Yu and Kapralov, Michael and Makarov, Mikhail and Mazzali, Davide},
title = {{On the Streaming Complexity of Expander Decomposition}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {46:1--46:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.46},
URN = {urn:nbn:de:0030-drops-201890},
doi = {10.4230/LIPIcs.ICALP.2024.46},
annote = {Keywords: Graph Sketching, Dynamic Streaming, Expander Decomposition}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2024.47,
author = {Chen, Yu and Tan, Zihan},
title = {{Lower Bounds on 0-Extension with Steiner Nodes}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {47:1--47:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.47},
URN = {urn:nbn:de:0030-drops-201905},
doi = {10.4230/LIPIcs.ICALP.2024.47},
annote = {Keywords: Graph Algorithms, Zero Extension, Integrality Gap}
}
@InProceedings{constantinescu_et_al:LIPIcs.ICALP.2024.48,
author = {Constantinescu, Andrei and Lenzner, Pascal and Reiffenh\"{a}user, Rebecca and Schmand, Daniel and Varricchio, Giovanna},
title = {{Solving Woeginger’s Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {48:1--48:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.48},
URN = {urn:nbn:de:0030-drops-201910},
doi = {10.4230/LIPIcs.ICALP.2024.48},
annote = {Keywords: Algorithmic Game Theory, Dynamic Programming, Anonymous Hedonic Games, Single-Peaked Preferences, Social Optimum, Wonderful Partitions}
}
@InProceedings{csikos_et_al:LIPIcs.ICALP.2024.49,
author = {Csik\'{o}s, M\'{o}nika and Mustafa, Nabil H.},
title = {{An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {49:1--49:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.49},
URN = {urn:nbn:de:0030-drops-201925},
doi = {10.4230/LIPIcs.ICALP.2024.49},
annote = {Keywords: low-crossing matchings, uniform sampling, discrepancy, approximations}
}
@InProceedings{czumaj_et_al:LIPIcs.ICALP.2024.50,
author = {Czumaj, Artur and Gao, Guichen and Jiang, Shaofeng H.-C. and Krauthgamer, Robert and Vesel\'{y}, Pavel},
title = {{Fully-Scalable MPC Algorithms for Clustering in High Dimension}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {50:1--50:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.50},
URN = {urn:nbn:de:0030-drops-201938},
doi = {10.4230/LIPIcs.ICALP.2024.50},
annote = {Keywords: Massively parallel computing, high dimension, facility location, k-median, k-means}
}
@InProceedings{dallard_et_al:LIPIcs.ICALP.2024.51,
author = {Dallard, Cl\'{e}ment and Fomin, Fedor V. and Golovach, Petr A. and Korhonen, Tuukka and Milani\v{c}, Martin},
title = {{Computing Tree Decompositions with Small Independence Number}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {51:1--51:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.51},
URN = {urn:nbn:de:0030-drops-201945},
doi = {10.4230/LIPIcs.ICALP.2024.51},
annote = {Keywords: tree-independence number, approximation, parameterized algorithms}
}
@InProceedings{davies_et_al:LIPIcs.ICALP.2024.52,
author = {Davies, Sami and Moseley, Benjamin and Newman, Heather},
title = {{Simultaneously Approximating All 𝓁\underlinep-Norms in Correlation Clustering}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {52:1--52:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.52},
URN = {urn:nbn:de:0030-drops-201950},
doi = {10.4230/LIPIcs.ICALP.2024.52},
annote = {Keywords: Approximation algorithms, correlation clustering, all-norms, lp-norms}
}
@InProceedings{deligkas_et_al:LIPIcs.ICALP.2024.53,
author = {Deligkas, Argyrios and Eiben, Eduard and Ganian, Robert and Kanj, Iyad and Ramanujan, M. S.},
title = {{Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {53:1--53:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.53},
URN = {urn:nbn:de:0030-drops-201968},
doi = {10.4230/LIPIcs.ICALP.2024.53},
annote = {Keywords: coordinated motion planning, multi-agent path finding, parameterized complexity}
}
@InProceedings{dell_et_al:LIPIcs.ICALP.2024.54,
author = {Dell, Holger and Lapinskas, John and Meeks, Kitty},
title = {{Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {54:1--54:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.54},
URN = {urn:nbn:de:0030-drops-201977},
doi = {10.4230/LIPIcs.ICALP.2024.54},
annote = {Keywords: Graph oracles, Fine-grained complexity, Approximate counting, Hypergraphs}
}
@InProceedings{dogeas_et_al:LIPIcs.ICALP.2024.55,
author = {Dogeas, Konstantinos and Erlebach, Thomas and Kammer, Frank and Meintrup, Johannes and Moses Jr., William K.},
title = {{Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {55:1--55:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.55},
URN = {urn:nbn:de:0030-drops-201989},
doi = {10.4230/LIPIcs.ICALP.2024.55},
annote = {Keywords: dynamic graphs, parameterized algorithms, algorithmic graph theory, graph automorphism, orbit number}
}
@InProceedings{doronarad_et_al:LIPIcs.ICALP.2024.56,
author = {Doron-Arad, Ilan and Kulik, Ariel and Shachnai, Hadas},
title = {{Lower Bounds for Matroid Optimization Problems with a Linear Constraint}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {56:1--56:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.56},
URN = {urn:nbn:de:0030-drops-201990},
doi = {10.4230/LIPIcs.ICALP.2024.56},
annote = {Keywords: matroid optimization, budgeted problems, knapsack, approximation schemes}
}
@InProceedings{doronarad_et_al:LIPIcs.ICALP.2024.57,
author = {Doron-Arad, Ilan and Naor, Joseph (Seffi)},
title = {{Non-Linear Paging}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {57:1--57:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.57},
URN = {urn:nbn:de:0030-drops-202000},
doi = {10.4230/LIPIcs.ICALP.2024.57},
annote = {Keywords: paging, competitive analysis, non-linear paging, submodular and supermodular functions}
}
@InProceedings{dory_et_al:LIPIcs.ICALP.2024.58,
author = {Dory, Michal and Forster, Sebastian and Nazari, Yasamin and de Vos, Tijn},
title = {{New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {58:1--58:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.58},
URN = {urn:nbn:de:0030-drops-202012},
doi = {10.4230/LIPIcs.ICALP.2024.58},
annote = {Keywords: Decremental Shortest Path, All-Pairs Shortest Paths}
}
@InProceedings{dudeja:LIPIcs.ICALP.2024.59,
author = {Dudeja, Aditi},
title = {{Decremental Matching in General Weighted Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {59:1--59:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.59},
URN = {urn:nbn:de:0030-drops-202020},
doi = {10.4230/LIPIcs.ICALP.2024.59},
annote = {Keywords: Weighted Matching, Dynamic Algorithms, Adaptive Adversary}
}
@InProceedings{eden_et_al:LIPIcs.ICALP.2024.60,
author = {Eden, Talya and Levi, Reut and Ron, Dana},
title = {{Testing C\underlinek-Freeness in Bounded-Arboricity Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {60:1--60:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.60},
URN = {urn:nbn:de:0030-drops-202033},
doi = {10.4230/LIPIcs.ICALP.2024.60},
annote = {Keywords: Property Testing, Cycle-Freeness, Bounded Arboricity}
}
@InProceedings{feldmann_et_al:LIPIcs.ICALP.2024.61,
author = {Feldmann, Andreas Emil and Lampis, Michael},
title = {{Parameterized Algorithms for Steiner Forest in Bounded Width Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {61:1--61:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.61},
URN = {urn:nbn:de:0030-drops-202048},
doi = {10.4230/LIPIcs.ICALP.2024.61},
annote = {Keywords: Steiner Forest, Approximation Algorithms, FPT algorithms}
}
@InProceedings{feng_et_al:LIPIcs.ICALP.2024.62,
author = {Feng, Weiming and Guo, Heng},
title = {{An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {62:1--62:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.62},
URN = {urn:nbn:de:0030-drops-202057},
doi = {10.4230/LIPIcs.ICALP.2024.62},
annote = {Keywords: Approximate counting, Network reliability, Sampling algorithm}
}
@InProceedings{feng_et_al:LIPIcs.ICALP.2024.63,
author = {Feng, Yuda and Li, Shi},
title = {{A Note on Approximating Weighted Nash Social Welfare with Additive Valuations}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {63:1--63:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.63},
URN = {urn:nbn:de:0030-drops-202068},
doi = {10.4230/LIPIcs.ICALP.2024.63},
annote = {Keywords: Nash Social Welfare, Configuration LP, Approximation Algorithms}
}
@InProceedings{fischer_et_al:LIPIcs.ICALP.2024.64,
author = {Fischer, Nick and Wennmann, Leo},
title = {{Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {64:1--64:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.64},
URN = {urn:nbn:de:0030-drops-202079},
doi = {10.4230/LIPIcs.ICALP.2024.64},
annote = {Keywords: Scheduling, Fine-Grained Complexity, Dynamic Strings}
}
@InProceedings{florescu_et_al:LIPIcs.ICALP.2024.65,
author = {Florescu, Cella and Kyng, Rasmus and Gutenberg, Maximilian Probst and Sachdeva, Sushant},
title = {{Optimal Electrical Oblivious Routing on Expanders}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {65:1--65:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.65},
URN = {urn:nbn:de:0030-drops-202083},
doi = {10.4230/LIPIcs.ICALP.2024.65},
annote = {Keywords: Expanders, Oblivious routing for 𝓁\underlinep, Electrical flow routing}
}
@InProceedings{foucaud_et_al:LIPIcs.ICALP.2024.66,
author = {Foucaud, Florent and Galby, Esther and Khazaliya, Liana and Li, Shaohua and Mc Inerney, Fionn and Sharma, Roohani and Tale, Prafullkumar},
title = {{Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {66:1--66:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.66},
URN = {urn:nbn:de:0030-drops-202091},
doi = {10.4230/LIPIcs.ICALP.2024.66},
annote = {Keywords: Parameterized Complexity, ETH-based Lower Bounds, Double-Exponential Lower Bounds, Kernelization, Vertex Cover, Treewidth, Diameter, Metric Dimension, Strong Metric Dimension, Geodetic Sets}
}
@InProceedings{galby_et_al:LIPIcs.ICALP.2024.67,
author = {Galby, Esther and Kisfaludi-Bak, S\'{a}ndor and Marx, D\'{a}niel and Sharma, Roohani},
title = {{Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {67:1--67:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.67},
URN = {urn:nbn:de:0030-drops-202104},
doi = {10.4230/LIPIcs.ICALP.2024.67},
annote = {Keywords: Directed Steiner Network, Sub-exponential algorithm}
}
@InProceedings{ganian_et_al:LIPIcs.ICALP.2024.68,
author = {Ganian, Robert and M\"{u}ller, Haiko and Ordyniak, Sebastian and Paesani, Giacomo and Rychlicki, Mateusz},
title = {{A Tight Subexponential-Time Algorithm for Two-Page Book Embedding}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {68:1--68:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.68},
URN = {urn:nbn:de:0030-drops-202114},
doi = {10.4230/LIPIcs.ICALP.2024.68},
annote = {Keywords: book embedding, page number, subexponential algorithms, subhamiltonicity, feedback edge number}
}
@InProceedings{gaspers_et_al:LIPIcs.ICALP.2024.69,
author = {Gaspers, Serge and Li, Jerry Zirui},
title = {{Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {69:1--69:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.69},
URN = {urn:nbn:de:0030-drops-202124},
doi = {10.4230/LIPIcs.ICALP.2024.69},
annote = {Keywords: Graph algorithms, quantum algorithms, graph coloring, domatic number, set cover, set partition, set packing}
}
@InProceedings{gharibian_et_al:LIPIcs.ICALP.2024.70,
author = {Gharibian, Sevag and Kamminga, Jonas},
title = {{BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {70:1--70:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.70},
URN = {urn:nbn:de:0030-drops-202134},
doi = {10.4230/LIPIcs.ICALP.2024.70},
annote = {Keywords: Approximate Counting, Search to Decision Reduction, BQP, NP, Oracle Complexity Class}
}
@InProceedings{ghosh_et_al:LIPIcs.ICALP.2024.71,
author = {Ghosh, Prantar and Stoeckl, Manuel},
title = {{Low-Memory Algorithms for Online Edge Coloring}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {71:1--71:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.71},
URN = {urn:nbn:de:0030-drops-202146},
doi = {10.4230/LIPIcs.ICALP.2024.71},
annote = {Keywords: Edge coloring, streaming model, online algorithms}
}
@InProceedings{giannakopoulos_et_al:LIPIcs.ICALP.2024.72,
author = {Giannakopoulos, Yiannis and Grosz, Alexander and Melissourgos, Themistoklis},
title = {{On the Smoothed Complexity of Combinatorial Local Search}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {72:1--72:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.72},
URN = {urn:nbn:de:0030-drops-202154},
doi = {10.4230/LIPIcs.ICALP.2024.72},
annote = {Keywords: Smoothed Analysis, local search, better-response dynamics, PLS-hardness, combinatorial local optimization, congestion games, pure Nash equilibria}
}
@InProceedings{gilboa:LIPIcs.ICALP.2024.73,
author = {Gilboa, Matan},
title = {{A Characterization of Complexity in Public Goods Games}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {73:1--73:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.73},
URN = {urn:nbn:de:0030-drops-202164},
doi = {10.4230/LIPIcs.ICALP.2024.73},
annote = {Keywords: Nash Equilibrium, Public Goods, Computational Complexity}
}
@InProceedings{goldberg:LIPIcs.ICALP.2024.74,
author = {Goldberg, Guy},
title = {{Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {74:1--74:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.74},
URN = {urn:nbn:de:0030-drops-202174},
doi = {10.4230/LIPIcs.ICALP.2024.74},
annote = {Keywords: Locally decodable codes, Relaxed locally correctable codes, Relaxed locally decodable codes}
}
@InProceedings{gretta_et_al:LIPIcs.ICALP.2024.75,
author = {Gretta, Lucas and Price, Eric},
title = {{Sharp Noisy Binary Search with Monotonic Probabilities}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {75:1--75:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.75},
URN = {urn:nbn:de:0030-drops-202188},
doi = {10.4230/LIPIcs.ICALP.2024.75},
annote = {Keywords: fine-grained algorithms, randomized/probabilistic methods, sublinear/streaming algorithms, noisy binary search}
}
@InProceedings{grobler_et_al:LIPIcs.ICALP.2024.76,
author = {Grobler, Mario and Maaz, Stephanie and Megow, Nicole and Mouawad, Amer E. and Ramamoorthi, Vijayaragunathan and Schmand, Daniel and Siebertz, Sebastian},
title = {{Solution Discovery via Reconfiguration for Problems in P}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {76:1--76:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.76},
URN = {urn:nbn:de:0030-drops-202195},
doi = {10.4230/LIPIcs.ICALP.2024.76},
annote = {Keywords: solution discovery, reconfiguration, spanning tree, shortest path, matching, cut}
}
@InProceedings{groenland_et_al:LIPIcs.ICALP.2024.77,
author = {Groenland, Carla and Mannens, Isja and Nederlof, Jesper and Piecyk, Marta and Rz\k{a}\.{z}ewski, Pawe{\l}},
title = {{Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {77:1--77:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.77},
URN = {urn:nbn:de:0030-drops-202208},
doi = {10.4230/LIPIcs.ICALP.2024.77},
annote = {Keywords: graph homomorphism, cutwidth, asymptotic matrix parameters}
}
@InProceedings{grohe_et_al:LIPIcs.ICALP.2024.78,
author = {Grohe, Martin and Neuen, Daniel},
title = {{Isomorphism for Tournaments of Small Twin Width}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {78:1--78:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.78},
URN = {urn:nbn:de:0030-drops-202216},
doi = {10.4230/LIPIcs.ICALP.2024.78},
annote = {Keywords: tournament isomorphism, twin width, fixed-parameter tractability, Weisfeiler-Leman algorithm}
}
@InProceedings{gurvits_et_al:LIPIcs.ICALP.2024.79,
author = {Gurvits, Leonid and Klein, Nathan and Leake, Jonathan},
title = {{From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {79:1--79:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.79},
URN = {urn:nbn:de:0030-drops-202229},
doi = {10.4230/LIPIcs.ICALP.2024.79},
annote = {Keywords: traveling salesman problem, strongly Rayleigh distributions, polynomial capacity, probability lower bounds, combinatorial lower bounds}
}
@InProceedings{hajiaghayi_et_al:LIPIcs.ICALP.2024.80,
author = {HajiAghayi, Mohammad T. and Kowalski, Dariusz R. and Olkowski, Jan},
title = {{Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {80:1--80:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.80},
URN = {urn:nbn:de:0030-drops-202235},
doi = {10.4230/LIPIcs.ICALP.2024.80},
annote = {Keywords: distributed algorithms, quantum algorithms, adaptive adversary, crash failures, Consensus, quantum common coin, approximate counting}
}
@InProceedings{harpeled_et_al:LIPIcs.ICALP.2024.81,
author = {Har-Peled, Sariel and Harb, Elfarouk and Livanos, Vasilis},
title = {{Oracle-Augmented Prophet Inequalities}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {81:1--81:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.81},
URN = {urn:nbn:de:0030-drops-202245},
doi = {10.4230/LIPIcs.ICALP.2024.81},
annote = {Keywords: prophet inequalities, predictions, top-1-of-k model}
}
@InProceedings{hatami_et_al:LIPIcs.ICALP.2024.82,
author = {Hatami, Hamed and Hosseini, Kaave and Lovett, Shachar and Ostuni, Anthony},
title = {{Refuting Approaches to the Log-Rank Conjecture for XOR Functions}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {82:1--82:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.82},
URN = {urn:nbn:de:0030-drops-202252},
doi = {10.4230/LIPIcs.ICALP.2024.82},
annote = {Keywords: Communication complexity, log-rank conjecture, XOR functions, additive structure}
}
@InProceedings{heeger_et_al:LIPIcs.ICALP.2024.83,
author = {Heeger, Klaus and Hermelin, Danny and Mnich, Matthias and Shabtay, Dvir},
title = {{No Polynomial Kernels for Knapsack}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {83:1--83:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.83},
URN = {urn:nbn:de:0030-drops-202261},
doi = {10.4230/LIPIcs.ICALP.2024.83},
annote = {Keywords: Knapsack, polynomial kernels, compositions, number of different weights, number of different profits}
}
@InProceedings{heimann_et_al:LIPIcs.ICALP.2024.84,
author = {Heimann, Sophia and Hoang, Hung P. and Hougardy, Stefan},
title = {{The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {84:1--84:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.84},
URN = {urn:nbn:de:0030-drops-202270},
doi = {10.4230/LIPIcs.ICALP.2024.84},
annote = {Keywords: Traveling Salesman Problem, k-Opt algorithm, PLS-completeness}
}
@InProceedings{hirahara_et_al:LIPIcs.ICALP.2024.85,
author = {Hirahara, Shuichi and Ohsaka, Naoto},
title = {{Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {85:1--85:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.85},
URN = {urn:nbn:de:0030-drops-202283},
doi = {10.4230/LIPIcs.ICALP.2024.85},
annote = {Keywords: reconfiguration problems, hardness of approximation, probabilistic proof systems, FGLSS reduction}
}
@InProceedings{horsch_et_al:LIPIcs.ICALP.2024.86,
author = {H\"{o}rsch, Florian and Imolay, Andr\'{a}s and Mizutani, Ryuhei and Oki, Taihei and Schwarcz, Tam\'{a}s},
title = {{Problems on Group-Labeled Matroid Bases}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {86:1--86:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.86},
URN = {urn:nbn:de:0030-drops-202299},
doi = {10.4230/LIPIcs.ICALP.2024.86},
annote = {Keywords: matroids, matroid intersection, congruency constraint, exact-weight constraint, additive combinatorics, algebraic algorithm, strongly base orderability}
}
@InProceedings{hua_et_al:LIPIcs.ICALP.2024.87,
author = {Hua, Kevin and Li, Daniel and Park, Jaewoo and Saranurak, Thatchaphol},
title = {{Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {87:1--87:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.87},
URN = {urn:nbn:de:0030-drops-202302},
doi = {10.4230/LIPIcs.ICALP.2024.87},
annote = {Keywords: Graphs, Flows, Randomized Algorithms, Vertex Connectivity}
}
@InProceedings{inamdar_et_al:LIPIcs.ICALP.2024.88,
author = {Inamdar, Tanmay and Jain, Pallavi and Lokshtanov, Daniel and Sahu, Abhishek and Saurabh, Saket and Upasana, Anannya},
title = {{Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {88:1--88:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.88},
URN = {urn:nbn:de:0030-drops-202318},
doi = {10.4230/LIPIcs.ICALP.2024.88},
annote = {Keywords: Partial Vertex Cover, Max SAT, FPT Approximation, Matroids}
}
@InProceedings{iseri_et_al:LIPIcs.ICALP.2024.89,
author = {Iseri, Kento and I, Tomohiro and Hendrian, Diptarama and K\"{o}ppl, Dominik and Yoshinaka, Ryo and Shinohara, Ayumi},
title = {{Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {89:1--89:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.89},
URN = {urn:nbn:de:0030-drops-202324},
doi = {10.4230/LIPIcs.ICALP.2024.89},
annote = {Keywords: Index for parameterized pattern matching, Parameterized Burrows-Wheeler Transform, Online construction}
}
@InProceedings{jayaram_et_al:LIPIcs.ICALP.2024.90,
author = {Jayaram, Rajesh and {\L}\k{a}cki, Jakub and Mitrovi\'{c}, Slobodan and Onak, Krzysztof and Sankowski, Piotr},
title = {{Dynamic PageRank: Algorithms and Lower Bounds}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {90:1--90:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.90},
URN = {urn:nbn:de:0030-drops-202336},
doi = {10.4230/LIPIcs.ICALP.2024.90},
annote = {Keywords: PageRank, dynamic algorithms, graph algorithms}
}
@InProceedings{jha_et_al:LIPIcs.ICALP.2024.91,
author = {Jha, Agastya Vibhuti and Kumar, Akash},
title = {{A Sublinear Time Tester for Max-Cut on Clusterable Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {91:1--91:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.91},
URN = {urn:nbn:de:0030-drops-202344},
doi = {10.4230/LIPIcs.ICALP.2024.91},
annote = {Keywords: Sublinear Algorithms, Graph Algorithms, Clusterable Graphs, Property Testung}
}
@InProceedings{jiang_et_al:LIPIcs.ICALP.2024.92,
author = {Jiang, Shaofeng H.-C. and Wang, Wenqian and Zhang, Yubo and Zhang, Yuhao},
title = {{Algorithms for the Generalized Poset Sorting Problem}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {92:1--92:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.92},
URN = {urn:nbn:de:0030-drops-202359},
doi = {10.4230/LIPIcs.ICALP.2024.92},
annote = {Keywords: sorting, poset sorting, generalized sorting}
}
@InProceedings{jin_et_al:LIPIcs.ICALP.2024.93,
author = {Jin, Ce and Kapralov, Michael and Mahabadi, Sepideh and Vakilian, Ali},
title = {{Streaming Algorithms for Connectivity Augmentation}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {93:1--93:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.93},
URN = {urn:nbn:de:0030-drops-202367},
doi = {10.4230/LIPIcs.ICALP.2024.93},
annote = {Keywords: streaming algorithms, connectivity augmentation}
}
@InProceedings{jin_et_al:LIPIcs.ICALP.2024.94,
author = {Jin, Ce and Wu, Hongxun},
title = {{A Faster Algorithm for Pigeonhole Equal Sums}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {94:1--94:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.94},
URN = {urn:nbn:de:0030-drops-202375},
doi = {10.4230/LIPIcs.ICALP.2024.94},
annote = {Keywords: Subset Sum, Pigeonhole, PPP}
}
@InProceedings{karczmarz_et_al:LIPIcs.ICALP.2024.95,
author = {Karczmarz, Adam and Smulewicz, Marcin},
title = {{Fully Dynamic Strongly Connected Components in Planar Digraphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {95:1--95:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.95},
URN = {urn:nbn:de:0030-drops-202388},
doi = {10.4230/LIPIcs.ICALP.2024.95},
annote = {Keywords: dynamic strongly connected components, dynamic strong connectivity, dynamic reachability, planar graphs}
}
@InProceedings{kawase_et_al:LIPIcs.ICALP.2024.96,
author = {Kawase, Yasushi and Nishimura, Koichi and Sumita, Hanna},
title = {{Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {96:1--96:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.96},
URN = {urn:nbn:de:0030-drops-202393},
doi = {10.4230/LIPIcs.ICALP.2024.96},
annote = {Keywords: Integral base-polyhedron, Fair allocation, Matroid}
}
@InProceedings{kenneth_et_al:LIPIcs.ICALP.2024.97,
author = {Kenneth, Yotam and Krauthgamer, Robert},
title = {{Cut Sparsification and Succinct Representation of Submodular Hypergraphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {97:1--97:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.97},
URN = {urn:nbn:de:0030-drops-202406},
doi = {10.4230/LIPIcs.ICALP.2024.97},
annote = {Keywords: Cut Sparsification, Submodular Hypergraphs, Succinct Representation}
}
@InProceedings{khanna_et_al:LIPIcs.ICALP.2024.98,
author = {Khanna, Sanjeev and Putterman, Aaron (Louie) and Sudan, Madhu},
title = {{Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {98:1--98:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.98},
URN = {urn:nbn:de:0030-drops-202410},
doi = {10.4230/LIPIcs.ICALP.2024.98},
annote = {Keywords: Sparsification, sketching, hypergraphs}
}
@InProceedings{klemz_et_al:LIPIcs.ICALP.2024.99,
author = {Klemz, Boris and Sieper, Marie Diana},
title = {{Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {99:1--99:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.99},
URN = {urn:nbn:de:0030-drops-202428},
doi = {10.4230/LIPIcs.ICALP.2024.99},
annote = {Keywords: Parameterized Complexity, Graph Drawing, Planar Poset Diagram, Level Planarity, Constrained Level Planarity, Vertex Cover, FPT, Computational Geometry}
}
@InProceedings{kobayashi_et_al:LIPIcs.ICALP.2024.100,
author = {Kobayashi, Yusuke and Terao, Tatsuya},
title = {{Subquadratic Submodular Maximization with a General Matroid Constraint}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {100:1--100:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.100},
URN = {urn:nbn:de:0030-drops-202437},
doi = {10.4230/LIPIcs.ICALP.2024.100},
annote = {Keywords: submodular maximization, matroid constraint, approximation algorithm, rounding algorithm, query complexity}
}
@InProceedings{kopelowitz_et_al:LIPIcs.ICALP.2024.101,
author = {Kopelowitz, Tsvi and Korin, Ariel and Roditty, Liam},
title = {{On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {101:1--101:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.101},
URN = {urn:nbn:de:0030-drops-202443},
doi = {10.4230/LIPIcs.ICALP.2024.101},
annote = {Keywords: Graph algorithms, Approximate distance oracle, data structures, shortest path}
}
@InProceedings{kumabe_et_al:LIPIcs.ICALP.2024.102,
author = {Kumabe, Soh and Yoshida, Yuichi},
title = {{Lipschitz Continuous Allocations for Optimization Games}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {102:1--102:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.102},
URN = {urn:nbn:de:0030-drops-202456},
doi = {10.4230/LIPIcs.ICALP.2024.102},
annote = {Keywords: Cooperative Games, Lipschitz Continuity}
}
@InProceedings{kuszmaul_et_al:LIPIcs.ICALP.2024.103,
author = {Kuszmaul, William and Xi, Zoe},
title = {{Towards an Analysis of Quadratic Probing}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {103:1--103:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.103},
URN = {urn:nbn:de:0030-drops-202463},
doi = {10.4230/LIPIcs.ICALP.2024.103},
annote = {Keywords: quadratic probing, hashing, open addressing, witness trees}
}
@InProceedings{larsen_et_al:LIPIcs.ICALP.2024.104,
author = {Larsen, Kasper Green and Pagh, Rasmus and Persiano, Giuseppe and Pitassi, Toniann and Yeo, Kevin and Zamir, Or},
title = {{Optimal Non-Adaptive Cell Probe Dictionaries and Hashing}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {104:1--104:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.104},
URN = {urn:nbn:de:0030-drops-202471},
doi = {10.4230/LIPIcs.ICALP.2024.104},
annote = {Keywords: non-adaptive, cell probe, dictionary, hashing}
}
@InProceedings{lee_et_al:LIPIcs.ICALP.2024.105,
author = {Lee, Eunou and Parekh, Ojas},
title = {{An Improved Quantum Max Cut Approximation via Maximum Matching}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {105:1--105:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.105},
URN = {urn:nbn:de:0030-drops-202482},
doi = {10.4230/LIPIcs.ICALP.2024.105},
annote = {Keywords: approximation, optimization, local Hamiltonian, rounding, SDP, matching}
}
@InProceedings{li_et_al:LIPIcs.ICALP.2024.106,
author = {Li, Shi and Xu, Chenyang and Zhang, Ruilong},
title = {{Polylogarithmic Approximations for Robust s-t Path}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {106:1--106:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.106},
URN = {urn:nbn:de:0030-drops-202497},
doi = {10.4230/LIPIcs.ICALP.2024.106},
annote = {Keywords: Approximation Algorithm, Randomized LP Rounding, Robust s-t Path}
}
@InProceedings{li_et_al:LIPIcs.ICALP.2024.107,
author = {Li, Shuangle and Lin, Bingkai and Liu, Yuwei},
title = {{Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {107:1--107:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.107},
URN = {urn:nbn:de:0030-drops-202500},
doi = {10.4230/LIPIcs.ICALP.2024.107},
annote = {Keywords: Nearest Codeword Problem, Hardness of Approximations, Fine-grained Complexity, Parameterized Complexity, Minimum Distance Problem, Shortest Vector Problem}
}
@InProceedings{li_et_al:LIPIcs.ICALP.2024.108,
author = {Li, Xin and Zhong, Yan},
title = {{Two-Source and Affine Non-Malleable Extractors for Small Entropy}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {108:1--108:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.108},
URN = {urn:nbn:de:0030-drops-202512},
doi = {10.4230/LIPIcs.ICALP.2024.108},
annote = {Keywords: Randomness Extractors, Non-malleable, Two-source, Affine}
}
@InProceedings{long_et_al:LIPIcs.ICALP.2024.109,
author = {Long, Yaowei and Wang, Yunfan},
title = {{Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {109:1--109:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.109},
URN = {urn:nbn:de:0030-drops-202523},
doi = {10.4230/LIPIcs.ICALP.2024.109},
annote = {Keywords: connectivity, sensitivity}
}
@InProceedings{lu_et_al:LIPIcs.ICALP.2024.110,
author = {Lu, Zhenjian and Santhanam, Rahul},
title = {{Impagliazzo’s Worlds Through the Lens of Conditional Kolmogorov Complexity}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {110:1--110:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.110},
URN = {urn:nbn:de:0030-drops-202538},
doi = {10.4230/LIPIcs.ICALP.2024.110},
annote = {Keywords: meta-complexity, Kolmogorov complexity, one-way functions, average-case complexity}
}
@InProceedings{makarychev_et_al:LIPIcs.ICALP.2024.111,
author = {Makarychev, Yury and Ovsiankin, Max and Tani, Erasmo},
title = {{Approximation Algorithms for 𝓁\underlinep-Shortest Path and 𝓁\underlinep-Group Steiner Tree}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {111:1--111:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.111},
URN = {urn:nbn:de:0030-drops-202542},
doi = {10.4230/LIPIcs.ICALP.2024.111},
annote = {Keywords: Shortest Path, Asymmetric Group Steiner Tree, Sum-of-Squares}
}
@InProceedings{modanese_et_al:LIPIcs.ICALP.2024.112,
author = {Modanese, Augusto and Yoshida, Yuichi},
title = {{Testing Spreading Behavior in Networks with Arbitrary Topologies}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {112:1--112:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.112},
URN = {urn:nbn:de:0030-drops-202554},
doi = {10.4230/LIPIcs.ICALP.2024.112},
annote = {Keywords: Property testing, bootstrap percolation, local phenomena, expander graphs}
}
@InProceedings{ohsaka:LIPIcs.ICALP.2024.113,
author = {Ohsaka, Naoto},
title = {{Alphabet Reduction for Reconfiguration Problems}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {113:1--113:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.113},
URN = {urn:nbn:de:0030-drops-202560},
doi = {10.4230/LIPIcs.ICALP.2024.113},
annote = {Keywords: reconfiguration problems, hardness of approximation, Hadamard codes, alphabet reduction}
}
@InProceedings{paul_et_al:LIPIcs.ICALP.2024.114,
author = {Paul, Christophe and Protopapas, Evangelos and Thilikos, Dimitrios M. and Wiederrecht, Sebastian},
title = {{Delineating Half-Integrality of the Erd\H{o}s-P\'{o}sa Property for Minors: The Case of Surfaces}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {114:1--114:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.114},
URN = {urn:nbn:de:0030-drops-202576},
doi = {10.4230/LIPIcs.ICALP.2024.114},
annote = {Keywords: Erd\H{o}s-P\'{o}sa property, Erd\H{o}s-P\'{o}sa pair, Graph parameters, Graph minors, Universal obstruction, Surface containment}
}
@InProceedings{plevrakis_et_al:LIPIcs.ICALP.2024.115,
author = {Plevrakis, Orestis and Ragavan, Seyoon and Weinberg, S. Matthew},
title = {{On the Cut-Query Complexity of Approximating Max-Cut}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {115:1--115:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.115},
URN = {urn:nbn:de:0030-drops-202587},
doi = {10.4230/LIPIcs.ICALP.2024.115},
annote = {Keywords: query complexity, maximum cut, approximation algorithms, graph sparsification}
}
@InProceedings{podolskii_et_al:LIPIcs.ICALP.2024.116,
author = {Podolskii, Vladimir V. and Sluch, Dmitrii},
title = {{One-Way Communication Complexity of Partial XOR Functions}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {116:1--116:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.116},
URN = {urn:nbn:de:0030-drops-202591},
doi = {10.4230/LIPIcs.ICALP.2024.116},
annote = {Keywords: Partial functions, XOR functions, communication complexity, decision trees, covering codes}
}
@InProceedings{potechin_et_al:LIPIcs.ICALP.2024.117,
author = {Potechin, Aaron and Zhang, Aaron},
title = {{Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {117:1--117:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.117},
URN = {urn:nbn:de:0030-drops-202604},
doi = {10.4230/LIPIcs.ICALP.2024.117},
annote = {Keywords: Proof complexity, Nullstellensatz, pigeonhole principle, coefficient size}
}
@InProceedings{quanrud:LIPIcs.ICALP.2024.118,
author = {Quanrud, Kent},
title = {{Adaptive Sparsification for Matroid Intersection}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {118:1--118:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.118},
URN = {urn:nbn:de:0030-drops-202614},
doi = {10.4230/LIPIcs.ICALP.2024.118},
annote = {Keywords: Matroid intersection, adaptive sparsification, multiplicative-weight udpates, primal-dual}
}
@InProceedings{sachdeva_et_al:LIPIcs.ICALP.2024.119,
author = {Sachdeva, Sushant and Thudi, Anvith and Zhao, Yibin},
title = {{Better Sparsifiers for Directed Eulerian Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {119:1--119:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.119},
URN = {urn:nbn:de:0030-drops-202628},
doi = {10.4230/LIPIcs.ICALP.2024.119},
annote = {Keywords: Graph algorithms, Linear algebra and computation, Discrepancy theory}
}
@InProceedings{sadeh_et_al:LIPIcs.ICALP.2024.120,
author = {Sadeh, Yaniv and Kaplan, Haim},
title = {{Caching Connections in Matchings}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {120:1--120:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.120},
URN = {urn:nbn:de:0030-drops-202639},
doi = {10.4230/LIPIcs.ICALP.2024.120},
annote = {Keywords: Caching, Matchings, Caching in Matchings, Edge Coloring, Online Algorithms}
}
@InProceedings{saneian_et_al:LIPIcs.ICALP.2024.121,
author = {Saneian, Mohammad and Behnezhad, Soheil},
title = {{Streaming Edge Coloring with Asymptotically Optimal Colors}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {121:1--121:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.121},
URN = {urn:nbn:de:0030-drops-202640},
doi = {10.4230/LIPIcs.ICALP.2024.121},
annote = {Keywords: Streaming, Edge coloring, Adversarial order}
}
@InProceedings{schlomberg:LIPIcs.ICALP.2024.122,
author = {Schlomberg, Niklas},
title = {{An Improved Integrality Gap for Disjoint Cycles in Planar Graphs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {122:1--122:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.122},
URN = {urn:nbn:de:0030-drops-202651},
doi = {10.4230/LIPIcs.ICALP.2024.122},
annote = {Keywords: Cycle packing, planar graphs, disjoint paths}
}
@InProceedings{yung:LIPIcs.ICALP.2024.123,
author = {Yung, Kingsley},
title = {{Limits of Sequential Local Algorithms on the Random k-XORSAT Problem}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {123:1--123:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.123},
URN = {urn:nbn:de:0030-drops-202666},
doi = {10.4230/LIPIcs.ICALP.2024.123},
annote = {Keywords: Random k-XORSAT, Sequential local algorithms, Average-case complexity, Phase transition, Overlap gap property}
}
@InProceedings{acharya_et_al:LIPIcs.ICALP.2024.124,
author = {Acharya, Rohan and Jurdzi\'{n}ski, Marcin and Prakash, Aditya},
title = {{Lookahead Games and Efficient Determinisation of History-Deterministic B\"{u}chi Automata}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {124:1--124:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.124},
URN = {urn:nbn:de:0030-drops-202672},
doi = {10.4230/LIPIcs.ICALP.2024.124},
annote = {Keywords: History determinism, Good-for-games, Automata over infinite words, Games}
}
@InProceedings{aiswarya_et_al:LIPIcs.ICALP.2024.125,
author = {Aiswarya, C. and Manuel, Amaldev and Sunny, Saina},
title = {{Edit Distance of Finite State Transducers}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {125:1--125:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.125},
URN = {urn:nbn:de:0030-drops-202682},
doi = {10.4230/LIPIcs.ICALP.2024.125},
annote = {Keywords: transducers, edit distance, conjugacy}
}
@InProceedings{baumann_et_al:LIPIcs.ICALP.2024.126,
author = {Baumann, Pascal and Keskin, Eren and Meyer, Roland and Zetzsche, Georg},
title = {{Separability in B\"{u}chi VASS and Singly Non-Linear Systems of Inequalities}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {126:1--126:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.126},
URN = {urn:nbn:de:0030-drops-202695},
doi = {10.4230/LIPIcs.ICALP.2024.126},
annote = {Keywords: Vector addition systems, infinite words, separability, inequalities, quantifier elimination, rational, polynomials}
}
@InProceedings{benedikt_et_al:LIPIcs.ICALP.2024.127,
author = {Benedikt, Michael and Lu, Chia-Hsuan and Motik, Boris and Tan, Tony},
title = {{Decidability of Graph Neural Networks via Logical Characterizations}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {127:1--127:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.127},
URN = {urn:nbn:de:0030-drops-202708},
doi = {10.4230/LIPIcs.ICALP.2024.127},
annote = {Keywords: Logic, Graph Neural Networks}
}
@InProceedings{benerecetti_et_al:LIPIcs.ICALP.2024.128,
author = {Benerecetti, Massimo and Bozzelli, Laura and Mogavero, Fabio and Peron, Adriano},
title = {{Automata-Theoretic Characterisations of Branching-Time Temporal Logics}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {128:1--128:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.128},
URN = {urn:nbn:de:0030-drops-202716},
doi = {10.4230/LIPIcs.ICALP.2024.128},
annote = {Keywords: Branching-Time Temporal Logics, Monadic Second-Order Logics, Tree Automata}
}
@InProceedings{blanc_et_al:LIPIcs.ICALP.2024.129,
author = {Blanc, Manon and Bournez, Olivier},
title = {{The Complexity of Computing in Continuous Time: Space Complexity Is Precision}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {129:1--129:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.129},
URN = {urn:nbn:de:0030-drops-202722},
doi = {10.4230/LIPIcs.ICALP.2024.129},
annote = {Keywords: Models of computation, Ordinary differential equations, Real computations, Analog computations, Complexity theory, Implicit complexity, Recursion scheme}
}
@InProceedings{bojanczyk_et_al:LIPIcs.ICALP.2024.130,
author = {Boja\'{n}czyk, Miko{\l}aj and Nguy\~{ê}n, L\^{e} Th\`{a}nh D\~{u}ng (Tito) and Stefa\'{n}ski, Rafa{\l}},
title = {{Function Spaces for Orbit-Finite Sets}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {130:1--130:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.130},
URN = {urn:nbn:de:0030-drops-202730},
doi = {10.4230/LIPIcs.ICALP.2024.130},
annote = {Keywords: Orbit-finite sets, automata, linear types, game semantics}
}
@InProceedings{carayol_et_al:LIPIcs.ICALP.2024.131,
author = {Carayol, Arnaud and Charamond, Lucien},
title = {{The Structure of Trees in the Pushdown Hierarchy}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {131:1--131:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.131},
URN = {urn:nbn:de:0030-drops-202749},
doi = {10.4230/LIPIcs.ICALP.2024.131},
annote = {Keywords: Pushdown hierarchy, Monadic second-order logic, Automatic numbers}
}
@InProceedings{chistikov_et_al:LIPIcs.ICALP.2024.132,
author = {Chistikov, Dmitry and Mansutti, Alessio and Starchak, Mikhail R.},
title = {{Integer Linear-Exponential Programming in NP by Quantifier Elimination}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {132:1--132:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.132},
URN = {urn:nbn:de:0030-drops-202758},
doi = {10.4230/LIPIcs.ICALP.2024.132},
annote = {Keywords: decision procedures, integer programming, quantifier elimination}
}
@InProceedings{dantam_et_al:LIPIcs.ICALP.2024.133,
author = {Dantam, Mohan and Mayr, Richard},
title = {{Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {133:1--133:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.133},
URN = {urn:nbn:de:0030-drops-202762},
doi = {10.4230/LIPIcs.ICALP.2024.133},
annote = {Keywords: Markov decision processes, energy, mean payoff, parity, strategy complexity}
}
@InProceedings{dorfler_et_al:LIPIcs.ICALP.2024.134,
author = {D\"{o}rfler, Julian and Ikenmeyer, Christian},
title = {{Functional Closure Properties of Finite \mathbb{N}-Weighted Automata}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {134:1--134:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.134},
URN = {urn:nbn:de:0030-drops-202777},
doi = {10.4230/LIPIcs.ICALP.2024.134},
annote = {Keywords: Finite automata, weighted automata, counting, closure properties, algebraic varieties}
}
@InProceedings{doumane_et_al:LIPIcs.ICALP.2024.135,
author = {Doumane, Amina and Humeau, Samuel and Pous, Damien},
title = {{A Finite Presentation of Graphs of Treewidth at Most Three}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {135:1--135:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.135},
URN = {urn:nbn:de:0030-drops-202787},
doi = {10.4230/LIPIcs.ICALP.2024.135},
annote = {Keywords: Graphs, treewidth, connectedness, axiomatisation, series-parallel expressions}
}
@InProceedings{fu_et_al:LIPIcs.ICALP.2024.136,
author = {Fu, Yuxi and Yang, Qizhe and Zheng, Yangluo},
title = {{Improved Algorithm for Reachability in d-VASS}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {136:1--136:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.136},
URN = {urn:nbn:de:0030-drops-202799},
doi = {10.4230/LIPIcs.ICALP.2024.136},
annote = {Keywords: Petri net, vector addition system, reachability}
}
@InProceedings{gajarsky_et_al:LIPIcs.ICALP.2024.137,
author = {Gajarsk\'{y}, Jakub and McCarty, Rose},
title = {{On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {137:1--137:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.137},
URN = {urn:nbn:de:0030-drops-202802},
doi = {10.4230/LIPIcs.ICALP.2024.137},
annote = {Keywords: First-order model checking, structural graph theory, structural sparsity}
}
@InProceedings{gallot_et_al:LIPIcs.ICALP.2024.138,
author = {Gallot, Paul and Maneth, Sebastian and Nakano, Keisuke and Peyrat, Charles},
title = {{Deciding Linear Height and Linear Size-To-Height Increase of Macro Tree Transducers}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {138:1--138:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.138},
URN = {urn:nbn:de:0030-drops-202818},
doi = {10.4230/LIPIcs.ICALP.2024.138},
annote = {Keywords: automata, formal language theory, macro tree transducer, normal form}
}
@InProceedings{giles_et_al:LIPIcs.ICALP.2024.139,
author = {Giles, Raphael Douglas and Jackson, Vincent and Rizkallah, Christine},
title = {{T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {139:1--139:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.139},
URN = {urn:nbn:de:0030-drops-202827},
doi = {10.4230/LIPIcs.ICALP.2024.139},
annote = {Keywords: Termination, Recursive functions}
}
@InProceedings{guilmant_et_al:LIPIcs.ICALP.2024.140,
author = {Guilmant, Quentin and Lefaucheux, Engel and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{The 2-Dimensional Constraint Loop Problem Is Decidable}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {140:1--140:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.140},
URN = {urn:nbn:de:0030-drops-202831},
doi = {10.4230/LIPIcs.ICALP.2024.140},
annote = {Keywords: Linear Constraints Loops, Minkowski-Weyl, Convex Sets, Asymptotic Expansions}
}
@InProceedings{guttenberg:LIPIcs.ICALP.2024.141,
author = {Guttenberg, Roland},
title = {{Flattability of Priority Vector Addition Systems}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {141:1--141:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.141},
URN = {urn:nbn:de:0030-drops-202848},
doi = {10.4230/LIPIcs.ICALP.2024.141},
annote = {Keywords: Priority Vector Addition Systems, Semilinear, Inductive Invariants, Geometry, Flattability, Almost Semilinear, Transformer Relation}
}
@InProceedings{haase_et_al:LIPIcs.ICALP.2024.142,
author = {Haase, Christoph and Krishna, Shankara Narayanan and Madnani, Khushraj and Mishra, Om Swostik and Zetzsche, Georg},
title = {{An Efficient Quantifier Elimination Procedure for Presburger Arithmetic}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {142:1--142:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.142},
URN = {urn:nbn:de:0030-drops-202856},
doi = {10.4230/LIPIcs.ICALP.2024.142},
annote = {Keywords: Presburger arithmetic, quantifier elimination, parametric integer programming, convex geometry}
}
@InProceedings{hashimoto_et_al:LIPIcs.ICALP.2024.143,
author = {Hashimoto, Go and G\u{a}in\u{a}, Daniel and \c{T}u\c{t}u, Ionu\c{t}},
title = {{Forcing, Transition Algebras, and Calculi}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {143:1--143:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.143},
URN = {urn:nbn:de:0030-drops-202868},
doi = {10.4230/LIPIcs.ICALP.2024.143},
annote = {Keywords: Forcing, institution theory, calculi, algebraic specification, transition systems}
}
@InProceedings{kebis_et_al:LIPIcs.ICALP.2024.144,
author = {Kebis, Pavol and Luca, Florian and Ouaknine, Jo\"{e}l and Scoones, Andrew and Worrell, James},
title = {{On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {144:1--144:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.144},
URN = {urn:nbn:de:0030-drops-202873},
doi = {10.4230/LIPIcs.ICALP.2024.144},
annote = {Keywords: Transcendence, Subspace Theorem, Fibonacci Word, Tribonacci Word}
}
@InProceedings{kenison:LIPIcs.ICALP.2024.145,
author = {Kenison, George},
title = {{The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {145:1--145:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.145},
URN = {urn:nbn:de:0030-drops-202882},
doi = {10.4230/LIPIcs.ICALP.2024.145},
annote = {Keywords: Threshold Problem, Membership Problem, Hypergeometric Sequences}
}
@InProceedings{larrauri_et_al:LIPIcs.ICALP.2024.146,
author = {Larrauri, Alberto and \v{Z}ivn\'{y}, Stanislav},
title = {{Solving Promise Equations over Monoids and Groups}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {146:1--146:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.146},
URN = {urn:nbn:de:0030-drops-202893},
doi = {10.4230/LIPIcs.ICALP.2024.146},
annote = {Keywords: constraint satisfaction, promise constraint satisfaction, equations, minions}
}
@InProceedings{loff_et_al:LIPIcs.ICALP.2024.147,
author = {Loff, Bruno and Skomra, Mateusz},
title = {{Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {147:1--147:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.147},
URN = {urn:nbn:de:0030-drops-202908},
doi = {10.4230/LIPIcs.ICALP.2024.147},
annote = {Keywords: Mean-payoff games, discounted games, policy iteration, smoothed analysis}
}
@InProceedings{mottet_et_al:LIPIcs.ICALP.2024.148,
author = {Mottet, Antoine and Nagy, Tom\'{a}\v{s} and Pinsker, Michael},
title = {{An Order out of Nowhere: A New Algorithm for Infinite-Domain \{CSP\}s}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {148:1--148:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.148},
URN = {urn:nbn:de:0030-drops-202912},
doi = {10.4230/LIPIcs.ICALP.2024.148},
annote = {Keywords: Constraint Satisfaction Problems, Hypergraphs, Polymorphisms}
}
@InProceedings{rozowski:LIPIcs.ICALP.2024.149,
author = {R\'{o}\.{z}owski, Wojciech},
title = {{A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {149:1--149:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.149},
URN = {urn:nbn:de:0030-drops-202920},
doi = {10.4230/LIPIcs.ICALP.2024.149},
annote = {Keywords: Regular Expressions, Behavioural Distances, Quantitative Equational Theories}
}
@InProceedings{rydval:LIPIcs.ICALP.2024.150,
author = {Rydval, Jakub},
title = {{Homogeneity and Homogenizability: Hard Problems for the Logic SNP}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {150:1--150:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.150},
URN = {urn:nbn:de:0030-drops-202939},
doi = {10.4230/LIPIcs.ICALP.2024.150},
annote = {Keywords: constraint satisfaction problems, finitely bounded, homogeneous, amalgamation property, universal, SNP, homogenizable}
}
@InProceedings{rydval_et_al:LIPIcs.ICALP.2024.151,
author = {Rydval, Jakub and Semani\v{s}inov\'{a}, \v{Z}aneta and Wrona, Micha{\l}},
title = {{Identifying Tractable Quantified Temporal Constraints Within Ord-Horn}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {151:1--151:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.151},
URN = {urn:nbn:de:0030-drops-202944},
doi = {10.4230/LIPIcs.ICALP.2024.151},
annote = {Keywords: constraint satisfaction problems, quantifiers, dichotomy, temporal reasoning, Ord-Horn}
}
@InProceedings{scheidt:LIPIcs.ICALP.2024.152,
author = {Scheidt, Benjamin},
title = {{On Homomorphism Indistinguishability and Hypertree Depth}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {152:1--152:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.152},
URN = {urn:nbn:de:0030-drops-202958},
doi = {10.4230/LIPIcs.ICALP.2024.152},
annote = {Keywords: homomorphism indistinguishability, counting logics, guarded logics, hypergraphs, incidence graphs, tree depth, elimination forest, hypertree width}
}
@InProceedings{schmitz_et_al:LIPIcs.ICALP.2024.153,
author = {Schmitz, Sylvain and Sch\"{u}tze, Lia},
title = {{On the Length of Strongly Monotone Descending Chains over \mathbb{N}^d}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {153:1--153:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.153},
URN = {urn:nbn:de:0030-drops-202964},
doi = {10.4230/LIPIcs.ICALP.2024.153},
annote = {Keywords: Vector addition system, coverability, well-quasi-order, order ideal, affine net}
}
@InProceedings{theyssier:LIPIcs.ICALP.2024.154,
author = {Theyssier, Guillaume},
title = {{FO Logic on Cellular Automata Orbits Equals MSO Logic}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {154:1--154:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.154},
URN = {urn:nbn:de:0030-drops-202972},
doi = {10.4230/LIPIcs.ICALP.2024.154},
annote = {Keywords: MSO logic, FO logic, cellular automata, domino problem, Cayley graphs}
}
@InProceedings{uezato:LIPIcs.ICALP.2024.155,
author = {Uezato, Yuya},
title = {{Regular Expressions with Backreferences and Lookaheads Capture NLOG}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {155:1--155:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.155},
URN = {urn:nbn:de:0030-drops-202984},
doi = {10.4230/LIPIcs.ICALP.2024.155},
annote = {Keywords: Regular Expression, Automata Theory, Nondeterministic Log-Space}
}
@InProceedings{vanbergerem_et_al:LIPIcs.ICALP.2024.156,
author = {van Bergerem, Steffen and Guttenberg, Roland and Kiefer, Sandra and Mascle, Corto and Waldburger, Nicolas and Weil-Kennedy, Chana},
title = {{Verification of Population Protocols with Unordered Data}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {156:1--156:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.156},
URN = {urn:nbn:de:0030-drops-202993},
doi = {10.4230/LIPIcs.ICALP.2024.156},
annote = {Keywords: Population protocols, Parameterized verification, Distributed computing, Well-specification}
}
@InProceedings{zhang_et_al:LIPIcs.ICALP.2024.157,
author = {Zhang, Cheng and de Amorim, Arthur Azevedo and Gaboardi, Marco},
title = {{Domain Reasoning in TopKAT}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {157:1--157:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.157},
URN = {urn:nbn:de:0030-drops-203003},
doi = {10.4230/LIPIcs.ICALP.2024.157},
annote = {Keywords: Kleene algebra, Kleene Algebra With Tests, Kleene Algebra With Domain, Kleene Algebra With Top and Tests, Completeness, Decidability}
}
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