<h2>LIPIcs, Volume 261, ICALP 2023</h2>
<ul>
<li>
<span class="authors">Kousha Etessami, Uriel Feige, and Gabriele Puppis</span>
<span class="title">LIPIcs, Volume 261, ICALP 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023">10.4230/LIPIcs.ICALP.2023</a>
</li>
<li>
<span class="authors">Kousha Etessami, Uriel Feige, and Gabriele Puppis</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.0">10.4230/LIPIcs.ICALP.2023.0</a>
</li>
<li>
<span class="authors">Anna R. Karlin</span>
<span class="title">A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.1">10.4230/LIPIcs.ICALP.2023.1</a>
</li>
<li>
<span class="authors">Rasmus Kyng</span>
<span class="title">An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.2">10.4230/LIPIcs.ICALP.2023.2</a>
</li>
<li>
<span class="authors">Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, and Georg Zetzsche</span>
<span class="title">Context-Bounded Analysis of Concurrent Programs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.3">10.4230/LIPIcs.ICALP.2023.3</a>
</li>
<li>
<span class="authors">Thomas Vidick</span>
<span class="title">Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.4">10.4230/LIPIcs.ICALP.2023.4</a>
</li>
<li>
<span class="authors">James Worrell</span>
<span class="title">The Skolem Landscape (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.5">10.4230/LIPIcs.ICALP.2023.5</a>
</li>
<li>
<span class="authors">Anders Aamand, Adam Karczmarz, Jakub Łącki, Nikos Parotsidis, Peter M. R. Rasmussen, and Mikkel Thorup</span>
<span class="title">Optimal Decremental Connectivity in Non-Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.6">10.4230/LIPIcs.ICALP.2023.6</a>
</li>
<li>
<span class="authors">Peyman Afshani, Pingan Cheng, Aniket Basu Roy, and Zhewei Wei</span>
<span class="title">On Range Summary Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.7">10.4230/LIPIcs.ICALP.2023.7</a>
</li>
<li>
<span class="authors">Ishan Agarwal and Richard Cole</span>
<span class="title">Stable Matching: Choosing Which Proposals to Make</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.8">10.4230/LIPIcs.ICALP.2023.8</a>
</li>
<li>
<span class="authors">Daniel Agassy, Dani Dorfman, and Haim Kaplan</span>
<span class="title">Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.9">10.4230/LIPIcs.ICALP.2023.9</a>
</li>
<li>
<span class="authors">Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, and Jukka Suomela</span>
<span class="title">Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.10">10.4230/LIPIcs.ICALP.2023.10</a>
</li>
<li>
<span class="authors">Shyan Akmal and Ce Jin</span>
<span class="title">An Efficient Algorithm for All-Pairs Bounded Edge Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.11">10.4230/LIPIcs.ICALP.2023.11</a>
</li>
<li>
<span class="authors">Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, and Bhargav Thankey</span>
<span class="title">Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.12">10.4230/LIPIcs.ICALP.2023.12</a>
</li>
<li>
<span class="authors">Yossi Azar and Danny Vainstein</span>
<span class="title">Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.13">10.4230/LIPIcs.ICALP.2023.13</a>
</li>
<li>
<span class="authors">Amir Azarmehr and Soheil Behnezhad</span>
<span class="title">Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.14">10.4230/LIPIcs.ICALP.2023.14</a>
</li>
<li>
<span class="authors">Ishan Bansal, Joseph Cheriyan, Logan Grout, and Sharat Ibrahimpur</span>
<span class="title">Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.15">10.4230/LIPIcs.ICALP.2023.15</a>
</li>
<li>
<span class="authors">Siddharth Barman and Pooja Kulkarni</span>
<span class="title">Approximation Algorithms for Envy-Free Cake Division with Connected Pieces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.16">10.4230/LIPIcs.ICALP.2023.16</a>
</li>
<li>
<span class="authors">Paul Beame and Niels Kornerup</span>
<span class="title">Cumulative Memory Lower Bounds for Randomized and Quantum Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.17">10.4230/LIPIcs.ICALP.2023.17</a>
</li>
<li>
<span class="authors">Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, and Malin Rau</span>
<span class="title">Dynamic Averaging Load Balancing on Arbitrary Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.18">10.4230/LIPIcs.ICALP.2023.18</a>
</li>
<li>
<span class="authors">Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, and László Kozma</span>
<span class="title">Fast Approximation of Search Trees on Trees with Centroid Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.19">10.4230/LIPIcs.ICALP.2023.19</a>
</li>
<li>
<span class="authors">Thiago Bergamaschi</span>
<span class="title">Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.20">10.4230/LIPIcs.ICALP.2023.20</a>
</li>
<li>
<span class="authors">Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, and Archan Ray</span>
<span class="title">Sublinear Time Eigenvalue Approximation via Random Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.21">10.4230/LIPIcs.ICALP.2023.21</a>
</li>
<li>
<span class="authors">Sudatta Bhattacharya and Michal Koucký</span>
<span class="title">Streaming k-Edit Approximate Pattern Matching via String Decomposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.22">10.4230/LIPIcs.ICALP.2023.22</a>
</li>
<li>
<span class="authors">Therese Biedl and Karthik Murali</span>
<span class="title">On Computing the Vertex Connectivity of 1-Plane Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.23">10.4230/LIPIcs.ICALP.2023.23</a>
</li>
<li>
<span class="authors">Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, and Martin Schirneck</span>
<span class="title">Fault-Tolerant ST-Diameter Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.24">10.4230/LIPIcs.ICALP.2023.24</a>
</li>
<li>
<span class="authors">Hadley Black, Iden Kalemaj, and Sofya Raskhodnikova</span>
<span class="title">Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.25">10.4230/LIPIcs.ICALP.2023.25</a>
</li>
<li>
<span class="authors">Guy E. Blelloch and Magdalen Dobson</span>
<span class="title">The Geometry of Tree-Based Sorting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.26">10.4230/LIPIcs.ICALP.2023.26</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Carla Groenland, and Michał Pilipczuk</span>
<span class="title">Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.27">10.4230/LIPIcs.ICALP.2023.27</a>
</li>
<li>
<span class="authors">Andrej Bogdanov and Alon Rosen</span>
<span class="title">Nondeterministic Interactive Refutations for Nearest Boolean Vector</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.28">10.4230/LIPIcs.ICALP.2023.28</a>
</li>
<li>
<span class="authors">Miguel Bosch-Calvo, Fabrizio Grandoni, and Afrouz Jabal Ameli</span>
<span class="title">A 4/3 Approximation for 2-Vertex-Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.29">10.4230/LIPIcs.ICALP.2023.29</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, and Shay Sapir</span>
<span class="title">Lower Bounds for Pseudo-Deterministic Counting in a Stream</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.30">10.4230/LIPIcs.ICALP.2023.30</a>
</li>
<li>
<span class="authors">Manuel Cáceres</span>
<span class="title">Minimum Chain Cover in Almost Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.31">10.4230/LIPIcs.ICALP.2023.31</a>
</li>
<li>
<span class="authors">Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, and Jordi Weggemans</span>
<span class="title">Improved Hardness Results for the Guided Local Hamiltonian Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.32">10.4230/LIPIcs.ICALP.2023.32</a>
</li>
<li>
<span class="authors">Jin-Yi Cai and Ben Young</span>
<span class="title">Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.33">10.4230/LIPIcs.ICALP.2023.33</a>
</li>
<li>
<span class="authors">Timothy M. Chan, Qizheng He, and Yuancheng Yu</span>
<span class="title">On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.34">10.4230/LIPIcs.ICALP.2023.34</a>
</li>
<li>
<span class="authors">Yi-Jun Chang</span>
<span class="title">Ortho-Radial Drawing in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.35">10.4230/LIPIcs.ICALP.2023.35</a>
</li>
<li>
<span class="authors">Chandra Chekuri and Rhea Jain</span>
<span class="title">Approximation Algorithms for Network Design in Non-Uniform Fault Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.36">10.4230/LIPIcs.ICALP.2023.36</a>
</li>
<li>
<span class="authors">Yu Chen, Sanjeev Khanna, and Zihan Tan</span>
<span class="title">Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.37">10.4230/LIPIcs.ICALP.2023.37</a>
</li>
<li>
<span class="authors">Yanlin Chen and Ronald de Wolf</span>
<span class="title">Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.38">10.4230/LIPIcs.ICALP.2023.38</a>
</li>
<li>
<span class="authors">Lijie Chen, Xin Lyu, Avishay Tal, and Hongxun Wu</span>
<span class="title">New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.39">10.4230/LIPIcs.ICALP.2023.39</a>
</li>
<li>
<span class="authors">Siu-Wing Cheng and Haoqiang Huang</span>
<span class="title">Approximate Nearest Neighbor for Polygonal Curves Under Fréchet Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.40">10.4230/LIPIcs.ICALP.2023.40</a>
</li>
<li>
<span class="authors">Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei, and Yu Zheng</span>
<span class="title">Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.41">10.4230/LIPIcs.ICALP.2023.41</a>
</li>
<li>
<span class="authors">Tsun-Ming Cheung, Hamed Hatami, Pooya Hatami, and Kaave Hosseini</span>
<span class="title">Online Learning and Disambiguations of Partial Concept Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.42">10.4230/LIPIcs.ICALP.2023.42</a>
</li>
<li>
<span class="authors">Ilan Reuven Cohen and Debmalya Panigrahi</span>
<span class="title">A General Framework for Learning-Augmented Online Allocation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.43">10.4230/LIPIcs.ICALP.2023.43</a>
</li>
<li>
<span class="authors">Omer Cohen Sidon and Dana Ron</span>
<span class="title">Sample-Based Distance-Approximation for Subsequence-Freeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.44">10.4230/LIPIcs.ICALP.2023.44</a>
</li>
<li>
<span class="authors">Spencer Compton, Slobodan Mitrović, and Ronitt Rubinfeld</span>
<span class="title">New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.45">10.4230/LIPIcs.ICALP.2023.45</a>
</li>
<li>
<span class="authors">Sam Coy, Artur Czumaj, Peter Davies, and Gopinath Mishra</span>
<span class="title">Optimal (Degree+1)-Coloring in Congested Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.46">10.4230/LIPIcs.ICALP.2023.46</a>
</li>
<li>
<span class="authors">Yann Disser, Max Klimm, Kevin Schewior, and David Weckbecker</span>
<span class="title">Incremental Maximization via Continuization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.47">10.4230/LIPIcs.ICALP.2023.47</a>
</li>
<li>
<span class="authors">Andrzej Dorobisz and Jakub Kozik</span>
<span class="title">Local Computation Algorithms for Hypergraph Coloring - Following Beck’s Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.48">10.4230/LIPIcs.ICALP.2023.48</a>
</li>
<li>
<span class="authors">Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai</span>
<span class="title">An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.49">10.4230/LIPIcs.ICALP.2023.49</a>
</li>
<li>
<span class="authors">Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, and Julian Wargalla</span>
<span class="title">Connected k-Center and k-Diameter Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.50">10.4230/LIPIcs.ICALP.2023.50</a>
</li>
<li>
<span class="authors">Shaddin Dughmi, Yusuf Hakan Kalayci, and Neel Patel</span>
<span class="title">On Sparsification of Stochastic Packing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.51">10.4230/LIPIcs.ICALP.2023.51</a>
</li>
<li>
<span class="authors">Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, and Adam Smith</span>
<span class="title">Triangle Counting with Local Edge Differential Privacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.52">10.4230/LIPIcs.ICALP.2023.52</a>
</li>
<li>
<span class="authors">Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena</span>
<span class="title">Protecting Single-Hop Radio Networks from Message Drops</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.53">10.4230/LIPIcs.ICALP.2023.53</a>
</li>
<li>
<span class="authors">Charilaos Efthymiou and Weiming Feng</span>
<span class="title">On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n,d/n)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.54">10.4230/LIPIcs.ICALP.2023.54</a>
</li>
<li>
<span class="authors">Charilaos Efthymiou and Kostas Zampetakis</span>
<span class="title">Broadcasting with Random Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.55">10.4230/LIPIcs.ICALP.2023.55</a>
</li>
<li>
<span class="authors">David Eppstein and Daniel Frishberg</span>
<span class="title">Improved Mixing for the Convex Polygon Triangulation Flip Walk</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.56">10.4230/LIPIcs.ICALP.2023.56</a>
</li>
<li>
<span class="authors">Louis Esperet, Nathaniel Harms, and Viktor Zamaraev</span>
<span class="title">Optimal Adjacency Labels for Subgraphs of Cartesian Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.57">10.4230/LIPIcs.ICALP.2023.57</a>
</li>
<li>
<span class="authors">Michal Feldman, Federico Fusco, Simon Mauras, and Rebecca Reiffenhäuser</span>
<span class="title">Truthful Matching with Online Items and Offline Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.58">10.4230/LIPIcs.ICALP.2023.58</a>
</li>
<li>
<span class="authors">Robert Ferens and Marek Szykuła</span>
<span class="title">Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.59">10.4230/LIPIcs.ICALP.2023.59</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, and Kirill Simonov</span>
<span class="title">Approximating Long Cycle Above Dirac’s Guarantee</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.60">10.4230/LIPIcs.ICALP.2023.60</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos</span>
<span class="title">Compound Logics for Modification Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.61">10.4230/LIPIcs.ICALP.2023.61</a>
</li>
<li>
<span class="authors">Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, and Leon Schiller</span>
<span class="title">Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.62">10.4230/LIPIcs.ICALP.2023.62</a>
</li>
<li>
<span class="authors">Zachary Friggstad and Ramin Mousavi</span>
<span class="title">An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.63">10.4230/LIPIcs.ICALP.2023.63</a>
</li>
<li>
<span class="authors">Honghao Fu, Daochen Wang, and Qi Zhao</span>
<span class="title">Parallel Self-Testing of EPR Pairs Under Computational Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.64">10.4230/LIPIcs.ICALP.2023.64</a>
</li>
<li>
<span class="authors">Mohit Garg, Felix Hommelsheim, and Nicole Megow</span>
<span class="title">Matching Augmentation via Simultaneous Contractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.65">10.4230/LIPIcs.ICALP.2023.65</a>
</li>
<li>
<span class="authors">Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, and Kewen Wu</span>
<span class="title">On Differentially Private Counting on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.66">10.4230/LIPIcs.ICALP.2023.66</a>
</li>
<li>
<span class="authors">Alexandru Gheorghiu, Tony Metger, and Alexander Poremba</span>
<span class="title">Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.67">10.4230/LIPIcs.ICALP.2023.67</a>
</li>
<li>
<span class="authors">Leslie Ann Goldberg and Marc Roth</span>
<span class="title">Parameterised and Fine-Grained Subgraph Counting, Modulo 2</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.68">10.4230/LIPIcs.ICALP.2023.68</a>
</li>
<li>
<span class="authors">Gramoz Goranci and Monika Henzinger</span>
<span class="title">Efficient Data Structures for Incremental Exact and Approximate Maximum Flow</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.69">10.4230/LIPIcs.ICALP.2023.69</a>
</li>
<li>
<span class="authors">Mohak Goyal, Sukolsak Sakshuwong, Sahasrajit Sarmasarkar, and Ashish Goel</span>
<span class="title">Low Sample Complexity Participatory Budgeting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.70">10.4230/LIPIcs.ICALP.2023.70</a>
</li>
<li>
<span class="authors">Daniel Hader and Matthew J. Patitz</span>
<span class="title">The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.71">10.4230/LIPIcs.ICALP.2023.71</a>
</li>
<li>
<span class="authors">David G. Harris and Vladimir Kolmogorov</span>
<span class="title">Parameter Estimation for Gibbs Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.72">10.4230/LIPIcs.ICALP.2023.72</a>
</li>
<li>
<span class="authors">Ishay Haviv</span>
<span class="title">On Finding Constrained Independent Sets in Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.73">10.4230/LIPIcs.ICALP.2023.73</a>
</li>
<li>
<span class="authors">Monika Henzinger, Paul Liu, Jan Vondrák, and Da Wei Zheng</span>
<span class="title">Faster Submodular Maximization for Several Classes of Matroids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.74">10.4230/LIPIcs.ICALP.2023.74</a>
</li>
<li>
<span class="authors">Petr Hliněný and Jan Jedelský</span>
<span class="title">Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.75">10.4230/LIPIcs.ICALP.2023.75</a>
</li>
<li>
<span class="authors">Jakob Bæk Tejs Houen and Mikkel Thorup</span>
<span class="title">A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.76">10.4230/LIPIcs.ICALP.2023.76</a>
</li>
<li>
<span class="authors">Jun-Ting Hsieh and Pravesh K. Kothari</span>
<span class="title">Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.77">10.4230/LIPIcs.ICALP.2023.77</a>
</li>
<li>
<span class="authors">Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, and Jeff Xu</span>
<span class="title">Ellipsoid Fitting up to a Constant</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.78">10.4230/LIPIcs.ICALP.2023.78</a>
</li>
<li>
<span class="authors">Dylan Hyatt-Denesik, Afrouz Jabal Ameli, and Laura Sanità</span>
<span class="title">Finding Almost Tight Witness Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.79">10.4230/LIPIcs.ICALP.2023.79</a>
</li>
<li>
<span class="authors">Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang</span>
<span class="title">Efficient Caching with Reserves via Marking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.80">10.4230/LIPIcs.ICALP.2023.80</a>
</li>
<li>
<span class="authors">Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki</span>
<span class="title">Rerouting Planar Curves and Disjoint Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.81">10.4230/LIPIcs.ICALP.2023.81</a>
</li>
<li>
<span class="authors">Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, and Yoshio Okamoto</span>
<span class="title">Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.82">10.4230/LIPIcs.ICALP.2023.82</a>
</li>
<li>
<span class="authors">Siddharth Iyer and Michael Whitmeyer</span>
<span class="title">Searching for Regularity in Bounded Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.83">10.4230/LIPIcs.ICALP.2023.83</a>
</li>
<li>
<span class="authors">Adam Karczmarz and Piotr Sankowski</span>
<span class="title">Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.84">10.4230/LIPIcs.ICALP.2023.84</a>
</li>
<li>
<span class="authors">Shimon Kogan and Merav Parter</span>
<span class="title">New Additive Emulators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.85">10.4230/LIPIcs.ICALP.2023.85</a>
</li>
<li>
<span class="authors">Shi Li</span>
<span class="title">Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.86">10.4230/LIPIcs.ICALP.2023.86</a>
</li>
<li>
<span class="authors">Xiantao Li and Chunhao Wang</span>
<span class="title">Simulating Markovian Open Quantum Systems Using Higher-Order Series Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.87">10.4230/LIPIcs.ICALP.2023.87</a>
</li>
<li>
<span class="authors">S. Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, and Tianyi Zhou</span>
<span class="title">Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.88">10.4230/LIPIcs.ICALP.2023.88</a>
</li>
<li>
<span class="authors">Shu Liu, Chaoping Xing, and Chen Yuan</span>
<span class="title">List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.89">10.4230/LIPIcs.ICALP.2023.89</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Saket Saurabh, and Vaishali Surianarayanan</span>
<span class="title">Breaking the All Subsets Barrier for Min k-Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.90">10.4230/LIPIcs.ICALP.2023.90</a>
</li>
<li>
<span class="authors">Claire Mathieu and Hang Zhou</span>
<span class="title">A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.91">10.4230/LIPIcs.ICALP.2023.91</a>
</li>
<li>
<span class="authors">Konstantina Mellou, Marco Molinaro, and Rudy Zhou</span>
<span class="title">Online Demand Scheduling with Failovers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.92">10.4230/LIPIcs.ICALP.2023.92</a>
</li>
<li>
<span class="authors">Laure Morelle, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos</span>
<span class="title">Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.93">10.4230/LIPIcs.ICALP.2023.93</a>
</li>
<li>
<span class="authors">Kazusato Oko, Shinsaku Sakaue, and Shin-ichi Tanigawa</span>
<span class="title">Nearly Tight Spectral Sparsification of Directed Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.94">10.4230/LIPIcs.ICALP.2023.94</a>
</li>
<li>
<span class="authors">Rotem Oshman and Tal Roth</span>
<span class="title">The Communication Complexity of Set Intersection Under Product Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.95">10.4230/LIPIcs.ICALP.2023.95</a>
</li>
<li>
<span class="authors">Pan Peng and Yuyang Wang</span>
<span class="title">An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.96">10.4230/LIPIcs.ICALP.2023.96</a>
</li>
<li>
<span class="authors">Minglong Qin and Penghui Yao</span>
<span class="title">Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.97">10.4230/LIPIcs.ICALP.2023.97</a>
</li>
<li>
<span class="authors">Rajmohan Rajaraman, David Stalfa, and Sheng Yang</span>
<span class="title">Scheduling Under Non-Uniform Job and Machine Delays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.98">10.4230/LIPIcs.ICALP.2023.98</a>
</li>
<li>
<span class="authors">Nicolas Resch, Chen Yuan, and Yihan Zhang</span>
<span class="title">Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.99">10.4230/LIPIcs.ICALP.2023.99</a>
</li>
<li>
<span class="authors">Eric Rivals, Michelle Sweering, and Pengfei Wang</span>
<span class="title">Convergence of the Number of Period Sets in Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.100">10.4230/LIPIcs.ICALP.2023.100</a>
</li>
<li>
<span class="authors">David E. Roberson and Tim Seppelt</span>
<span class="title">Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.101">10.4230/LIPIcs.ICALP.2023.101</a>
</li>
<li>
<span class="authors">Ittai Rubinstein</span>
<span class="title">Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.102">10.4230/LIPIcs.ICALP.2023.102</a>
</li>
<li>
<span class="authors">Thomas Sauerwald, He Sun, and Danny Vagnozzi</span>
<span class="title">The Support of Open Versus Closed Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.103">10.4230/LIPIcs.ICALP.2023.103</a>
</li>
<li>
<span class="authors">Tatsuya Terao</span>
<span class="title">Faster Matroid Partition Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.104">10.4230/LIPIcs.ICALP.2023.104</a>
</li>
<li>
<span class="authors">Noam Touitou</span>
<span class="title">Frameworks for Nonclairvoyant Network Design with Deadlines or Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.105">10.4230/LIPIcs.ICALP.2023.105</a>
</li>
<li>
<span class="authors">Michał Włodarczyk</span>
<span class="title">Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.106">10.4230/LIPIcs.ICALP.2023.106</a>
</li>
<li>
<span class="authors">Or Zamir</span>
<span class="title">The Wrong Direction of Jensen’s Inequality Is Algorithmically Right</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.107">10.4230/LIPIcs.ICALP.2023.107</a>
</li>
<li>
<span class="authors">Ruizhe Zhang and Xinzhi Zhang</span>
<span class="title">A Hyperbolic Extension of Kadison-Singer Type Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.108">10.4230/LIPIcs.ICALP.2023.108</a>
</li>
<li>
<span class="authors">Bader Abu Radi and Orna Kupferman</span>
<span class="title">On Semantically-Deterministic Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.109">10.4230/LIPIcs.ICALP.2023.109</a>
</li>
<li>
<span class="authors">Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, and Georg Zetzsche</span>
<span class="title">Checking Refinement of Asynchronous Programs Against Context-Free Specifications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.110">10.4230/LIPIcs.ICALP.2023.110</a>
</li>
<li>
<span class="authors">Bartosz Bednarczyk, Daumantas Kojelis, and Ian Pratt-Hartmann</span>
<span class="title">On the Limits of Decision: the Adjacent Fragment of First-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.111">10.4230/LIPIcs.ICALP.2023.111</a>
</li>
<li>
<span class="authors">Michael Benedikt, Dmitry Chistikov, and Alessio Mansutti</span>
<span class="title">The Complexity of Presburger Arithmetic with Power or Powers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.112">10.4230/LIPIcs.ICALP.2023.112</a>
</li>
<li>
<span class="authors">Christoph Berkholz and Harry Vinall-Smeeth</span>
<span class="title">A Dichotomy for Succinct Representations of Homomorphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.113">10.4230/LIPIcs.ICALP.2023.113</a>
</li>
<li>
<span class="authors">Fabian Birkmann, Stefan Milius, and Henning Urbat</span>
<span class="title">Nominal Topology for Data Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.114">10.4230/LIPIcs.ICALP.2023.114</a>
</li>
<li>
<span class="authors">Michael Blondin and François Ladouceur</span>
<span class="title">Population Protocols with Unordered Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.115">10.4230/LIPIcs.ICALP.2023.115</a>
</li>
<li>
<span class="authors">Manuel Bodirsky and Simon Knäuer</span>
<span class="title">Network Satisfaction Problems Solved by k-Consistency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.116">10.4230/LIPIcs.ICALP.2023.116</a>
</li>
<li>
<span class="authors">Mikołaj Bojańczyk and Lê Thành Dũng (Tito) Nguyễn</span>
<span class="title">Algebraic Recognition of Regular Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.117">10.4230/LIPIcs.ICALP.2023.117</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, and Pierre Vandenhove</span>
<span class="title">How to Play Optimally for Regular Objectives?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.118">10.4230/LIPIcs.ICALP.2023.118</a>
</li>
<li>
<span class="authors">Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, and Aris Papadopoulos</span>
<span class="title">Monadic NIP in Monotone Classes of Relational Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.119">10.4230/LIPIcs.ICALP.2023.119</a>
</li>
<li>
<span class="authors">Titouan Carette, Etienne Moutot, Thomas Perez, and Renaud Vilmart</span>
<span class="title">Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.120">10.4230/LIPIcs.ICALP.2023.120</a>
</li>
<li>
<span class="authors">Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, and Sarah Winter</span>
<span class="title">Deterministic Regular Functions of Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.121">10.4230/LIPIcs.ICALP.2023.121</a>
</li>
<li>
<span class="authors">Antonio Casares and Pierre Ohlmann</span>
<span class="title">Characterising Memory in Infinite Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.122">10.4230/LIPIcs.ICALP.2023.122</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, and Kuldeep S. Meel</span>
<span class="title">Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.123">10.4230/LIPIcs.ICALP.2023.123</a>
</li>
<li>
<span class="authors">Ruiwen Dong</span>
<span class="title">The Identity Problem in ℤ ≀ ℤ Is Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.124">10.4230/LIPIcs.ICALP.2023.124</a>
</li>
<li>
<span class="authors">Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, and Szymon Toruńczyk</span>
<span class="title">Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.125">10.4230/LIPIcs.ICALP.2023.125</a>
</li>
<li>
<span class="authors">Javier Esparza and Vincent P. Grande</span>
<span class="title">Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.126">10.4230/LIPIcs.ICALP.2023.126</a>
</li>
<li>
<span class="authors">Austen Z. Fan, Paraschos Koutris, and Hangdong Zhao</span>
<span class="title">The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.127">10.4230/LIPIcs.ICALP.2023.127</a>
</li>
<li>
<span class="authors">Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokołowski, and Szymon Toruńczyk</span>
<span class="title">Flipper Games for Monadically Stable Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.128">10.4230/LIPIcs.ICALP.2023.128</a>
</li>
<li>
<span class="authors">Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, and N. Ege Saraç</span>
<span class="title">Regular Methods for Operator Precedence Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.129">10.4230/LIPIcs.ICALP.2023.129</a>
</li>
<li>
<span class="authors">George Kenison, Joris Nieuwveld, Joël Ouaknine, and James Worrell</span>
<span class="title">Positivity Problems for Reversible Linear Recurrence Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.130">10.4230/LIPIcs.ICALP.2023.130</a>
</li>
<li>
<span class="authors">Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, and Karol Węgrzycki</span>
<span class="title">Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.131">10.4230/LIPIcs.ICALP.2023.131</a>
</li>
<li>
<span class="authors">Michael Lampis</span>
<span class="title">First Order Logic on Pathwidth Revisited Again</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.132">10.4230/LIPIcs.ICALP.2023.132</a>
</li>
<li>
<span class="authors">Moritz Lichter</span>
<span class="title">Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.133">10.4230/LIPIcs.ICALP.2023.133</a>
</li>
<li>
<span class="authors">Markus Lohrey and Andreas Rosowski</span>
<span class="title">On the Complexity of Diameter and Related Problems in Permutation Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.134">10.4230/LIPIcs.ICALP.2023.134</a>
</li>
<li>
<span class="authors">Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk</span>
<span class="title">Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.135">10.4230/LIPIcs.ICALP.2023.135</a>
</li>
<li>
<span class="authors">Wojciech Różowski, Tobias Kappé, Dexter Kozen, Todd Schmid, and Alexandra Silva</span>
<span class="title">Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.136">10.4230/LIPIcs.ICALP.2023.136</a>
</li>
<li>
<span class="authors">Frits Vaandrager and Thorsten Wißmann</span>
<span class="title">Action Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.137">10.4230/LIPIcs.ICALP.2023.137</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