@Proceedings{etessami_et_al:LIPIcs.ICALP.2023,
title = {{LIPIcs, Volume 261, ICALP 2023, Complete Volume}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {1--2486},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023},
URN = {urn:nbn:de:0030-drops-180517},
doi = {10.4230/LIPIcs.ICALP.2023},
annote = {Keywords: LIPIcs, Volume 261, ICALP 2023, Complete Volume}
}
@InProceedings{etessami_et_al:LIPIcs.ICALP.2023.0,
author = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {0:i--0:xxxviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.0},
URN = {urn:nbn:de:0030-drops-180523},
doi = {10.4230/LIPIcs.ICALP.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{karlin:LIPIcs.ICALP.2023.1,
author = {Karlin, Anna R.},
title = {{A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.1},
URN = {urn:nbn:de:0030-drops-180531},
doi = {10.4230/LIPIcs.ICALP.2023.1},
annote = {Keywords: Traveling Salesperson Problem, approximation algorithm}
}
@InProceedings{kyng:LIPIcs.ICALP.2023.2,
author = {Kyng, Rasmus},
title = {{An Almost-Linear Time Algorithm for Maximum Flow and More}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.2},
URN = {urn:nbn:de:0030-drops-180543},
doi = {10.4230/LIPIcs.ICALP.2023.2},
annote = {Keywords: Maximum flow, Minimum cost flow, Data structures, Interior point methods, Convex optimization}
}
@InProceedings{baumann_et_al:LIPIcs.ICALP.2023.3,
author = {Baumann, Pascal and Ganardi, Moses and Majumdar, Rupak and Thinniyam, Ramanathan S. and Zetzsche, Georg},
title = {{Context-Bounded Analysis of Concurrent Programs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {3:1--3:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.3},
URN = {urn:nbn:de:0030-drops-180559},
doi = {10.4230/LIPIcs.ICALP.2023.3},
annote = {Keywords: Context-bounded analysis, Multi-threaded programs, Decidability}
}
@InProceedings{vidick:LIPIcs.ICALP.2023.4,
author = {Vidick, Thomas},
title = {{Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {4:1--4:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.4},
URN = {urn:nbn:de:0030-drops-180569},
doi = {10.4230/LIPIcs.ICALP.2023.4},
annote = {Keywords: quantum interactive proofs, quantum codes}
}
@InProceedings{worrell:LIPIcs.ICALP.2023.5,
author = {Worrell, James},
title = {{The Skolem Landscape}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {5:1--5:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.5},
URN = {urn:nbn:de:0030-drops-180573},
doi = {10.4230/LIPIcs.ICALP.2023.5},
annote = {Keywords: Automata, Formal Languages, Linear Recurrence Sequences}
}
@InProceedings{aamand_et_al:LIPIcs.ICALP.2023.6,
author = {Aamand, Anders and Karczmarz, Adam and {\L}\k{a}cki, Jakub and Parotsidis, Nikos and Rasmussen, Peter M. R. and Thorup, Mikkel},
title = {{Optimal Decremental Connectivity in Non-Sparse Graphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.6},
URN = {urn:nbn:de:0030-drops-180581},
doi = {10.4230/LIPIcs.ICALP.2023.6},
annote = {Keywords: decremental connectivity, dynamic connectivity}
}
@InProceedings{afshani_et_al:LIPIcs.ICALP.2023.7,
author = {Afshani, Peyman and Cheng, Pingan and Basu Roy, Aniket and Wei, Zhewei},
title = {{On Range Summary Queries}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.7},
URN = {urn:nbn:de:0030-drops-180590},
doi = {10.4230/LIPIcs.ICALP.2023.7},
annote = {Keywords: Computational Geometry, Range Searching, Random Sampling, Geometric Approximation, Data Structures and Algorithms}
}
@InProceedings{agarwal_et_al:LIPIcs.ICALP.2023.8,
author = {Agarwal, Ishan and Cole, Richard},
title = {{Stable Matching: Choosing Which Proposals to Make}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {8:1--8:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.8},
URN = {urn:nbn:de:0030-drops-180603},
doi = {10.4230/LIPIcs.ICALP.2023.8},
annote = {Keywords: Stable matching, randomized analysis}
}
@InProceedings{agassy_et_al:LIPIcs.ICALP.2023.9,
author = {Agassy, Daniel and Dorfman, Dani and Kaplan, Haim},
title = {{Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {9:1--9:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.9},
URN = {urn:nbn:de:0030-drops-180619},
doi = {10.4230/LIPIcs.ICALP.2023.9},
annote = {Keywords: Exapander Decomposition, Cut-Matching Game}
}
@InProceedings{akbari_et_al:LIPIcs.ICALP.2023.10,
author = {Akbari, Amirreza and Eslami, Navid and Lievonen, Henrik and Melnyk, Darya and S\"{a}rkij\"{a}rvi, Joona and Suomela, Jukka},
title = {{Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.10},
URN = {urn:nbn:de:0030-drops-180627},
doi = {10.4230/LIPIcs.ICALP.2023.10},
annote = {Keywords: Online computation, spatial advice, distributed algorithms, computational complexity}
}
@InProceedings{akmal_et_al:LIPIcs.ICALP.2023.11,
author = {Akmal, Shyan and Jin, Ce},
title = {{An Efficient Algorithm for All-Pairs Bounded Edge Connectivity}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.11},
URN = {urn:nbn:de:0030-drops-180632},
doi = {10.4230/LIPIcs.ICALP.2023.11},
annote = {Keywords: maximum flow, all-pairs, connectivity, matrix rank}
}
@InProceedings{amireddy_et_al:LIPIcs.ICALP.2023.12,
author = {Amireddy, Prashanth and Garg, Ankit and Kayal, Neeraj and Saha, Chandan and Thankey, Bhargav},
title = {{Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.12},
URN = {urn:nbn:de:0030-drops-180642},
doi = {10.4230/LIPIcs.ICALP.2023.12},
annote = {Keywords: arithmetic circuits, low-depth circuits, lower bounds, shifted partials}
}
@InProceedings{azar_et_al:LIPIcs.ICALP.2023.13,
author = {Azar, Yossi and Vainstein, Danny},
title = {{Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.13},
URN = {urn:nbn:de:0030-drops-180656},
doi = {10.4230/LIPIcs.ICALP.2023.13},
annote = {Keywords: Hierarchical clustering, Linear arrangements, Metric embeddings}
}
@InProceedings{azarmehr_et_al:LIPIcs.ICALP.2023.14,
author = {Azarmehr, Amir and Behnezhad, Soheil},
title = {{Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.14},
URN = {urn:nbn:de:0030-drops-180666},
doi = {10.4230/LIPIcs.ICALP.2023.14},
annote = {Keywords: Maximum Matching, Robust Communication Complexity, Edge Degree Constrained Subgraph}
}
@InProceedings{bansal_et_al:LIPIcs.ICALP.2023.15,
author = {Bansal, Ishan and Cheriyan, Joseph and Grout, Logan and Ibrahimpur, Sharat},
title = {{Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.15},
URN = {urn:nbn:de:0030-drops-180678},
doi = {10.4230/LIPIcs.ICALP.2023.15},
annote = {Keywords: Approximation algorithms, Edge-connectivity of graphs, f-Connectivity problem, Flexible Graph Connectivity, Minimum cuts, Network design, Primal-dual method, Small cuts}
}
@InProceedings{barman_et_al:LIPIcs.ICALP.2023.16,
author = {Barman, Siddharth and Kulkarni, Pooja},
title = {{Approximation Algorithms for Envy-Free Cake Division with Connected Pieces}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {16:1--16:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.16},
URN = {urn:nbn:de:0030-drops-180685},
doi = {10.4230/LIPIcs.ICALP.2023.16},
annote = {Keywords: Fair Division, Envy-Freeness, Envy-Cycle Elimination}
}
@InProceedings{beame_et_al:LIPIcs.ICALP.2023.17,
author = {Beame, Paul and Kornerup, Niels},
title = {{Cumulative Memory Lower Bounds for Randomized and Quantum Computation}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {17:1--17:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.17},
URN = {urn:nbn:de:0030-drops-180694},
doi = {10.4230/LIPIcs.ICALP.2023.17},
annote = {Keywords: Cumulative memory complexity, time-space tradeoffs, branching programs, quantum lower bounds}
}
@InProceedings{berenbrink_et_al:LIPIcs.ICALP.2023.18,
author = {Berenbrink, Petra and Hintze, Lukas and Hosseinpour, Hamed and Kaaser, Dominik and Rau, Malin},
title = {{Dynamic Averaging Load Balancing on Arbitrary Graphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.18},
URN = {urn:nbn:de:0030-drops-180707},
doi = {10.4230/LIPIcs.ICALP.2023.18},
annote = {Keywords: Dynamic Load Balancing, Distributed Computing, Randomized Algorithms, Drift Analysis}
}
@InProceedings{berendsohn_et_al:LIPIcs.ICALP.2023.19,
author = {Berendsohn, Benjamin Aram and Golinsky, Ishay and Kaplan, Haim and Kozma, L\'{a}szl\'{o}},
title = {{Fast Approximation of Search Trees on Trees with Centroid Trees}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {19:1--19:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.19},
URN = {urn:nbn:de:0030-drops-180711},
doi = {10.4230/LIPIcs.ICALP.2023.19},
annote = {Keywords: centroid tree, search trees on trees, approximation}
}
@InProceedings{bergamaschi:LIPIcs.ICALP.2023.20,
author = {Bergamaschi, Thiago},
title = {{Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.20},
URN = {urn:nbn:de:0030-drops-180722},
doi = {10.4230/LIPIcs.ICALP.2023.20},
annote = {Keywords: Approximation Algorithms, Quantum Information}
}
@InProceedings{bhattacharjee_et_al:LIPIcs.ICALP.2023.21,
author = {Bhattacharjee, Rajarshi and Dexter, Gregory and Drineas, Petros and Musco, Cameron and Ray, Archan},
title = {{Sublinear Time Eigenvalue Approximation via Random Sampling}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {21:1--21:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.21},
URN = {urn:nbn:de:0030-drops-180733},
doi = {10.4230/LIPIcs.ICALP.2023.21},
annote = {Keywords: sublinear algorithms, eigenvalue approximation, randomized linear algebra}
}
@InProceedings{bhattacharya_et_al:LIPIcs.ICALP.2023.22,
author = {Bhattacharya, Sudatta and Kouck\'{y}, Michal},
title = {{Streaming k-Edit Approximate Pattern Matching via String Decomposition}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.22},
URN = {urn:nbn:de:0030-drops-180741},
doi = {10.4230/LIPIcs.ICALP.2023.22},
annote = {Keywords: Approximate pattern matching, edit distance, streaming algorithms}
}
@InProceedings{biedl_et_al:LIPIcs.ICALP.2023.23,
author = {Biedl, Therese and Murali, Karthik},
title = {{On Computing the Vertex Connectivity of 1-Plane Graphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {23:1--23:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.23},
URN = {urn:nbn:de:0030-drops-180753},
doi = {10.4230/LIPIcs.ICALP.2023.23},
annote = {Keywords: 1-Planar Graph, Connectivity, Linear Time, Treewidth}
}
@InProceedings{bilo_et_al:LIPIcs.ICALP.2023.24,
author = {Bil\`{o}, Davide and Choudhary, Keerti and Cohen, Sarel and Friedrich, Tobias and Krogmann, Simon and Schirneck, Martin},
title = {{Fault-Tolerant ST-Diameter Oracles}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {24:1--24:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.24},
URN = {urn:nbn:de:0030-drops-180762},
doi = {10.4230/LIPIcs.ICALP.2023.24},
annote = {Keywords: diameter oracles, distance sensitivity oracles, space lower bounds, fault-tolerant data structures}
}
@InProceedings{black_et_al:LIPIcs.ICALP.2023.25,
author = {Black, Hadley and Kalemaj, Iden and Raskhodnikova, Sofya},
title = {{Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.25},
URN = {urn:nbn:de:0030-drops-180774},
doi = {10.4230/LIPIcs.ICALP.2023.25},
annote = {Keywords: Isoperimetric inequalities, property testing, monotonicity testing}
}
@InProceedings{blelloch_et_al:LIPIcs.ICALP.2023.26,
author = {Blelloch, Guy E. and Dobson, Magdalen},
title = {{The Geometry of Tree-Based Sorting}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {26:1--26:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.26},
URN = {urn:nbn:de:0030-drops-180780},
doi = {10.4230/LIPIcs.ICALP.2023.26},
annote = {Keywords: binary search trees, sorting, dynamic optimality, parallelism}
}
@InProceedings{bodlaender_et_al:LIPIcs.ICALP.2023.27,
author = {Bodlaender, Hans L. and Groenland, Carla and Pilipczuk, Micha{\l}},
title = {{Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {27:1--27:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.27},
URN = {urn:nbn:de:0030-drops-180798},
doi = {10.4230/LIPIcs.ICALP.2023.27},
annote = {Keywords: Parameterized Complexity, Constraint Satisfaction Problems, Binary CSP, List Coloring, Vertex Cover, Treedepth, W-hierarchy}
}
@InProceedings{bogdanov_et_al:LIPIcs.ICALP.2023.28,
author = {Bogdanov, Andrej and Rosen, Alon},
title = {{Nondeterministic Interactive Refutations for Nearest Boolean Vector}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {28:1--28:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.28},
URN = {urn:nbn:de:0030-drops-180801},
doi = {10.4230/LIPIcs.ICALP.2023.28},
annote = {Keywords: average-case complexity, statistical zero-knowledge, nondeterministic refutation, Sherrington-Kirkpatrick Hamiltonian, complexity of statistical inference, lattice smoothing}
}
@InProceedings{boschcalvo_et_al:LIPIcs.ICALP.2023.29,
author = {Bosch-Calvo, Miguel and Grandoni, Fabrizio and Jabal Ameli, Afrouz},
title = {{A 4/3 Approximation for 2-Vertex-Connectivity}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.29},
URN = {urn:nbn:de:0030-drops-180813},
doi = {10.4230/LIPIcs.ICALP.2023.29},
annote = {Keywords: Algorithm, Network Design, Vertex-Connectivity, Approximation}
}
@InProceedings{braverman_et_al:LIPIcs.ICALP.2023.30,
author = {Braverman, Vladimir and Krauthgamer, Robert and Krishnan, Aditya and Sapir, Shay},
title = {{Lower Bounds for Pseudo-Deterministic Counting in a Stream}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.30},
URN = {urn:nbn:de:0030-drops-180827},
doi = {10.4230/LIPIcs.ICALP.2023.30},
annote = {Keywords: streaming algorithms, pseudo-deterministic, approximate counting}
}
@InProceedings{caceres:LIPIcs.ICALP.2023.31,
author = {C\'{a}ceres, Manuel},
title = {{Minimum Chain Cover in Almost Linear Time}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {31:1--31:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.31},
URN = {urn:nbn:de:0030-drops-180834},
doi = {10.4230/LIPIcs.ICALP.2023.31},
annote = {Keywords: Minimum chain cover, directed acyclic graph, minimum flow, flow decomposition, mergeable dictionaries, amortized running time}
}
@InProceedings{cade_et_al:LIPIcs.ICALP.2023.32,
author = {Cade, Chris and Folkertsma, Marten and Gharibian, Sevag and Hayakawa, Ryu and Le Gall, Fran\c{c}ois and Morimae, Tomoyuki and Weggemans, Jordi},
title = {{Improved Hardness Results for the Guided Local Hamiltonian Problem}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {32:1--32:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.32},
URN = {urn:nbn:de:0030-drops-180840},
doi = {10.4230/LIPIcs.ICALP.2023.32},
annote = {Keywords: Quantum computing, Quantum advantage, Quantum Chemistry, Guided Local Hamiltonian Problem}
}
@InProceedings{cai_et_al:LIPIcs.ICALP.2023.33,
author = {Cai, Jin-Yi and Young, Ben},
title = {{Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {33:1--33:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.33},
URN = {urn:nbn:de:0030-drops-180851},
doi = {10.4230/LIPIcs.ICALP.2023.33},
annote = {Keywords: #CSP, Quantum isomorphism, Holant, Gadget, Intertwiners, Planar graphs}
}
@InProceedings{chan_et_al:LIPIcs.ICALP.2023.34,
author = {Chan, Timothy M. and He, Qizheng and Yu, Yuancheng},
title = {{On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {34:1--34:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.34},
URN = {urn:nbn:de:0030-drops-180868},
doi = {10.4230/LIPIcs.ICALP.2023.34},
annote = {Keywords: Geometric set cover, discrete k-center, conditional lower bounds}
}
@InProceedings{chang:LIPIcs.ICALP.2023.35,
author = {Chang, Yi-Jun},
title = {{Ortho-Radial Drawing in Near-Linear Time}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {35:1--35:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.35},
URN = {urn:nbn:de:0030-drops-180879},
doi = {10.4230/LIPIcs.ICALP.2023.35},
annote = {Keywords: Graph drawing, ortho-radial drawing, topology-shape-metric framework}
}
@InProceedings{chekuri_et_al:LIPIcs.ICALP.2023.36,
author = {Chekuri, Chandra and Jain, Rhea},
title = {{Approximation Algorithms for Network Design in Non-Uniform Fault Models}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {36:1--36:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.36},
URN = {urn:nbn:de:0030-drops-180885},
doi = {10.4230/LIPIcs.ICALP.2023.36},
annote = {Keywords: non-uniform faults, network design, approximation algorithm}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2023.37,
author = {Chen, Yu and Khanna, Sanjeev and Tan, Zihan},
title = {{Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {37:1--37:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.37},
URN = {urn:nbn:de:0030-drops-180892},
doi = {10.4230/LIPIcs.ICALP.2023.37},
annote = {Keywords: Minimum spanning tree, travelling salesman problem, streaming algorithms}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2023.38,
author = {Chen, Yanlin and de Wolf, Ronald},
title = {{Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {38:1--38:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.38},
URN = {urn:nbn:de:0030-drops-180907},
doi = {10.4230/LIPIcs.ICALP.2023.38},
annote = {Keywords: Quantum algorithms, Regularized linear regression, Lasso, Ridge, Lower bounds}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2023.39,
author = {Chen, Lijie and Lyu, Xin and Tal, Avishay and Wu, Hongxun},
title = {{New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {39:1--39:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.39},
URN = {urn:nbn:de:0030-drops-180916},
doi = {10.4230/LIPIcs.ICALP.2023.39},
annote = {Keywords: pseudorandom generators, derandomization, read-once branching programs}
}
@InProceedings{cheng_et_al:LIPIcs.ICALP.2023.40,
author = {Cheng, Siu-Wing and Huang, Haoqiang},
title = {{Approximate Nearest Neighbor for Polygonal Curves Under Fr\'{e}chet Distance}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {40:1--40:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.40},
URN = {urn:nbn:de:0030-drops-180929},
doi = {10.4230/LIPIcs.ICALP.2023.40},
annote = {Keywords: Polygonal curves, Fr\'{e}chet distance, approximate nearest neighbor}
}
@InProceedings{cheng_et_al:LIPIcs.ICALP.2023.41,
author = {Cheng, Kuan and Jin, Zhengzhong and Li, Xin and Wei, Zhide and Zheng, Yu},
title = {{Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {41:1--41:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.41},
URN = {urn:nbn:de:0030-drops-180931},
doi = {10.4230/LIPIcs.ICALP.2023.41},
annote = {Keywords: Error correcting code, Edit distance, Pseudorandomness, Derandomization}
}
@InProceedings{cheung_et_al:LIPIcs.ICALP.2023.42,
author = {Cheung, Tsun-Ming and Hatami, Hamed and Hatami, Pooya and Hosseini, Kaave},
title = {{Online Learning and Disambiguations of Partial Concept Classes}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {42:1--42:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.42},
URN = {urn:nbn:de:0030-drops-180946},
doi = {10.4230/LIPIcs.ICALP.2023.42},
annote = {Keywords: Online learning, Littlestone dimension, VC dimension, partial concept class, clique vs independent set, Alon-Saks-Seymour conjecture, Standard Optimal Algorithm, PAC learning}
}
@InProceedings{cohen_et_al:LIPIcs.ICALP.2023.43,
author = {Cohen, Ilan Reuven and Panigrahi, Debmalya},
title = {{A General Framework for Learning-Augmented Online Allocation}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {43:1--43:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.43},
URN = {urn:nbn:de:0030-drops-180952},
doi = {10.4230/LIPIcs.ICALP.2023.43},
annote = {Keywords: Algorithms with predictions, Scheduling algorithms, Online algorithms}
}
@InProceedings{cohensidon_et_al:LIPIcs.ICALP.2023.44,
author = {Cohen Sidon, Omer and Ron, Dana},
title = {{Sample-Based Distance-Approximation for Subsequence-Freeness}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {44:1--44:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.44},
URN = {urn:nbn:de:0030-drops-180964},
doi = {10.4230/LIPIcs.ICALP.2023.44},
annote = {Keywords: Property Testing, Distance Approximation}
}
@InProceedings{compton_et_al:LIPIcs.ICALP.2023.45,
author = {Compton, Spencer and Mitrovi\'{c}, Slobodan and Rubinfeld, Ronitt},
title = {{New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {45:1--45:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.45},
URN = {urn:nbn:de:0030-drops-180978},
doi = {10.4230/LIPIcs.ICALP.2023.45},
annote = {Keywords: interval scheduling, dynamic algorithms, local computation algorithms}
}
@InProceedings{coy_et_al:LIPIcs.ICALP.2023.46,
author = {Coy, Sam and Czumaj, Artur and Davies, Peter and Mishra, Gopinath},
title = {{Optimal (Degree+1)-Coloring in Congested Clique}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {46:1--46:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.46},
URN = {urn:nbn:de:0030-drops-180987},
doi = {10.4230/LIPIcs.ICALP.2023.46},
annote = {Keywords: Distributed computing, graph coloring, parallel computing}
}
@InProceedings{disser_et_al:LIPIcs.ICALP.2023.47,
author = {Disser, Yann and Klimm, Max and Schewior, Kevin and Weckbecker, David},
title = {{Incremental Maximization via Continuization}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {47:1--47:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.47},
URN = {urn:nbn:de:0030-drops-180992},
doi = {10.4230/LIPIcs.ICALP.2023.47},
annote = {Keywords: incremental optimization, competitive analysis, robust matching, submodular function}
}
@InProceedings{dorobisz_et_al:LIPIcs.ICALP.2023.48,
author = {Dorobisz, Andrzej and Kozik, Jakub},
title = {{Local Computation Algorithms for Hypergraph Coloring - Following Beck’s Approach}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {48:1--48:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.48},
URN = {urn:nbn:de:0030-drops-181002},
doi = {10.4230/LIPIcs.ICALP.2023.48},
annote = {Keywords: Local Computation Algorithms, Hypergraph Coloring, Property B}
}
@InProceedings{doronarad_et_al:LIPIcs.ICALP.2023.49,
author = {Doron-Arad, Ilan and Kulik, Ariel and Shachnai, Hadas},
title = {{An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {49:1--49:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.49},
URN = {urn:nbn:de:0030-drops-181018},
doi = {10.4230/LIPIcs.ICALP.2023.49},
annote = {Keywords: budgeted matching, budgeted matroid intersection, efficient polynomial-time approximation scheme}
}
@InProceedings{drexler_et_al:LIPIcs.ICALP.2023.50,
author = {Drexler, Lukas and Eube, Jan and Luo, Kelin and R\"{o}glin, Heiko and Schmidt, Melanie and Wargalla, Julian},
title = {{Connected k-Center and k-Diameter Clustering}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {50:1--50:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.50},
URN = {urn:nbn:de:0030-drops-181024},
doi = {10.4230/LIPIcs.ICALP.2023.50},
annote = {Keywords: Approximation algorithms, Clustering, Connectivity constraints}
}
@InProceedings{dughmi_et_al:LIPIcs.ICALP.2023.51,
author = {Dughmi, Shaddin and Kalayci, Yusuf Hakan and Patel, Neel},
title = {{On Sparsification of Stochastic Packing Problems}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {51:1--51:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.51},
URN = {urn:nbn:de:0030-drops-181036},
doi = {10.4230/LIPIcs.ICALP.2023.51},
annote = {Keywords: Stochastic packing, sparsification, matroid}
}
@InProceedings{eden_et_al:LIPIcs.ICALP.2023.52,
author = {Eden, Talya and Liu, Quanquan C. and Raskhodnikova, Sofya and Smith, Adam},
title = {{Triangle Counting with Local Edge Differential Privacy}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {52:1--52:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.52},
URN = {urn:nbn:de:0030-drops-181048},
doi = {10.4230/LIPIcs.ICALP.2023.52},
annote = {Keywords: local differential privacy, reconstruction attacks, lower bounds, triangle counting}
}
@InProceedings{efremenko_et_al:LIPIcs.ICALP.2023.53,
author = {Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.},
title = {{Protecting Single-Hop Radio Networks from Message Drops}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {53:1--53:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.53},
URN = {urn:nbn:de:0030-drops-181059},
doi = {10.4230/LIPIcs.ICALP.2023.53},
annote = {Keywords: Radio Networks, Interactive Coding, Error Correcting Codes}
}
@InProceedings{efthymiou_et_al:LIPIcs.ICALP.2023.54,
author = {Efthymiou, Charilaos and Feng, Weiming},
title = {{On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n,d/n)}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {54:1--54:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.54},
URN = {urn:nbn:de:0030-drops-181064},
doi = {10.4230/LIPIcs.ICALP.2023.54},
annote = {Keywords: spin-system, spin-glass, sparse random (hyper)graph, approximate sampling, efficient algorithm}
}
@InProceedings{efthymiou_et_al:LIPIcs.ICALP.2023.55,
author = {Efthymiou, Charilaos and Zampetakis, Kostas},
title = {{Broadcasting with Random Matrices}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {55:1--55:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.55},
URN = {urn:nbn:de:0030-drops-181070},
doi = {10.4230/LIPIcs.ICALP.2023.55},
annote = {Keywords: spin-system, spin-glass, sparse random graph, reconstruction, phase transitions}
}
@InProceedings{eppstein_et_al:LIPIcs.ICALP.2023.56,
author = {Eppstein, David and Frishberg, Daniel},
title = {{Improved Mixing for the Convex Polygon Triangulation Flip Walk}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {56:1--56:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.56},
URN = {urn:nbn:de:0030-drops-181081},
doi = {10.4230/LIPIcs.ICALP.2023.56},
annote = {Keywords: associahedron, mixing time, mcmc, Markov chains, triangulations, quadrangulations, k-angulations, multicommodity flow, projection-restriction}
}
@InProceedings{esperet_et_al:LIPIcs.ICALP.2023.57,
author = {Esperet, Louis and Harms, Nathaniel and Zamaraev, Viktor},
title = {{Optimal Adjacency Labels for Subgraphs of Cartesian Products}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {57:1--57:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.57},
URN = {urn:nbn:de:0030-drops-181093},
doi = {10.4230/LIPIcs.ICALP.2023.57},
annote = {Keywords: Adjacency labeling schemes, Cartesian product, Hypercubes}
}
@InProceedings{feldman_et_al:LIPIcs.ICALP.2023.58,
author = {Feldman, Michal and Fusco, Federico and Mauras, Simon and Reiffenh\"{a}user, Rebecca},
title = {{Truthful Matching with Online Items and Offline Agents}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {58:1--58:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.58},
URN = {urn:nbn:de:0030-drops-181106},
doi = {10.4230/LIPIcs.ICALP.2023.58},
annote = {Keywords: Online matching, Karp-Vazirani-Vazirani, truthfulness}
}
@InProceedings{ferens_et_al:LIPIcs.ICALP.2023.59,
author = {Ferens, Robert and Szyku{\l}a, Marek},
title = {{Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {59:1--59:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.59},
URN = {urn:nbn:de:0030-drops-181110},
doi = {10.4230/LIPIcs.ICALP.2023.59},
annote = {Keywords: \v{C}ern\'{y} conjecture, complete reachability, DFA, extending word, reachability, reset threshold, reset word, simple idempotent, synchronizing automaton, synchronizing word}
}
@InProceedings{fomin_et_al:LIPIcs.ICALP.2023.60,
author = {Fomin, Fedor V. and Golovach, Petr A. and Sagunov, Danil and Simonov, Kirill},
title = {{Approximating Long Cycle Above Dirac’s Guarantee}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {60:1--60:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.60},
URN = {urn:nbn:de:0030-drops-181128},
doi = {10.4230/LIPIcs.ICALP.2023.60},
annote = {Keywords: Longest path, longest cycle, approximation algorithms, above guarantee parameterization, minimum degree, Dirac theorem}
}
@InProceedings{fomin_et_al:LIPIcs.ICALP.2023.61,
author = {Fomin, Fedor V. and Golovach, Petr A. and Sau, Ignasi and Stamoulis, Giannos and Thilikos, Dimitrios M.},
title = {{Compound Logics for Modification Problems}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {61:1--61:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.61},
URN = {urn:nbn:de:0030-drops-181137},
doi = {10.4230/LIPIcs.ICALP.2023.61},
annote = {Keywords: Algorithmic meta-theorems, Graph modification problems, Model-checking, Graph minors, First-order logic, Monadic second-order logic, Flat Wall theorem, Irrelevant vertex technique}
}
@InProceedings{friedrich_et_al:LIPIcs.ICALP.2023.62,
author = {Friedrich, Tobias and G\"{o}bel, Andreas and Katzmann, Maximilian and Schiller, Leon},
title = {{Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {62:1--62:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.62},
URN = {urn:nbn:de:0030-drops-181147},
doi = {10.4230/LIPIcs.ICALP.2023.62},
annote = {Keywords: random graphs, geometry, dimensionality, cliques, clique number, scale-free networks}
}
@InProceedings{friggstad_et_al:LIPIcs.ICALP.2023.63,
author = {Friggstad, Zachary and Mousavi, Ramin},
title = {{An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {63:1--63:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.63},
URN = {urn:nbn:de:0030-drops-181156},
doi = {10.4230/LIPIcs.ICALP.2023.63},
annote = {Keywords: Directed Steiner tree, Combinatorial optimization, approximation algorithms}
}
@InProceedings{fu_et_al:LIPIcs.ICALP.2023.64,
author = {Fu, Honghao and Wang, Daochen and Zhao, Qi},
title = {{Parallel Self-Testing of EPR Pairs Under Computational Assumptions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {64:1--64:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.64},
URN = {urn:nbn:de:0030-drops-181160},
doi = {10.4230/LIPIcs.ICALP.2023.64},
annote = {Keywords: Quantum complexity theory, self-testing, LWE}
}
@InProceedings{garg_et_al:LIPIcs.ICALP.2023.65,
author = {Garg, Mohit and Hommelsheim, Felix and Megow, Nicole},
title = {{Matching Augmentation via Simultaneous Contractions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {65:1--65:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.65},
URN = {urn:nbn:de:0030-drops-181176},
doi = {10.4230/LIPIcs.ICALP.2023.65},
annote = {Keywords: matching augmentation, approximation algorithms, 2-edge-connectivity}
}
@InProceedings{ghazi_et_al:LIPIcs.ICALP.2023.66,
author = {Ghazi, Badih and Kamath, Pritish and Kumar, Ravi and Manurangsi, Pasin and Wu, Kewen},
title = {{On Differentially Private Counting on Trees}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {66:1--66:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.66},
URN = {urn:nbn:de:0030-drops-181186},
doi = {10.4230/LIPIcs.ICALP.2023.66},
annote = {Keywords: Differential Privacy, Algorithms, Trees, Hierarchies}
}
@InProceedings{gheorghiu_et_al:LIPIcs.ICALP.2023.67,
author = {Gheorghiu, Alexandru and Metger, Tony and Poremba, Alexander},
title = {{Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and More}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {67:1--67:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.67},
URN = {urn:nbn:de:0030-drops-181197},
doi = {10.4230/LIPIcs.ICALP.2023.67},
annote = {Keywords: Quantum cryptography, Remote state preparation, Self-testing, Learning with errors, Quantum copy-protection, Unclonable encryption, Quantum verification}
}
@InProceedings{goldberg_et_al:LIPIcs.ICALP.2023.68,
author = {Goldberg, Leslie Ann and Roth, Marc},
title = {{Parameterised and Fine-Grained Subgraph Counting, Modulo 2}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {68:1--68:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.68},
URN = {urn:nbn:de:0030-drops-181200},
doi = {10.4230/LIPIcs.ICALP.2023.68},
annote = {Keywords: modular counting, parameterised complexity, fine-grained complexity, subgraph counting}
}
@InProceedings{goranci_et_al:LIPIcs.ICALP.2023.69,
author = {Goranci, Gramoz and Henzinger, Monika},
title = {{Efficient Data Structures for Incremental Exact and Approximate Maximum Flow}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {69:1--69:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.69},
URN = {urn:nbn:de:0030-drops-181212},
doi = {10.4230/LIPIcs.ICALP.2023.69},
annote = {Keywords: dynamic graph algorithms, maximum flow, data structures}
}
@InProceedings{goyal_et_al:LIPIcs.ICALP.2023.70,
author = {Goyal, Mohak and Sakshuwong, Sukolsak and Sarmasarkar, Sahasrajit and Goel, Ashish},
title = {{Low Sample Complexity Participatory Budgeting}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {70:1--70:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.70},
URN = {urn:nbn:de:0030-drops-181223},
doi = {10.4230/LIPIcs.ICALP.2023.70},
annote = {Keywords: Social Choice, Participatory budgeting, Nash bargaining}
}
@InProceedings{hader_et_al:LIPIcs.ICALP.2023.71,
author = {Hader, Daniel and Patitz, Matthew J.},
title = {{The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {71:1--71:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.71},
URN = {urn:nbn:de:0030-drops-181238},
doi = {10.4230/LIPIcs.ICALP.2023.71},
annote = {Keywords: Tile-Assembly, Tiles, aTAM, Intrinsic Simulation, Simulation}
}
@InProceedings{harris_et_al:LIPIcs.ICALP.2023.72,
author = {Harris, David G. and Kolmogorov, Vladimir},
title = {{Parameter Estimation for Gibbs Distributions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {72:1--72:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.72},
URN = {urn:nbn:de:0030-drops-181246},
doi = {10.4230/LIPIcs.ICALP.2023.72},
annote = {Keywords: Gibbs distribution, sampling}
}
@InProceedings{haviv:LIPIcs.ICALP.2023.73,
author = {Haviv, Ishay},
title = {{On Finding Constrained Independent Sets in Cycles}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {73:1--73:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.73},
URN = {urn:nbn:de:0030-drops-181254},
doi = {10.4230/LIPIcs.ICALP.2023.73},
annote = {Keywords: Schrijver graph, Kneser graph, Stable sets, PPA-completeness}
}
@InProceedings{henzinger_et_al:LIPIcs.ICALP.2023.74,
author = {Henzinger, Monika and Liu, Paul and Vondr\'{a}k, Jan and Zheng, Da Wei},
title = {{Faster Submodular Maximization for Several Classes of Matroids}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {74:1--74:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.74},
URN = {urn:nbn:de:0030-drops-181267},
doi = {10.4230/LIPIcs.ICALP.2023.74},
annote = {Keywords: submodular optimization, dynamic data structures, matching algorithms}
}
@InProceedings{hlineny_et_al:LIPIcs.ICALP.2023.75,
author = {Hlin\v{e}n\'{y}, Petr and Jedelsk\'{y}, Jan},
title = {{Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {75:1--75:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.75},
URN = {urn:nbn:de:0030-drops-181271},
doi = {10.4230/LIPIcs.ICALP.2023.75},
annote = {Keywords: twin-width, planar graph}
}
@InProceedings{houen_et_al:LIPIcs.ICALP.2023.76,
author = {Houen, Jakob B{\ae}k Tejs and Thorup, Mikkel},
title = {{A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {76:1--76:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.76},
URN = {urn:nbn:de:0030-drops-181281},
doi = {10.4230/LIPIcs.ICALP.2023.76},
annote = {Keywords: dimensionality reduction, hashing, concentration bounds, moment bounds}
}
@InProceedings{hsieh_et_al:LIPIcs.ICALP.2023.77,
author = {Hsieh, Jun-Ting and Kothari, Pravesh K.},
title = {{Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {77:1--77:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.77},
URN = {urn:nbn:de:0030-drops-181291},
doi = {10.4230/LIPIcs.ICALP.2023.77},
annote = {Keywords: Max-Cut, approximation algorithm, semidefinite programming}
}
@InProceedings{hsieh_et_al:LIPIcs.ICALP.2023.78,
author = {Hsieh, Jun-Ting and Kothari, Pravesh K. and Potechin, Aaron and Xu, Jeff},
title = {{Ellipsoid Fitting up to a Constant}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {78:1--78:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.78},
URN = {urn:nbn:de:0030-drops-181304},
doi = {10.4230/LIPIcs.ICALP.2023.78},
annote = {Keywords: Semidefinite programming, random matrices, average-case complexity}
}
@InProceedings{hyattdenesik_et_al:LIPIcs.ICALP.2023.79,
author = {Hyatt-Denesik, Dylan and Jabal Ameli, Afrouz and Sanit\`{a}, Laura},
title = {{Finding Almost Tight Witness Trees}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {79:1--79:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.79},
URN = {urn:nbn:de:0030-drops-181314},
doi = {10.4230/LIPIcs.ICALP.2023.79},
annote = {Keywords: Algorithms, Network Design, Approximation}
}
@InProceedings{ibrahimpur_et_al:LIPIcs.ICALP.2023.80,
author = {Ibrahimpur, Sharat and Purohit, Manish and Svitkina, Zoya and Vee, Erik and Wang, Joshua R.},
title = {{Efficient Caching with Reserves via Marking}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {80:1--80:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.80},
URN = {urn:nbn:de:0030-drops-181328},
doi = {10.4230/LIPIcs.ICALP.2023.80},
annote = {Keywords: Approximation Algorithms, Online Algorithms, Caching}
}
@InProceedings{ito_et_al:LIPIcs.ICALP.2023.81,
author = {Ito, Takehiro and Iwamasa, Yuni and Kakimura, Naonori and Kobayashi, Yusuke and Maezawa, Shun-ichi and Nozaki, Yuta and Okamoto, Yoshio and Ozeki, Kenta},
title = {{Rerouting Planar Curves and Disjoint Paths}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {81:1--81:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.81},
URN = {urn:nbn:de:0030-drops-181339},
doi = {10.4230/LIPIcs.ICALP.2023.81},
annote = {Keywords: Disjoint paths, combinatorial reconfiguration, planar graphs}
}
@InProceedings{ito_et_al:LIPIcs.ICALP.2023.82,
author = {Ito, Takehiro and Kakimura, Naonori and Kamiyama, Naoyuki and Kobayashi, Yusuke and Maezawa, Shun-ichi and Nozaki, Yuta and Okamoto, Yoshio},
title = {{Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {82:1--82:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.82},
URN = {urn:nbn:de:0030-drops-181344},
doi = {10.4230/LIPIcs.ICALP.2023.82},
annote = {Keywords: Graph associahedra, combinatorial shortest path, NP-hardness, polymatroids}
}
@InProceedings{iyer_et_al:LIPIcs.ICALP.2023.83,
author = {Iyer, Siddharth and Whitmeyer, Michael},
title = {{Searching for Regularity in Bounded Functions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {83:1--83:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.83},
URN = {urn:nbn:de:0030-drops-181351},
doi = {10.4230/LIPIcs.ICALP.2023.83},
annote = {Keywords: regularity, bounded function, Boolean function, Fourier analysis}
}
@InProceedings{karczmarz_et_al:LIPIcs.ICALP.2023.84,
author = {Karczmarz, Adam and Sankowski, Piotr},
title = {{Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {84:1--84:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.84},
URN = {urn:nbn:de:0030-drops-181363},
doi = {10.4230/LIPIcs.ICALP.2023.84},
annote = {Keywords: dynamic shortest paths, dynamic reachability, dynamic transitive closure}
}
@InProceedings{kogan_et_al:LIPIcs.ICALP.2023.85,
author = {Kogan, Shimon and Parter, Merav},
title = {{New Additive Emulators}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {85:1--85:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.85},
URN = {urn:nbn:de:0030-drops-181377},
doi = {10.4230/LIPIcs.ICALP.2023.85},
annote = {Keywords: Spanners, Emulators, Distance Preservers}
}
@InProceedings{li:LIPIcs.ICALP.2023.86,
author = {Li, Shi},
title = {{Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {86:1--86:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.86},
URN = {urn:nbn:de:0030-drops-181386},
doi = {10.4230/LIPIcs.ICALP.2023.86},
annote = {Keywords: Nearly-Linear Time, Sheduling, Approximation Algorithms}
}
@InProceedings{li_et_al:LIPIcs.ICALP.2023.87,
author = {Li, Xiantao and Wang, Chunhao},
title = {{Simulating Markovian Open Quantum Systems Using Higher-Order Series Expansion}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {87:1--87:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.87},
URN = {urn:nbn:de:0030-drops-181395},
doi = {10.4230/LIPIcs.ICALP.2023.87},
annote = {Keywords: Quantum algorithms, open quantum systems, Lindblad simulation}
}
@InProceedings{liu_et_al:LIPIcs.ICALP.2023.88,
author = {Liu, S. Cliff and Song, Zhao and Zhang, Hengjie and Zhang, Lichen and Zhou, Tianyi},
title = {{Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {88:1--88:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.88},
URN = {urn:nbn:de:0030-drops-181408},
doi = {10.4230/LIPIcs.ICALP.2023.88},
annote = {Keywords: Convex optimization, interior point method, streaming algorithm}
}
@InProceedings{liu_et_al:LIPIcs.ICALP.2023.89,
author = {Liu, Shu and Xing, Chaoping and Yuan, Chen},
title = {{List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {89:1--89:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.89},
URN = {urn:nbn:de:0030-drops-181416},
doi = {10.4230/LIPIcs.ICALP.2023.89},
annote = {Keywords: Coding theory, List-decoding, Rank-metric codes}
}
@InProceedings{lokshtanov_et_al:LIPIcs.ICALP.2023.90,
author = {Lokshtanov, Daniel and Saurabh, Saket and Surianarayanan, Vaishali},
title = {{Breaking the All Subsets Barrier for Min k-Cut}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {90:1--90:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.90},
URN = {urn:nbn:de:0030-drops-181422},
doi = {10.4230/LIPIcs.ICALP.2023.90},
annote = {Keywords: Exact algorithms, min k-cut, exponential algorithms, graph algorithms, k-way cut}
}
@InProceedings{mathieu_et_al:LIPIcs.ICALP.2023.91,
author = {Mathieu, Claire and Zhou, Hang},
title = {{A Tight (1.5+\epsilon)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {91:1--91:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.91},
URN = {urn:nbn:de:0030-drops-181430},
doi = {10.4230/LIPIcs.ICALP.2023.91},
annote = {Keywords: approximation algorithms, capacitated vehicle routing, graph algorithms, combinatorial optimization}
}
@InProceedings{mellou_et_al:LIPIcs.ICALP.2023.92,
author = {Mellou, Konstantina and Molinaro, Marco and Zhou, Rudy},
title = {{Online Demand Scheduling with Failovers}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {92:1--92:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.92},
URN = {urn:nbn:de:0030-drops-181443},
doi = {10.4230/LIPIcs.ICALP.2023.92},
annote = {Keywords: online algorithms, approximation algorithms, resource allocation}
}
@InProceedings{morelle_et_al:LIPIcs.ICALP.2023.93,
author = {Morelle, Laure and Sau, Ignasi and Stamoulis, Giannos and Thilikos, Dimitrios M.},
title = {{Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {93:1--93:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.93},
URN = {urn:nbn:de:0030-drops-181458},
doi = {10.4230/LIPIcs.ICALP.2023.93},
annote = {Keywords: Graph minors, Parameterized algorithms, Graph modification problems, Vertex deletion, Elimination distance, Irrelevant vertex technique, Flat Wall Theorem, Obstructions}
}
@InProceedings{oko_et_al:LIPIcs.ICALP.2023.94,
author = {Oko, Kazusato and Sakaue, Shinsaku and Tanigawa, Shin-ichi},
title = {{Nearly Tight Spectral Sparsification of Directed Hypergraphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {94:1--94:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.94},
URN = {urn:nbn:de:0030-drops-181469},
doi = {10.4230/LIPIcs.ICALP.2023.94},
annote = {Keywords: Spectral sparsification, (Directed) hypergraphs, Iterative sampling}
}
@InProceedings{oshman_et_al:LIPIcs.ICALP.2023.95,
author = {Oshman, Rotem and Roth, Tal},
title = {{The Communication Complexity of Set Intersection Under Product Distributions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {95:1--95:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.95},
URN = {urn:nbn:de:0030-drops-181472},
doi = {10.4230/LIPIcs.ICALP.2023.95},
annote = {Keywords: Communication complexity, intersection, set disjointness}
}
@InProceedings{peng_et_al:LIPIcs.ICALP.2023.96,
author = {Peng, Pan and Wang, Yuyang},
title = {{An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {96:1--96:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.96},
URN = {urn:nbn:de:0030-drops-181480},
doi = {10.4230/LIPIcs.ICALP.2023.96},
annote = {Keywords: Graph property testing, Directed graphs, Lower bound, Subgraph-freeness}
}
@InProceedings{qin_et_al:LIPIcs.ICALP.2023.97,
author = {Qin, Minglong and Yao, Penghui},
title = {{Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {97:1--97:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.97},
URN = {urn:nbn:de:0030-drops-181499},
doi = {10.4230/LIPIcs.ICALP.2023.97},
annote = {Keywords: Fully quantum nonlocal games, Fourier analysis, Dimension reduction}
}
@InProceedings{rajaraman_et_al:LIPIcs.ICALP.2023.98,
author = {Rajaraman, Rajmohan and Stalfa, David and Yang, Sheng},
title = {{Scheduling Under Non-Uniform Job and Machine Delays}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {98:1--98:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.98},
URN = {urn:nbn:de:0030-drops-181502},
doi = {10.4230/LIPIcs.ICALP.2023.98},
annote = {Keywords: Scheduling, Approximation Algorithms, Precedence Constraints, Communication Delay, Non-Uniform Delays}
}
@InProceedings{resch_et_al:LIPIcs.ICALP.2023.99,
author = {Resch, Nicolas and Yuan, Chen and Zhang, Yihan},
title = {{Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {99:1--99:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.99},
URN = {urn:nbn:de:0030-drops-181518},
doi = {10.4230/LIPIcs.ICALP.2023.99},
annote = {Keywords: Coding theory, List-decoding, List-recovery, Zero-rate thresholds}
}
@InProceedings{rivals_et_al:LIPIcs.ICALP.2023.100,
author = {Rivals, Eric and Sweering, Michelle and Wang, Pengfei},
title = {{Convergence of the Number of Period Sets in Strings}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {100:1--100:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.100},
URN = {urn:nbn:de:0030-drops-181527},
doi = {10.4230/LIPIcs.ICALP.2023.100},
annote = {Keywords: Autocorrelation, period, border, combinatorics, correlation, periodicity, upper bound, asymptotic convergence}
}
@InProceedings{roberson_et_al:LIPIcs.ICALP.2023.101,
author = {Roberson, David E. and Seppelt, Tim},
title = {{Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {101:1--101:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.101},
URN = {urn:nbn:de:0030-drops-181531},
doi = {10.4230/LIPIcs.ICALP.2023.101},
annote = {Keywords: Lasserre hierarchy, homomorphism indistinguishability, Sherali-Adams hierarchy, treewidth, semidefinite programming, linear programming, graph isomorphism}
}
@InProceedings{rubinstein:LIPIcs.ICALP.2023.102,
author = {Rubinstein, Ittai},
title = {{Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction Problem}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {102:1--102:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.102},
URN = {urn:nbn:de:0030-drops-181542},
doi = {10.4230/LIPIcs.ICALP.2023.102},
annote = {Keywords: Trace Reconstruction, Synchronization Channels, Computational Learning Theory, Computational Biology}
}
@InProceedings{sauerwald_et_al:LIPIcs.ICALP.2023.103,
author = {Sauerwald, Thomas and Sun, He and Vagnozzi, Danny},
title = {{The Support of Open Versus Closed Random Walks}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {103:1--103:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.103},
URN = {urn:nbn:de:0030-drops-181556},
doi = {10.4230/LIPIcs.ICALP.2023.103},
annote = {Keywords: support of random walks, eigenvalue multiplicity}
}
@InProceedings{terao:LIPIcs.ICALP.2023.104,
author = {Terao, Tatsuya},
title = {{Faster Matroid Partition Algorithms}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {104:1--104:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.104},
URN = {urn:nbn:de:0030-drops-181566},
doi = {10.4230/LIPIcs.ICALP.2023.104},
annote = {Keywords: Matroid Partition, Matroid Union, Combinatorial Optimization}
}
@InProceedings{touitou:LIPIcs.ICALP.2023.105,
author = {Touitou, Noam},
title = {{Frameworks for Nonclairvoyant Network Design with Deadlines or Delay}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {105:1--105:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.105},
URN = {urn:nbn:de:0030-drops-181578},
doi = {10.4230/LIPIcs.ICALP.2023.105},
annote = {Keywords: Online, Deadlines, Delay, Network Design, Nonclairvoyant}
}
@InProceedings{wlodarczyk:LIPIcs.ICALP.2023.106,
author = {W{\l}odarczyk, Micha{\l}},
title = {{Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {106:1--106:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.106},
URN = {urn:nbn:de:0030-drops-181585},
doi = {10.4230/LIPIcs.ICALP.2023.106},
annote = {Keywords: fixed-parameter tractability, treewidth, chordal graphs, interval graphs, matroids, representative families}
}
@InProceedings{zamir:LIPIcs.ICALP.2023.107,
author = {Zamir, Or},
title = {{The Wrong Direction of Jensen’s Inequality Is Algorithmically Right}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {107:1--107:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.107},
URN = {urn:nbn:de:0030-drops-181593},
doi = {10.4230/LIPIcs.ICALP.2023.107},
annote = {Keywords: algorithms, complexity, Jensen’s inequality}
}
@InProceedings{zhang_et_al:LIPIcs.ICALP.2023.108,
author = {Zhang, Ruizhe and Zhang, Xinzhi},
title = {{A Hyperbolic Extension of Kadison-Singer Type Results}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {108:1--108:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.108},
URN = {urn:nbn:de:0030-drops-181606},
doi = {10.4230/LIPIcs.ICALP.2023.108},
annote = {Keywords: Kadison-Singer conjecture, Hyperbolic polynomials, Strongly-Rayleigh distributions, Interlacing polynomials}
}
@InProceedings{aburadi_et_al:LIPIcs.ICALP.2023.109,
author = {Abu Radi, Bader and Kupferman, Orna},
title = {{On Semantically-Deterministic Automata}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {109:1--109:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.109},
URN = {urn:nbn:de:0030-drops-181610},
doi = {10.4230/LIPIcs.ICALP.2023.109},
annote = {Keywords: Automata on infinite words, Nondeterminism, Succinctness, Decision procedures}
}
@InProceedings{baumann_et_al:LIPIcs.ICALP.2023.110,
author = {Baumann, Pascal and Ganardi, Moses and Majumdar, Rupak and Thinniyam, Ramanathan S. and Zetzsche, Georg},
title = {{Checking Refinement of Asynchronous Programs Against Context-Free Specifications}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {110:1--110:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.110},
URN = {urn:nbn:de:0030-drops-181622},
doi = {10.4230/LIPIcs.ICALP.2023.110},
annote = {Keywords: Asynchronous programs, VASS, Dyck languages, Language inclusion, Refinement verification}
}
@InProceedings{bednarczyk_et_al:LIPIcs.ICALP.2023.111,
author = {Bednarczyk, Bartosz and Kojelis, Daumantas and Pratt-Hartmann, Ian},
title = {{On the Limits of Decision: the Adjacent Fragment of First-Order Logic}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {111:1--111:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.111},
URN = {urn:nbn:de:0030-drops-181632},
doi = {10.4230/LIPIcs.ICALP.2023.111},
annote = {Keywords: decidability, satisfiability, variable-ordered logics, complexity}
}
@InProceedings{benedikt_et_al:LIPIcs.ICALP.2023.112,
author = {Benedikt, Michael and Chistikov, Dmitry and Mansutti, Alessio},
title = {{The Complexity of Presburger Arithmetic with Power or Powers}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {112:1--112:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.112},
URN = {urn:nbn:de:0030-drops-181641},
doi = {10.4230/LIPIcs.ICALP.2023.112},
annote = {Keywords: arithmetic theories, exponentiation, decision procedures}
}
@InProceedings{berkholz_et_al:LIPIcs.ICALP.2023.113,
author = {Berkholz, Christoph and Vinall-Smeeth, Harry},
title = {{A Dichotomy for Succinct Representations of Homomorphisms}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {113:1--113:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.113},
URN = {urn:nbn:de:0030-drops-181653},
doi = {10.4230/LIPIcs.ICALP.2023.113},
annote = {Keywords: homomorphism problem, CSP, succinct representations, enumeration, lower bound, treewidth}
}
@InProceedings{birkmann_et_al:LIPIcs.ICALP.2023.114,
author = {Birkmann, Fabian and Milius, Stefan and Urbat, Henning},
title = {{Nominal Topology for Data Languages}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {114:1--114:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.114},
URN = {urn:nbn:de:0030-drops-181662},
doi = {10.4230/LIPIcs.ICALP.2023.114},
annote = {Keywords: Nominal sets, Stone duality, Profinite space, Data languages}
}
@InProceedings{blondin_et_al:LIPIcs.ICALP.2023.115,
author = {Blondin, Michael and Ladouceur, Fran\c{c}ois},
title = {{Population Protocols with Unordered Data}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {115:1--115:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.115},
URN = {urn:nbn:de:0030-drops-181673},
doi = {10.4230/LIPIcs.ICALP.2023.115},
annote = {Keywords: Population protocols, unordered data, colored Petri nets}
}
@InProceedings{bodirsky_et_al:LIPIcs.ICALP.2023.116,
author = {Bodirsky, Manuel and Kn\"{a}uer, Simon},
title = {{Network Satisfaction Problems Solved by k-Consistency}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {116:1--116:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.116},
URN = {urn:nbn:de:0030-drops-181680},
doi = {10.4230/LIPIcs.ICALP.2023.116},
annote = {Keywords: Constraint Satisfaction, Computational Complexity, Relation Algebras, Network Satisfaction, Qualitative Reasoning, k-Consistency, Datalog}
}
@InProceedings{bojanczyk_et_al:LIPIcs.ICALP.2023.117,
author = {Boja\'{n}czyk, Miko{\l}aj and Nguy\~{ê}n, L\^{e} Th\`{a}nh D\~{u}ng (Tito)},
title = {{Algebraic Recognition of Regular Functions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {117:1--117:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.117},
URN = {urn:nbn:de:0030-drops-181697},
doi = {10.4230/LIPIcs.ICALP.2023.117},
annote = {Keywords: string transducers, semigroups, category theory}
}
@InProceedings{bouyer_et_al:LIPIcs.ICALP.2023.118,
author = {Bouyer, Patricia and Fijalkow, Nathana\"{e}l and Randour, Mickael and Vandenhove, Pierre},
title = {{How to Play Optimally for Regular Objectives?}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {118:1--118:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.118},
URN = {urn:nbn:de:0030-drops-181700},
doi = {10.4230/LIPIcs.ICALP.2023.118},
annote = {Keywords: two-player games on graphs, strategy complexity, regular languages, finite-memory strategies, NP-completeness}
}
@InProceedings{braunfeld_et_al:LIPIcs.ICALP.2023.119,
author = {Braunfeld, Samuel and Dawar, Anuj and Eleftheriadis, Ioannis and Papadopoulos, Aris},
title = {{Monadic NIP in Monotone Classes of Relational Structures}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {119:1--119:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.119},
URN = {urn:nbn:de:0030-drops-181712},
doi = {10.4230/LIPIcs.ICALP.2023.119},
annote = {Keywords: Model theory, finite model theory, structural graph theory, model-checking}
}
@InProceedings{carette_et_al:LIPIcs.ICALP.2023.120,
author = {Carette, Titouan and Moutot, Etienne and Perez, Thomas and Vilmart, Renaud},
title = {{Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {120:1--120:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.120},
URN = {urn:nbn:de:0030-drops-181726},
doi = {10.4230/LIPIcs.ICALP.2023.120},
annote = {Keywords: Perfect Matchings Counting, Quantum Computing, Matchgates, ZW-Calculus, String Diagrams, Completeness}
}
@InProceedings{carton_et_al:LIPIcs.ICALP.2023.121,
author = {Carton, Olivier and Dou\'{e}neau-Tabot, Ga\"{e}tan and Filiot, Emmanuel and Winter, Sarah},
title = {{Deterministic Regular Functions of Infinite Words}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {121:1--121:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.121},
URN = {urn:nbn:de:0030-drops-181733},
doi = {10.4230/LIPIcs.ICALP.2023.121},
annote = {Keywords: infinite words, streaming string transducers, two-way transducers, monadic second-order logic, look-aheads, factorization forests}
}
@InProceedings{casares_et_al:LIPIcs.ICALP.2023.122,
author = {Casares, Antonio and Ohlmann, Pierre},
title = {{Characterising Memory in Infinite Games}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {122:1--122:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.122},
URN = {urn:nbn:de:0030-drops-181740},
doi = {10.4230/LIPIcs.ICALP.2023.122},
annote = {Keywords: Infinite duration games, Memory, Universal graphs}
}
@InProceedings{chakraborty_et_al:LIPIcs.ICALP.2023.123,
author = {Chakraborty, Diptarka and Chakraborty, Sourav and Kumar, Gunjan and Meel, Kuldeep S.},
title = {{Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {123:1--123:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.123},
URN = {urn:nbn:de:0030-drops-181750},
doi = {10.4230/LIPIcs.ICALP.2023.123},
annote = {Keywords: Model counting, Approximation, Satisfiability, NP oracle, SAT oracle}
}
@InProceedings{dong:LIPIcs.ICALP.2023.124,
author = {Dong, Ruiwen},
title = {{The Identity Problem in \mathbb{Z} ≀ \mathbb{Z} Is Decidable}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {124:1--124:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.124},
URN = {urn:nbn:de:0030-drops-181768},
doi = {10.4230/LIPIcs.ICALP.2023.124},
annote = {Keywords: wreath product, algorithmic group theory, identity problem, polynomial semiring, positive coefficients}
}
@InProceedings{dreier_et_al:LIPIcs.ICALP.2023.125,
author = {Dreier, Jan and M\"{a}hlmann, Nikolas and Siebertz, Sebastian and Toru\'{n}czyk, Szymon},
title = {{Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {125:1--125:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.125},
URN = {urn:nbn:de:0030-drops-181779},
doi = {10.4230/LIPIcs.ICALP.2023.125},
annote = {Keywords: stability, NIP, combinatorial characterization, first-order model checking}
}
@InProceedings{esparza_et_al:LIPIcs.ICALP.2023.126,
author = {Esparza, Javier and Grande, Vincent P.},
title = {{Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {126:1--126:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.126},
URN = {urn:nbn:de:0030-drops-181785},
doi = {10.4230/LIPIcs.ICALP.2023.126},
annote = {Keywords: Partially observable Markov chains, \omega-regular properties, black-box testing}
}
@InProceedings{fan_et_al:LIPIcs.ICALP.2023.127,
author = {Fan, Austen Z. and Koutris, Paraschos and Zhao, Hangdong},
title = {{The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {127:1--127:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.127},
URN = {urn:nbn:de:0030-drops-181791},
doi = {10.4230/LIPIcs.ICALP.2023.127},
annote = {Keywords: Fine-grained complexity, conjunctive queries, semiring-oblivious reduction}
}
@InProceedings{gajarsky_et_al:LIPIcs.ICALP.2023.128,
author = {Gajarsk\'{y}, Jakub and M\"{a}hlmann, Nikolas and McCarty, Rose and Ohlmann, Pierre and Pilipczuk, Micha{\l} and Przybyszewski, Wojciech and Siebertz, Sebastian and Soko{\l}owski, Marek and Toru\'{n}czyk, Szymon},
title = {{Flipper Games for Monadically Stable Graph Classes}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {128:1--128:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.128},
URN = {urn:nbn:de:0030-drops-181804},
doi = {10.4230/LIPIcs.ICALP.2023.128},
annote = {Keywords: Stability theory, structural graph theory, games}
}
@InProceedings{henzinger_et_al:LIPIcs.ICALP.2023.129,
author = {Henzinger, Thomas A. and Kebis, Pavol and Mazzocchi, Nicolas and Sara\c{c}, N. Ege},
title = {{Regular Methods for Operator Precedence Languages}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {129:1--129:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.129},
URN = {urn:nbn:de:0030-drops-181814},
doi = {10.4230/LIPIcs.ICALP.2023.129},
annote = {Keywords: operator precedence automata, syntactic congruence, antichain algorithm}
}
@InProceedings{kenison_et_al:LIPIcs.ICALP.2023.130,
author = {Kenison, George and Nieuwveld, Joris and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{Positivity Problems for Reversible Linear Recurrence Sequences}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {130:1--130:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.130},
URN = {urn:nbn:de:0030-drops-181821},
doi = {10.4230/LIPIcs.ICALP.2023.130},
annote = {Keywords: The Positivity Problem, Linear Recurrence Sequences, Verification}
}
@InProceedings{kunnemann_et_al:LIPIcs.ICALP.2023.131,
author = {K\"{u}nnemann, Marvin and Mazowiecki, Filip and Sch\"{u}tze, Lia and Sinclair-Banks, Henry and W\k{e}grzycki, Karol},
title = {{Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {131:1--131:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.131},
URN = {urn:nbn:de:0030-drops-181834},
doi = {10.4230/LIPIcs.ICALP.2023.131},
annote = {Keywords: Vector Addition System, Coverability, Reachability, Fine-Grained Complexity, Exponential Time Hypothesis, k-Cycle Hypothesis, Hyperclique Hypothesis}
}
@InProceedings{lampis:LIPIcs.ICALP.2023.132,
author = {Lampis, Michael},
title = {{First Order Logic on Pathwidth Revisited Again}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {132:1--132:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.132},
URN = {urn:nbn:de:0030-drops-181848},
doi = {10.4230/LIPIcs.ICALP.2023.132},
annote = {Keywords: Algorithmic Meta-Theorems, FO logic, Pathwidth}
}
@InProceedings{lichter:LIPIcs.ICALP.2023.133,
author = {Lichter, Moritz},
title = {{Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {133:1--133:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.133},
URN = {urn:nbn:de:0030-drops-181858},
doi = {10.4230/LIPIcs.ICALP.2023.133},
annote = {Keywords: witnessed symmetric choice, interpretation, fixed-point logic, counting, CFI graphs, logic for PTime}
}
@InProceedings{lohrey_et_al:LIPIcs.ICALP.2023.134,
author = {Lohrey, Markus and Rosowski, Andreas},
title = {{On the Complexity of Diameter and Related Problems in Permutation Groups}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {134:1--134:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.134},
URN = {urn:nbn:de:0030-drops-181864},
doi = {10.4230/LIPIcs.ICALP.2023.134},
annote = {Keywords: algorithms for finite groups, diameter of permutation groups, rational subsets in groups}
}
@InProceedings{ohlmann_et_al:LIPIcs.ICALP.2023.135,
author = {Ohlmann, Pierre and Pilipczuk, Micha{\l} and Przybyszewski, Wojciech and Toru\'{n}czyk, Szymon},
title = {{Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {135:1--135:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.135},
URN = {urn:nbn:de:0030-drops-181874},
doi = {10.4230/LIPIcs.ICALP.2023.135},
annote = {Keywords: Model Theory, Stability Theory, Shrubdepth, Nowhere Dense, Monadically Stable}
}
@InProceedings{rozowski_et_al:LIPIcs.ICALP.2023.136,
author = {R\'{o}\.{z}owski, Wojciech and Kapp\'{e}, Tobias and Kozen, Dexter and Schmid, Todd and Silva, Alexandra},
title = {{Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {136:1--136:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.136},
URN = {urn:nbn:de:0030-drops-181880},
doi = {10.4230/LIPIcs.ICALP.2023.136},
annote = {Keywords: Kleene Algebra with Tests, program equivalence, completeness, coalgebra}
}
@InProceedings{vaandrager_et_al:LIPIcs.ICALP.2023.137,
author = {Vaandrager, Frits and Wi{\ss}mann, Thorsten},
title = {{Action Codes}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {137:1--137:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.137},
URN = {urn:nbn:de:0030-drops-181895},
doi = {10.4230/LIPIcs.ICALP.2023.137},
annote = {Keywords: Automata, Models of Reactive Systems, LTS, Action Codes, Action Refinement, Action Contraction, Galois Connection, Model-Based Testing, Model Learning}
}
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