<h2>LIPIcs, Volume 297, ICALP 2024</h2>
<ul>
<li>
<span class="authors">Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson</span>
<span class="title">LIPIcs, Volume 297, ICALP 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024">10.4230/LIPIcs.ICALP.2024</a>
</li>
<li>
<span class="authors">Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.0">10.4230/LIPIcs.ICALP.2024.0</a>
</li>
<li>
<span class="authors">Anuj Dawar</span>
<span class="title">Limits of Symmetric Computation (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.1">10.4230/LIPIcs.ICALP.2024.1</a>
</li>
<li>
<span class="authors">Edith Elkind</span>
<span class="title">Group Fairness: Multiwinner Voting and Beyond (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.2">10.4230/LIPIcs.ICALP.2024.2</a>
</li>
<li>
<span class="authors">Danupon Nanongkai</span>
<span class="title">Cross-Paradigm Graph Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.3">10.4230/LIPIcs.ICALP.2024.3</a>
</li>
<li>
<span class="authors">Merav Parter</span>
<span class="title">Graphs Shortcuts: New Bounds and Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.4">10.4230/LIPIcs.ICALP.2024.4</a>
</li>
<li>
<span class="authors">Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jarosław Byrka, Fabrizio Grandoni, Krzysztof Sornat, and Antoine Tinguely</span>
<span class="title">An O(loglog n)-Approximation for Submodular Facility Location</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.5">10.4230/LIPIcs.ICALP.2024.5</a>
</li>
<li>
<span class="authors">Fateme Abbasi, Sandip Banerjee, Jarosław Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, and Joachim Spoerhase</span>
<span class="title">Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.6">10.4230/LIPIcs.ICALP.2024.6</a>
</li>
<li>
<span class="authors">Elie Abboud and Noga Ron-Zewi</span>
<span class="title">Finer-Grained Reductions in Fine-Grained Hardness of Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.7">10.4230/LIPIcs.ICALP.2024.7</a>
</li>
<li>
<span class="authors">Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, and Andreas Wiese</span>
<span class="title">Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.8">10.4230/LIPIcs.ICALP.2024.8</a>
</li>
<li>
<span class="authors">Shyan Akmal, Virginia Vassilevska Williams, and Nicole Wein</span>
<span class="title">Detecting Disjoint Shortest Paths in Linear Time and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.9">10.4230/LIPIcs.ICALP.2024.9</a>
</li>
<li>
<span class="authors">Emile Anand, Jan van den Brand, Mehrdad Ghadiri, and Daniel J. Zhang</span>
<span class="title">The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.10">10.4230/LIPIcs.ICALP.2024.10</a>
</li>
<li>
<span class="authors">Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, and Jiaheng Wang</span>
<span class="title">Approximate Counting for Spin Systems in Sub-Quadratic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.11">10.4230/LIPIcs.ICALP.2024.11</a>
</li>
<li>
<span class="authors">Noel Arteche, Erfan Khaniki, Ján Pich, and Rahul Santhanam</span>
<span class="title">From Proof Complexity to Circuit Complexity via Interactive Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.12">10.4230/LIPIcs.ICALP.2024.12</a>
</li>
<li>
<span class="authors">Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, and Carlos Palazuelos</span>
<span class="title">Learning Low-Degree Quantum Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.13">10.4230/LIPIcs.ICALP.2024.13</a>
</li>
<li>
<span class="authors">Vikraman Arvind and Pushkar S. Joglekar</span>
<span class="title">A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.14">10.4230/LIPIcs.ICALP.2024.14</a>
</li>
<li>
<span class="authors">Yossi Azar, Shahar Lewkowicz, and Danny Vainstein</span>
<span class="title">List Update with Delays or Time Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.15">10.4230/LIPIcs.ICALP.2024.15</a>
</li>
<li>
<span class="authors">Omkar Baraskar, Agrim Dewan, Chandan Saha, and Pulkit Sinha</span>
<span class="title">NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.16">10.4230/LIPIcs.ICALP.2024.16</a>
</li>
<li>
<span class="authors">Surender Baswana and Koustav Bhanja</span>
<span class="title">Vital Edges for (s,t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.17">10.4230/LIPIcs.ICALP.2024.17</a>
</li>
<li>
<span class="authors">MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, and Jakub Łącki</span>
<span class="title">It’s Hard to HAC Average Linkage!</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.18">10.4230/LIPIcs.ICALP.2024.18</a>
</li>
<li>
<span class="authors">Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, and Amin Saberi</span>
<span class="title">Sublinear Algorithms for TSP via Path Covers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.19">10.4230/LIPIcs.ICALP.2024.19</a>
</li>
<li>
<span class="authors">Djamal Belazzougui, Gregory Kucherov, and Stefan Walzer</span>
<span class="title">Better Space-Time-Robustness Trade-Offs for Set Reconciliation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.20">10.4230/LIPIcs.ICALP.2024.20</a>
</li>
<li>
<span class="authors">Shalev Ben-David and Srijita Kundu</span>
<span class="title">Oracle Separation of QMA and QCMA with Bounded Adaptivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.21">10.4230/LIPIcs.ICALP.2024.21</a>
</li>
<li>
<span class="authors">Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, and Tuukka Korhonen</span>
<span class="title">Two-Sets Cut-Uncut on Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.22">10.4230/LIPIcs.ICALP.2024.22</a>
</li>
<li>
<span class="authors">Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, and Shubhang Kulkarni</span>
<span class="title">Splitting-Off in Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.23">10.4230/LIPIcs.ICALP.2024.23</a>
</li>
<li>
<span class="authors">Somnath Bhattacharjee, Markus Bläser, Pranjal Dutta, and Saswata Mukherjee</span>
<span class="title">Exponential Lower Bounds via Exponential Sums</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.24">10.4230/LIPIcs.ICALP.2024.24</a>
</li>
<li>
<span class="authors">Chiranjib Bhattacharyya, Ravindran Kannan, and Amit Kumar</span>
<span class="title">Random Separating Hyperplane Theorem and Learning Polytopes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.25">10.4230/LIPIcs.ICALP.2024.25</a>
</li>
<li>
<span class="authors">Andreas Björklund, Petteri Kaski, and Jesper Nederlof</span>
<span class="title">Another Hamiltonian Cycle in Bipartite Pfaffian Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.26">10.4230/LIPIcs.ICALP.2024.26</a>
</li>
<li>
<span class="authors">Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, and Chen Wang</span>
<span class="title">The Discrepancy of Shortest Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.27">10.4230/LIPIcs.ICALP.2024.27</a>
</li>
<li>
<span class="authors">Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, and Zixuan Xu</span>
<span class="title">Additive Spanner Lower Bounds with Optimal Inner Graph Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.28">10.4230/LIPIcs.ICALP.2024.28</a>
</li>
<li>
<span class="authors">Narek Bojikian and Stefan Kratsch</span>
<span class="title">A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.29">10.4230/LIPIcs.ICALP.2024.29</a>
</li>
<li>
<span class="authors">Itai Boneh, Shay Golan, Shay Mozes, and Oren Weimann</span>
<span class="title">Õptimal Dynamic Time Warping on Run-Length Encoded Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.30">10.4230/LIPIcs.ICALP.2024.30</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, and Maksim Zhukovskii</span>
<span class="title">Tight Bounds on Adjacency Labels for Monotone Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.31">10.4230/LIPIcs.ICALP.2024.31</a>
</li>
<li>
<span class="authors">Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, and Simon Weber</span>
<span class="title">Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.32">10.4230/LIPIcs.ICALP.2024.32</a>
</li>
<li>
<span class="authors">Marin Bougeret, Bart M. P. Jansen, and Ignasi Sau</span>
<span class="title">Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.33">10.4230/LIPIcs.ICALP.2024.33</a>
</li>
<li>
<span class="authors">Barış Can Esmer, Jacob Focke, Dániel Marx, and Paweł Rzążewski</span>
<span class="title">Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.34">10.4230/LIPIcs.ICALP.2024.34</a>
</li>
<li>
<span class="authors">Charlie Carlson, Ewan Davies, Alexandra Kolla, and Aditya Potukuchi</span>
<span class="title">A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.35">10.4230/LIPIcs.ICALP.2024.35</a>
</li>
<li>
<span class="authors">Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, and Stéphan Thomassé</span>
<span class="title">Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.36">10.4230/LIPIcs.ICALP.2024.36</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Tomer Even, and Virginia Vassilevska Williams</span>
<span class="title">Fast Approximate Counting of Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.37">10.4230/LIPIcs.ICALP.2024.37</a>
</li>
<li>
<span class="authors">Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, and Sorrachai Yingchareonthawornchai</span>
<span class="title">The Group Access Bounds for Binary Search Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.38">10.4230/LIPIcs.ICALP.2024.38</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Paweł Gawrychowski, and Samah Ghazawi</span>
<span class="title">Optimal Bounds for Distinct Quartics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.39">10.4230/LIPIcs.ICALP.2024.39</a>
</li>
<li>
<span class="authors">Shiri Chechik, Doron Mukhtar, and Tianyi Zhang</span>
<span class="title">Streaming Edge Coloring with Subquadratic Palette Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.40">10.4230/LIPIcs.ICALP.2024.40</a>
</li>
<li>
<span class="authors">Shiri Chechik and Tianyi Zhang</span>
<span class="title">Faster Algorithms for Dual-Failure Replacement Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.41">10.4230/LIPIcs.ICALP.2024.41</a>
</li>
<li>
<span class="authors">Shiri Chechik and Tianyi Zhang</span>
<span class="title">Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.42">10.4230/LIPIcs.ICALP.2024.42</a>
</li>
<li>
<span class="authors">Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, and Adrian Vetta</span>
<span class="title">Robot Positioning Using Torus Packing for Multisets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.43">10.4230/LIPIcs.ICALP.2024.43</a>
</li>
<li>
<span class="authors">Junjie Chen, Minming Li, Haifeng Xu, and Song Zuo</span>
<span class="title">Bayesian Calibrated Click-Through Auctions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.44">10.4230/LIPIcs.ICALP.2024.44</a>
</li>
<li>
<span class="authors">Li Chen and Mingquan Ye</span>
<span class="title">High-Accuracy Multicommodity Flows via Iterative Refinement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.45">10.4230/LIPIcs.ICALP.2024.45</a>
</li>
<li>
<span class="authors">Yu Chen, Michael Kapralov, Mikhail Makarov, and Davide Mazzali</span>
<span class="title">On the Streaming Complexity of Expander Decomposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.46">10.4230/LIPIcs.ICALP.2024.46</a>
</li>
<li>
<span class="authors">Yu Chen and Zihan Tan</span>
<span class="title">Lower Bounds on 0-Extension with Steiner Nodes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.47">10.4230/LIPIcs.ICALP.2024.47</a>
</li>
<li>
<span class="authors">Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, and Giovanna Varricchio</span>
<span class="title">Solving Woeginger’s Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.48">10.4230/LIPIcs.ICALP.2024.48</a>
</li>
<li>
<span class="authors">Mónika Csikós and Nabil H. Mustafa</span>
<span class="title">An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.49">10.4230/LIPIcs.ICALP.2024.49</a>
</li>
<li>
<span class="authors">Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý</span>
<span class="title">Fully-Scalable MPC Algorithms for Clustering in High Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.50">10.4230/LIPIcs.ICALP.2024.50</a>
</li>
<li>
<span class="authors">Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Martin Milanič</span>
<span class="title">Computing Tree Decompositions with Small Independence Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.51">10.4230/LIPIcs.ICALP.2024.51</a>
</li>
<li>
<span class="authors">Sami Davies, Benjamin Moseley, and Heather Newman</span>
<span class="title">Simultaneously Approximating All 𝓁_p-Norms in Correlation Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.52">10.4230/LIPIcs.ICALP.2024.52</a>
</li>
<li>
<span class="authors">Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, and M. S. Ramanujan</span>
<span class="title">Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.53">10.4230/LIPIcs.ICALP.2024.53</a>
</li>
<li>
<span class="authors">Holger Dell, John Lapinskas, and Kitty Meeks</span>
<span class="title">Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.54">10.4230/LIPIcs.ICALP.2024.54</a>
</li>
<li>
<span class="authors">Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, and William K. Moses Jr.</span>
<span class="title">Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.55">10.4230/LIPIcs.ICALP.2024.55</a>
</li>
<li>
<span class="authors">Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai</span>
<span class="title">Lower Bounds for Matroid Optimization Problems with a Linear Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.56">10.4230/LIPIcs.ICALP.2024.56</a>
</li>
<li>
<span class="authors">Ilan Doron-Arad and Joseph (Seffi) Naor</span>
<span class="title">Non-Linear Paging</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.57">10.4230/LIPIcs.ICALP.2024.57</a>
</li>
<li>
<span class="authors">Michal Dory, Sebastian Forster, Yasamin Nazari, and Tijn de Vos</span>
<span class="title">New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.58">10.4230/LIPIcs.ICALP.2024.58</a>
</li>
<li>
<span class="authors">Aditi Dudeja</span>
<span class="title">Decremental Matching in General Weighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.59">10.4230/LIPIcs.ICALP.2024.59</a>
</li>
<li>
<span class="authors">Talya Eden, Reut Levi, and Dana Ron</span>
<span class="title">Testing C_k-Freeness in Bounded-Arboricity Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.60">10.4230/LIPIcs.ICALP.2024.60</a>
</li>
<li>
<span class="authors">Andreas Emil Feldmann and Michael Lampis</span>
<span class="title">Parameterized Algorithms for Steiner Forest in Bounded Width Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.61">10.4230/LIPIcs.ICALP.2024.61</a>
</li>
<li>
<span class="authors">Weiming Feng and Heng Guo</span>
<span class="title">An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.62">10.4230/LIPIcs.ICALP.2024.62</a>
</li>
<li>
<span class="authors">Yuda Feng and Shi Li</span>
<span class="title">A Note on Approximating Weighted Nash Social Welfare with Additive Valuations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.63">10.4230/LIPIcs.ICALP.2024.63</a>
</li>
<li>
<span class="authors">Nick Fischer and Leo Wennmann</span>
<span class="title">Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.64">10.4230/LIPIcs.ICALP.2024.64</a>
</li>
<li>
<span class="authors">Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, and Sushant Sachdeva</span>
<span class="title">Optimal Electrical Oblivious Routing on Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.65">10.4230/LIPIcs.ICALP.2024.65</a>
</li>
<li>
<span class="authors">Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale</span>
<span class="title">Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.66">10.4230/LIPIcs.ICALP.2024.66</a>
</li>
<li>
<span class="authors">Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, and Roohani Sharma</span>
<span class="title">Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.67">10.4230/LIPIcs.ICALP.2024.67</a>
</li>
<li>
<span class="authors">Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, and Mateusz Rychlicki</span>
<span class="title">A Tight Subexponential-Time Algorithm for Two-Page Book Embedding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.68">10.4230/LIPIcs.ICALP.2024.68</a>
</li>
<li>
<span class="authors">Serge Gaspers and Jerry Zirui Li</span>
<span class="title">Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.69">10.4230/LIPIcs.ICALP.2024.69</a>
</li>
<li>
<span class="authors">Sevag Gharibian and Jonas Kamminga</span>
<span class="title">BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.70">10.4230/LIPIcs.ICALP.2024.70</a>
</li>
<li>
<span class="authors">Prantar Ghosh and Manuel Stoeckl</span>
<span class="title">Low-Memory Algorithms for Online Edge Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.71">10.4230/LIPIcs.ICALP.2024.71</a>
</li>
<li>
<span class="authors">Yiannis Giannakopoulos, Alexander Grosz, and Themistoklis Melissourgos</span>
<span class="title">On the Smoothed Complexity of Combinatorial Local Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.72">10.4230/LIPIcs.ICALP.2024.72</a>
</li>
<li>
<span class="authors">Matan Gilboa</span>
<span class="title">A Characterization of Complexity in Public Goods Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.73">10.4230/LIPIcs.ICALP.2024.73</a>
</li>
<li>
<span class="authors">Guy Goldberg</span>
<span class="title">Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.74">10.4230/LIPIcs.ICALP.2024.74</a>
</li>
<li>
<span class="authors">Lucas Gretta and Eric Price</span>
<span class="title">Sharp Noisy Binary Search with Monotonic Probabilities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.75">10.4230/LIPIcs.ICALP.2024.75</a>
</li>
<li>
<span class="authors">Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, and Sebastian Siebertz</span>
<span class="title">Solution Discovery via Reconfiguration for Problems in P</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.76">10.4230/LIPIcs.ICALP.2024.76</a>
</li>
<li>
<span class="authors">Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, and Paweł Rzążewski</span>
<span class="title">Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.77">10.4230/LIPIcs.ICALP.2024.77</a>
</li>
<li>
<span class="authors">Martin Grohe and Daniel Neuen</span>
<span class="title">Isomorphism for Tournaments of Small Twin Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.78">10.4230/LIPIcs.ICALP.2024.78</a>
</li>
<li>
<span class="authors">Leonid Gurvits, Nathan Klein, and Jonathan Leake</span>
<span class="title">From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.79">10.4230/LIPIcs.ICALP.2024.79</a>
</li>
<li>
<span class="authors">Mohammad T. HajiAghayi, Dariusz R. Kowalski, and Jan Olkowski</span>
<span class="title">Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.80">10.4230/LIPIcs.ICALP.2024.80</a>
</li>
<li>
<span class="authors">Sariel Har-Peled, Elfarouk Harb, and Vasilis Livanos</span>
<span class="title">Oracle-Augmented Prophet Inequalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.81">10.4230/LIPIcs.ICALP.2024.81</a>
</li>
<li>
<span class="authors">Hamed Hatami, Kaave Hosseini, Shachar Lovett, and Anthony Ostuni</span>
<span class="title">Refuting Approaches to the Log-Rank Conjecture for XOR Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.82">10.4230/LIPIcs.ICALP.2024.82</a>
</li>
<li>
<span class="authors">Klaus Heeger, Danny Hermelin, Matthias Mnich, and Dvir Shabtay</span>
<span class="title">No Polynomial Kernels for Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.83">10.4230/LIPIcs.ICALP.2024.83</a>
</li>
<li>
<span class="authors">Sophia Heimann, Hung P. Hoang, and Stefan Hougardy</span>
<span class="title">The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.84">10.4230/LIPIcs.ICALP.2024.84</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and Naoto Ohsaka</span>
<span class="title">Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.85">10.4230/LIPIcs.ICALP.2024.85</a>
</li>
<li>
<span class="authors">Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, and Tamás Schwarcz</span>
<span class="title">Problems on Group-Labeled Matroid Bases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.86">10.4230/LIPIcs.ICALP.2024.86</a>
</li>
<li>
<span class="authors">Kevin Hua, Daniel Li, Jaewoo Park, and Thatchaphol Saranurak</span>
<span class="title">Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.87">10.4230/LIPIcs.ICALP.2024.87</a>
</li>
<li>
<span class="authors">Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, and Anannya Upasana</span>
<span class="title">Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.88">10.4230/LIPIcs.ICALP.2024.88</a>
</li>
<li>
<span class="authors">Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, and Ayumi Shinohara</span>
<span class="title">Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.89">10.4230/LIPIcs.ICALP.2024.89</a>
</li>
<li>
<span class="authors">Rajesh Jayaram, Jakub Łącki, Slobodan Mitrović, Krzysztof Onak, and Piotr Sankowski</span>
<span class="title">Dynamic PageRank: Algorithms and Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.90">10.4230/LIPIcs.ICALP.2024.90</a>
</li>
<li>
<span class="authors">Agastya Vibhuti Jha and Akash Kumar</span>
<span class="title">A Sublinear Time Tester for Max-Cut on Clusterable Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.91">10.4230/LIPIcs.ICALP.2024.91</a>
</li>
<li>
<span class="authors">Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, and Yuhao Zhang</span>
<span class="title">Algorithms for the Generalized Poset Sorting Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.92">10.4230/LIPIcs.ICALP.2024.92</a>
</li>
<li>
<span class="authors">Ce Jin, Michael Kapralov, Sepideh Mahabadi, and Ali Vakilian</span>
<span class="title">Streaming Algorithms for Connectivity Augmentation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.93">10.4230/LIPIcs.ICALP.2024.93</a>
</li>
<li>
<span class="authors">Ce Jin and Hongxun Wu</span>
<span class="title">A Faster Algorithm for Pigeonhole Equal Sums</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.94">10.4230/LIPIcs.ICALP.2024.94</a>
</li>
<li>
<span class="authors">Adam Karczmarz and Marcin Smulewicz</span>
<span class="title">Fully Dynamic Strongly Connected Components in Planar Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.95">10.4230/LIPIcs.ICALP.2024.95</a>
</li>
<li>
<span class="authors">Yasushi Kawase, Koichi Nishimura, and Hanna Sumita</span>
<span class="title">Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.96">10.4230/LIPIcs.ICALP.2024.96</a>
</li>
<li>
<span class="authors">Yotam Kenneth and Robert Krauthgamer</span>
<span class="title">Cut Sparsification and Succinct Representation of Submodular Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.97">10.4230/LIPIcs.ICALP.2024.97</a>
</li>
<li>
<span class="authors">Sanjeev Khanna, Aaron (Louie) Putterman, and Madhu Sudan</span>
<span class="title">Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.98">10.4230/LIPIcs.ICALP.2024.98</a>
</li>
<li>
<span class="authors">Boris Klemz and Marie Diana Sieper</span>
<span class="title">Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.99">10.4230/LIPIcs.ICALP.2024.99</a>
</li>
<li>
<span class="authors">Yusuke Kobayashi and Tatsuya Terao</span>
<span class="title">Subquadratic Submodular Maximization with a General Matroid Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.100">10.4230/LIPIcs.ICALP.2024.100</a>
</li>
<li>
<span class="authors">Tsvi Kopelowitz, Ariel Korin, and Liam Roditty</span>
<span class="title">On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.101">10.4230/LIPIcs.ICALP.2024.101</a>
</li>
<li>
<span class="authors">Soh Kumabe and Yuichi Yoshida</span>
<span class="title">Lipschitz Continuous Allocations for Optimization Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.102">10.4230/LIPIcs.ICALP.2024.102</a>
</li>
<li>
<span class="authors">William Kuszmaul and Zoe Xi</span>
<span class="title">Towards an Analysis of Quadratic Probing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.103">10.4230/LIPIcs.ICALP.2024.103</a>
</li>
<li>
<span class="authors">Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, and Or Zamir</span>
<span class="title">Optimal Non-Adaptive Cell Probe Dictionaries and Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.104">10.4230/LIPIcs.ICALP.2024.104</a>
</li>
<li>
<span class="authors">Eunou Lee and Ojas Parekh</span>
<span class="title">An Improved Quantum Max Cut Approximation via Maximum Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.105">10.4230/LIPIcs.ICALP.2024.105</a>
</li>
<li>
<span class="authors">Shi Li, Chenyang Xu, and Ruilong Zhang</span>
<span class="title">Polylogarithmic Approximations for Robust s-t Path</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.106">10.4230/LIPIcs.ICALP.2024.106</a>
</li>
<li>
<span class="authors">Shuangle Li, Bingkai Lin, and Yuwei Liu</span>
<span class="title">Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.107">10.4230/LIPIcs.ICALP.2024.107</a>
</li>
<li>
<span class="authors">Xin Li and Yan Zhong</span>
<span class="title">Two-Source and Affine Non-Malleable Extractors for Small Entropy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.108">10.4230/LIPIcs.ICALP.2024.108</a>
</li>
<li>
<span class="authors">Yaowei Long and Yunfan Wang</span>
<span class="title">Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.109">10.4230/LIPIcs.ICALP.2024.109</a>
</li>
<li>
<span class="authors">Zhenjian Lu and Rahul Santhanam</span>
<span class="title">Impagliazzo’s Worlds Through the Lens of Conditional Kolmogorov Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.110">10.4230/LIPIcs.ICALP.2024.110</a>
</li>
<li>
<span class="authors">Yury Makarychev, Max Ovsiankin, and Erasmo Tani</span>
<span class="title">Approximation Algorithms for 𝓁_p-Shortest Path and 𝓁_p-Group Steiner Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.111">10.4230/LIPIcs.ICALP.2024.111</a>
</li>
<li>
<span class="authors">Augusto Modanese and Yuichi Yoshida</span>
<span class="title">Testing Spreading Behavior in Networks with Arbitrary Topologies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.112">10.4230/LIPIcs.ICALP.2024.112</a>
</li>
<li>
<span class="authors">Naoto Ohsaka</span>
<span class="title">Alphabet Reduction for Reconfiguration Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.113">10.4230/LIPIcs.ICALP.2024.113</a>
</li>
<li>
<span class="authors">Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, and Sebastian Wiederrecht</span>
<span class="title">Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.114">10.4230/LIPIcs.ICALP.2024.114</a>
</li>
<li>
<span class="authors">Orestis Plevrakis, Seyoon Ragavan, and S. Matthew Weinberg</span>
<span class="title">On the Cut-Query Complexity of Approximating Max-Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.115">10.4230/LIPIcs.ICALP.2024.115</a>
</li>
<li>
<span class="authors">Vladimir V. Podolskii and Dmitrii Sluch</span>
<span class="title">One-Way Communication Complexity of Partial XOR Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.116">10.4230/LIPIcs.ICALP.2024.116</a>
</li>
<li>
<span class="authors">Aaron Potechin and Aaron Zhang</span>
<span class="title">Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.117">10.4230/LIPIcs.ICALP.2024.117</a>
</li>
<li>
<span class="authors">Kent Quanrud</span>
<span class="title">Adaptive Sparsification for Matroid Intersection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.118">10.4230/LIPIcs.ICALP.2024.118</a>
</li>
<li>
<span class="authors">Sushant Sachdeva, Anvith Thudi, and Yibin Zhao</span>
<span class="title">Better Sparsifiers for Directed Eulerian Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.119">10.4230/LIPIcs.ICALP.2024.119</a>
</li>
<li>
<span class="authors">Yaniv Sadeh and Haim Kaplan</span>
<span class="title">Caching Connections in Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.120">10.4230/LIPIcs.ICALP.2024.120</a>
</li>
<li>
<span class="authors">Mohammad Saneian and Soheil Behnezhad</span>
<span class="title">Streaming Edge Coloring with Asymptotically Optimal Colors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.121">10.4230/LIPIcs.ICALP.2024.121</a>
</li>
<li>
<span class="authors">Niklas Schlomberg</span>
<span class="title">An Improved Integrality Gap for Disjoint Cycles in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.122">10.4230/LIPIcs.ICALP.2024.122</a>
</li>
<li>
<span class="authors">Kingsley Yung</span>
<span class="title">Limits of Sequential Local Algorithms on the Random k-XORSAT Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.123">10.4230/LIPIcs.ICALP.2024.123</a>
</li>
<li>
<span class="authors">Rohan Acharya, Marcin Jurdziński, and Aditya Prakash</span>
<span class="title">Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.124">10.4230/LIPIcs.ICALP.2024.124</a>
</li>
<li>
<span class="authors">C. Aiswarya, Amaldev Manuel, and Saina Sunny</span>
<span class="title">Edit Distance of Finite State Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.125">10.4230/LIPIcs.ICALP.2024.125</a>
</li>
<li>
<span class="authors">Pascal Baumann, Eren Keskin, Roland Meyer, and Georg Zetzsche</span>
<span class="title">Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.126">10.4230/LIPIcs.ICALP.2024.126</a>
</li>
<li>
<span class="authors">Michael Benedikt, Chia-Hsuan Lu, Boris Motik, and Tony Tan</span>
<span class="title">Decidability of Graph Neural Networks via Logical Characterizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.127">10.4230/LIPIcs.ICALP.2024.127</a>
</li>
<li>
<span class="authors">Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, and Adriano Peron</span>
<span class="title">Automata-Theoretic Characterisations of Branching-Time Temporal Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.128">10.4230/LIPIcs.ICALP.2024.128</a>
</li>
<li>
<span class="authors">Manon Blanc and Olivier Bournez</span>
<span class="title">The Complexity of Computing in Continuous Time: Space Complexity Is Precision</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.129">10.4230/LIPIcs.ICALP.2024.129</a>
</li>
<li>
<span class="authors">Mikołaj Bojańczyk, Lê Thành Dũng (Tito) Nguyễn, and Rafał Stefański</span>
<span class="title">Function Spaces for Orbit-Finite Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.130">10.4230/LIPIcs.ICALP.2024.130</a>
</li>
<li>
<span class="authors">Arnaud Carayol and Lucien Charamond</span>
<span class="title">The Structure of Trees in the Pushdown Hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.131">10.4230/LIPIcs.ICALP.2024.131</a>
</li>
<li>
<span class="authors">Dmitry Chistikov, Alessio Mansutti, and Mikhail R. Starchak</span>
<span class="title">Integer Linear-Exponential Programming in NP by Quantifier Elimination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.132">10.4230/LIPIcs.ICALP.2024.132</a>
</li>
<li>
<span class="authors">Mohan Dantam and Richard Mayr</span>
<span class="title">Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.133">10.4230/LIPIcs.ICALP.2024.133</a>
</li>
<li>
<span class="authors">Julian Dörfler and Christian Ikenmeyer</span>
<span class="title">Functional Closure Properties of Finite ℕ-Weighted Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.134">10.4230/LIPIcs.ICALP.2024.134</a>
</li>
<li>
<span class="authors">Amina Doumane, Samuel Humeau, and Damien Pous</span>
<span class="title">A Finite Presentation of Graphs of Treewidth at Most Three</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.135">10.4230/LIPIcs.ICALP.2024.135</a>
</li>
<li>
<span class="authors">Yuxi Fu, Qizhe Yang, and Yangluo Zheng</span>
<span class="title">Improved Algorithm for Reachability in d-VASS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.136">10.4230/LIPIcs.ICALP.2024.136</a>
</li>
<li>
<span class="authors">Jakub Gajarský and Rose McCarty</span>
<span class="title">On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.137">10.4230/LIPIcs.ICALP.2024.137</a>
</li>
<li>
<span class="authors">Paul Gallot, Sebastian Maneth, Keisuke Nakano, and Charles Peyrat</span>
<span class="title">Deciding Linear Height and Linear Size-To-Height Increase of Macro Tree Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.138">10.4230/LIPIcs.ICALP.2024.138</a>
</li>
<li>
<span class="authors">Raphael Douglas Giles, Vincent Jackson, and Christine Rizkallah</span>
<span class="title">T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.139">10.4230/LIPIcs.ICALP.2024.139</a>
</li>
<li>
<span class="authors">Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, and James Worrell</span>
<span class="title">The 2-Dimensional Constraint Loop Problem Is Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.140">10.4230/LIPIcs.ICALP.2024.140</a>
</li>
<li>
<span class="authors">Roland Guttenberg</span>
<span class="title">Flattability of Priority Vector Addition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.141">10.4230/LIPIcs.ICALP.2024.141</a>
</li>
<li>
<span class="authors">Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, and Georg Zetzsche</span>
<span class="title">An Efficient Quantifier Elimination Procedure for Presburger Arithmetic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.142">10.4230/LIPIcs.ICALP.2024.142</a>
</li>
<li>
<span class="authors">Go Hashimoto, Daniel Găină, and Ionuţ Ţuţu</span>
<span class="title">Forcing, Transition Algebras, and Calculi</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.143">10.4230/LIPIcs.ICALP.2024.143</a>
</li>
<li>
<span class="authors">Pavol Kebis, Florian Luca, Joël Ouaknine, Andrew Scoones, and James Worrell</span>
<span class="title">On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.144">10.4230/LIPIcs.ICALP.2024.144</a>
</li>
<li>
<span class="authors">George Kenison</span>
<span class="title">The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.145">10.4230/LIPIcs.ICALP.2024.145</a>
</li>
<li>
<span class="authors">Alberto Larrauri and Stanislav Živný</span>
<span class="title">Solving Promise Equations over Monoids and Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.146">10.4230/LIPIcs.ICALP.2024.146</a>
</li>
<li>
<span class="authors">Bruno Loff and Mateusz Skomra</span>
<span class="title">Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.147">10.4230/LIPIcs.ICALP.2024.147</a>
</li>
<li>
<span class="authors">Antoine Mottet, Tomáš Nagy, and Michael Pinsker</span>
<span class="title">An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.148">10.4230/LIPIcs.ICALP.2024.148</a>
</li>
<li>
<span class="authors">Wojciech Różowski</span>
<span class="title">A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.149">10.4230/LIPIcs.ICALP.2024.149</a>
</li>
<li>
<span class="authors">Jakub Rydval</span>
<span class="title">Homogeneity and Homogenizability: Hard Problems for the Logic SNP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.150">10.4230/LIPIcs.ICALP.2024.150</a>
</li>
<li>
<span class="authors">Jakub Rydval, Žaneta Semanišinová, and Michał Wrona</span>
<span class="title">Identifying Tractable Quantified Temporal Constraints Within Ord-Horn</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.151">10.4230/LIPIcs.ICALP.2024.151</a>
</li>
<li>
<span class="authors">Benjamin Scheidt</span>
<span class="title">On Homomorphism Indistinguishability and Hypertree Depth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.152">10.4230/LIPIcs.ICALP.2024.152</a>
</li>
<li>
<span class="authors">Sylvain Schmitz and Lia Schütze</span>
<span class="title">On the Length of Strongly Monotone Descending Chains over ℕ^d</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.153">10.4230/LIPIcs.ICALP.2024.153</a>
</li>
<li>
<span class="authors">Guillaume Theyssier</span>
<span class="title">FO Logic on Cellular Automata Orbits Equals MSO Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.154">10.4230/LIPIcs.ICALP.2024.154</a>
</li>
<li>
<span class="authors">Yuya Uezato</span>
<span class="title">Regular Expressions with Backreferences and Lookaheads Capture NLOG</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.155">10.4230/LIPIcs.ICALP.2024.155</a>
</li>
<li>
<span class="authors">Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, and Chana Weil-Kennedy</span>
<span class="title">Verification of Population Protocols with Unordered Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.156">10.4230/LIPIcs.ICALP.2024.156</a>
</li>
<li>
<span class="authors">Cheng Zhang, Arthur Azevedo de Amorim, and Marco Gaboardi</span>
<span class="title">Domain Reasoning in TopKAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2024.157">10.4230/LIPIcs.ICALP.2024.157</a>
</li>
</ul>
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