<h2>LIPIcs, Volume 229, ICALP 2022</h2>
<ul>
<li>
<span class="authors">Mikołaj Bojańczyk, Emanuela Merelli, and David P. Woodruff</span>
<span class="title">LIPIcs, Volume 229, ICALP 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022">10.4230/LIPIcs.ICALP.2022</a>
</li>
<li>
<span class="authors">Mikołaj Bojańczyk, Emanuela Merelli, and David P. Woodruff</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.0">10.4230/LIPIcs.ICALP.2022.0</a>
</li>
<li>
<span class="authors">Albert Atserias</span>
<span class="title">Towards a Theory of Algorithmic Proof Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.1">10.4230/LIPIcs.ICALP.2022.1</a>
</li>
<li>
<span class="authors">Constantinos Daskalakis</span>
<span class="title">Equilibrium Computation, Deep Learning, and Multi-Agent Reinforcement Learning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.2">10.4230/LIPIcs.ICALP.2022.2</a>
</li>
<li>
<span class="authors">Leslie Ann Goldberg</span>
<span class="title">Some New (And Old) Results on Contention Resolution (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.3">10.4230/LIPIcs.ICALP.2022.3</a>
</li>
<li>
<span class="authors">Yin Tat Lee and Santosh S. Vempala</span>
<span class="title">The Manifold Joys of Sampling (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.4">10.4230/LIPIcs.ICALP.2022.4</a>
</li>
<li>
<span class="authors">Madhu Sudan</span>
<span class="title">Streaming and Sketching Complexity of CSPs: A Survey (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.5">10.4230/LIPIcs.ICALP.2022.5</a>
</li>
<li>
<span class="authors">Stéphan Thomassé</span>
<span class="title">A Brief Tour in Twin-Width (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.6">10.4230/LIPIcs.ICALP.2022.6</a>
</li>
<li>
<span class="authors">Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, and Pasin Manurangsi</span>
<span class="title">Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.7">10.4230/LIPIcs.ICALP.2022.7</a>
</li>
<li>
<span class="authors">Shweta Agrawal, Damien Stehlé, and Anshu Yadav</span>
<span class="title">Round-Optimal Lattice-Based Threshold Signatures, Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.8">10.4230/LIPIcs.ICALP.2022.8</a>
</li>
<li>
<span class="authors">Josh Alman and Dean Hirsch</span>
<span class="title">Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.9">10.4230/LIPIcs.ICALP.2022.9</a>
</li>
<li>
<span class="authors">Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, and João Ribeiro</span>
<span class="title">Low-Degree Polynomials Extract From Local Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.10">10.4230/LIPIcs.ICALP.2022.10</a>
</li>
<li>
<span class="authors">Sepehr Assadi, Aaron Bernstein, and Aditi Dudeja</span>
<span class="title">Decremental Matching in General Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.11">10.4230/LIPIcs.ICALP.2022.11</a>
</li>
<li>
<span class="authors">Nikhil ^* Ayyadevara, Rajni Dabas, Arindam Khan, and K. V. N. Sreenivas</span>
<span class="title">Near-Optimal Algorithms for Stochastic Online Bin Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.12">10.4230/LIPIcs.ICALP.2022.12</a>
</li>
<li>
<span class="authors">Yossi Azar, Chay Machluf, Boaz Patt-Shamir, and Noam Touitou</span>
<span class="title">Competitive Vertex Recoloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.13">10.4230/LIPIcs.ICALP.2022.13</a>
</li>
<li>
<span class="authors">Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, and Makrand Sinha</span>
<span class="title">Smoothed Analysis of the Komlós Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.14">10.4230/LIPIcs.ICALP.2022.14</a>
</li>
<li>
<span class="authors">Surender Baswana, Koustav Bhanja, and Abhyuday Pandey</span>
<span class="title">Minimum+1 (s,t)-cuts and Dual Edge Sensitivity Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.15">10.4230/LIPIcs.ICALP.2022.15</a>
</li>
<li>
<span class="authors">Calvin Beideman, Karthekeyan Chandrasekaran, and Weihang Wang</span>
<span class="title">Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.16">10.4230/LIPIcs.ICALP.2022.16</a>
</li>
<li>
<span class="authors">Omri Ben-Eliezer, Shoham Letzter, and Erik Waingarten</span>
<span class="title">Finding Monotone Patterns in Sublinear Time, Adaptively</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.17">10.4230/LIPIcs.ICALP.2022.17</a>
</li>
<li>
<span class="authors">Pierre Bergé, Édouard Bonnet, and Hugues Déprés</span>
<span class="title">Deciding Twin-Width at Most 4 Is NP-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.18">10.4230/LIPIcs.ICALP.2022.18</a>
</li>
<li>
<span class="authors">Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, and Nicole Wein</span>
<span class="title">Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.19">10.4230/LIPIcs.ICALP.2022.19</a>
</li>
<li>
<span class="authors">Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun</span>
<span class="title">Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.20">10.4230/LIPIcs.ICALP.2022.20</a>
</li>
<li>
<span class="authors">Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, and Daniel Štefankovič</span>
<span class="title">Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.21">10.4230/LIPIcs.ICALP.2022.21</a>
</li>
<li>
<span class="authors">Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, and Martin Schirneck</span>
<span class="title">Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.22">10.4230/LIPIcs.ICALP.2022.22</a>
</li>
<li>
<span class="authors">Mitchell Black and Amir Nayyeri</span>
<span class="title">Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.23">10.4230/LIPIcs.ICALP.2022.23</a>
</li>
<li>
<span class="authors">Guy Blanc, Jane Lange, and Li-Yang Tan</span>
<span class="title">Reconstructing Decision Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.24">10.4230/LIPIcs.ICALP.2022.24</a>
</li>
<li>
<span class="authors">Joakim Blikstad</span>
<span class="title">Sublinear-Round Parallel Matroid Intersection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.25">10.4230/LIPIcs.ICALP.2022.25</a>
</li>
<li>
<span class="authors">Jeremiah Blocki, Elena Grigorescu, and Tamalika Mukherjee</span>
<span class="title">Privately Estimating Graph Parameters in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.26">10.4230/LIPIcs.ICALP.2022.26</a>
</li>
<li>
<span class="authors">Niclas Boehmer and Tomohiro Koana</span>
<span class="title">The Complexity of Finding Fair Many-To-One Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.27">10.4230/LIPIcs.ICALP.2022.27</a>
</li>
<li>
<span class="authors">Zvika Brakerski, Nico Döttling, Sanjam Garg, and Giulio Malavolta</span>
<span class="title">Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.28">10.4230/LIPIcs.ICALP.2022.28</a>
</li>
<li>
<span class="authors">Marcin Briański, Martin Koutecký, Daniel Král', Kristýna Pekárková, and Felix Schröder</span>
<span class="title">Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.29">10.4230/LIPIcs.ICALP.2022.29</a>
</li>
<li>
<span class="authors">Karl Bringmann, Alejandro Cassis, Nick Fischer, and Marvin Künnemann</span>
<span class="title">A Structural Investigation of the Approximability of Polynomial-Time Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.30">10.4230/LIPIcs.ICALP.2022.30</a>
</li>
<li>
<span class="authors">Karl Bringmann and Alejandro Cassis</span>
<span class="title">Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.31">10.4230/LIPIcs.ICALP.2022.31</a>
</li>
<li>
<span class="authors">Karl Bringmann, Alejandro Cassis, Nick Fischer, and Vasileios Nakos</span>
<span class="title">Improved Sublinear-Time Edit Distance for Preprocessed Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.32">10.4230/LIPIcs.ICALP.2022.32</a>
</li>
<li>
<span class="authors">Caroline Brosse, Vincent Limouzy, and Arnaud Mary</span>
<span class="title">Polynomial Delay Algorithm for Minimal Chordal Completions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.33">10.4230/LIPIcs.ICALP.2022.33</a>
</li>
<li>
<span class="authors">David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie</span>
<span class="title">Unique Assembly Verification in Two-Handed Self-Assembly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.34">10.4230/LIPIcs.ICALP.2022.34</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, Kushagra Chatterjee, and Keerti Choudhary</span>
<span class="title">Pairwise Reachability Oracles and Preservers Under Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.35">10.4230/LIPIcs.ICALP.2022.35</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Chandrima Kayal, and Manaswi Paraashar</span>
<span class="title">Separations Between Combinatorial Measures for Transitive Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.36">10.4230/LIPIcs.ICALP.2022.36</a>
</li>
<li>
<span class="authors">Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, and Sorrachai Yingchareonthawornchai</span>
<span class="title">Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.37">10.4230/LIPIcs.ICALP.2022.37</a>
</li>
<li>
<span class="authors">Moses Charikar and Erik Waingarten</span>
<span class="title">Polylogarithmic Sketches for Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.38">10.4230/LIPIcs.ICALP.2022.38</a>
</li>
<li>
<span class="authors">Lin Chen, Xiaoyu Wu, and Guochuan Zhang</span>
<span class="title">Approximation Algorithms for Interdiction Problem with Packing Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.39">10.4230/LIPIcs.ICALP.2022.39</a>
</li>
<li>
<span class="authors">Ryder Chen, Jahanvi Khatkar, and Seeun William Umboh</span>
<span class="title">Online Weighted Cardinality Joint Replenishment Problem with Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.40">10.4230/LIPIcs.ICALP.2022.40</a>
</li>
<li>
<span class="authors">Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, and Jonathan Shi</span>
<span class="title">Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.41">10.4230/LIPIcs.ICALP.2022.41</a>
</li>
<li>
<span class="authors">Aleksander B. G. Christiansen and Eva Rotenberg</span>
<span class="title">Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.42">10.4230/LIPIcs.ICALP.2022.42</a>
</li>
<li>
<span class="authors">Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, and Amnon Ta-Shma</span>
<span class="title">Expander Random Walks: The General Case and Limitations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.43">10.4230/LIPIcs.ICALP.2022.43</a>
</li>
<li>
<span class="authors">Gil Cohen and Tal Yankovitz</span>
<span class="title">LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.44">10.4230/LIPIcs.ICALP.2022.44</a>
</li>
<li>
<span class="authors">Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Štefankovič, and Eric Vigoda</span>
<span class="title">Metastability of the Potts Ferromagnet on Random Regular Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.45">10.4230/LIPIcs.ICALP.2022.45</a>
</li>
<li>
<span class="authors">Jacobus Conradi and Anne Driemel</span>
<span class="title">On Computing the k-Shortcut Fréchet Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.46">10.4230/LIPIcs.ICALP.2022.46</a>
</li>
<li>
<span class="authors">Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý</span>
<span class="title">Streaming Algorithms for Geometric Steiner Forest</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.47">10.4230/LIPIcs.ICALP.2022.47</a>
</li>
<li>
<span class="authors">Varsha Dani, Josep Díaz, Thomas P. Hayes, and Cristopher Moore</span>
<span class="title">Improved Reconstruction of Random Geometric Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.48">10.4230/LIPIcs.ICALP.2022.48</a>
</li>
<li>
<span class="authors">Debarati Das, Tomasz Kociumaka, and Barna Saha</span>
<span class="title">Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.49">10.4230/LIPIcs.ICALP.2022.49</a>
</li>
<li>
<span class="authors">Mingyang Deng, Yael Kirkpatrick, Victor Rong, Virginia Vassilevska Williams, and Ziqian Zhong</span>
<span class="title">New Additive Approximations for Shortest Paths and Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.50">10.4230/LIPIcs.ICALP.2022.50</a>
</li>
<li>
<span class="authors">Amit Deshpande and Rameshwar Pratap</span>
<span class="title">One-Pass Additive-Error Subset Selection for 𝓁_p Subspace Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.51">10.4230/LIPIcs.ICALP.2022.51</a>
</li>
<li>
<span class="authors">Shyam S. Dhamapurkar, Shubham Vivek Pawar, and Jaikumar Radhakrishnan</span>
<span class="title">Set Membership with Two Classical and Quantum Bit Probes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.52">10.4230/LIPIcs.ICALP.2022.52</a>
</li>
<li>
<span class="authors">Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, and Peng Zhang</span>
<span class="title">Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.53">10.4230/LIPIcs.ICALP.2022.53</a>
</li>
<li>
<span class="authors">Ming Ding, Rasmus Kyng, and Peng Zhang</span>
<span class="title">Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.54">10.4230/LIPIcs.ICALP.2022.54</a>
</li>
<li>
<span class="authors">Dean Doron and Mary Wootters</span>
<span class="title">High-Probability List-Recovery, and Applications to Heavy Hitters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.55">10.4230/LIPIcs.ICALP.2022.55</a>
</li>
<li>
<span class="authors">Talya Eden, Dana Ron, and Will Rosenbaum</span>
<span class="title">Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.56">10.4230/LIPIcs.ICALP.2022.56</a>
</li>
<li>
<span class="authors">Charilaos Efthymiou</span>
<span class="title">On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.57">10.4230/LIPIcs.ICALP.2022.57</a>
</li>
<li>
<span class="authors">Louis Esperet and Sergey Norin</span>
<span class="title">Testability and Local Certification of Monotone Properties in Minor-Closed Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.58">10.4230/LIPIcs.ICALP.2022.58</a>
</li>
<li>
<span class="authors">Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, and Rico Zenklusen</span>
<span class="title">Streaming Submodular Maximization Under Matroid Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.59">10.4230/LIPIcs.ICALP.2022.59</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Meirav Zehavi</span>
<span class="title">(Re)packing Equal Disks into Rectangle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.60">10.4230/LIPIcs.ICALP.2022.60</a>
</li>
<li>
<span class="authors">Sebastian Forster and Tijn de Vos</span>
<span class="title">Faster Cut Sparsification of Weighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.61">10.4230/LIPIcs.ICALP.2022.61</a>
</li>
<li>
<span class="authors">Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, and Anna Melnichenko</span>
<span class="title">Social Distancing Network Creation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.62">10.4230/LIPIcs.ICALP.2022.62</a>
</li>
<li>
<span class="authors">Andreas Galanis, Daniel Štefankovič, and Eric Vigoda</span>
<span class="title">Approximating Observables Is as Hard as Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.63">10.4230/LIPIcs.ICALP.2022.63</a>
</li>
<li>
<span class="authors">Luyining Gan and Jie Han</span>
<span class="title">The Decision Problem for Perfect Matchings in Dense Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.64">10.4230/LIPIcs.ICALP.2022.64</a>
</li>
<li>
<span class="authors">Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan</span>
<span class="title">Fully Functional Parameterized Suffix Trees in Compact Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.65">10.4230/LIPIcs.ICALP.2022.65</a>
</li>
<li>
<span class="authors">Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, and Kirill Simonov</span>
<span class="title">The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.66">10.4230/LIPIcs.ICALP.2022.66</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski and Karol Pokorski</span>
<span class="title">Sublinear Dynamic Interval Scheduling (On One or Multiple Machines)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.67">10.4230/LIPIcs.ICALP.2022.67</a>
</li>
<li>
<span class="authors">Elahe Ghasemi, Vincent Jugé, and Ghazal Khalighinejad</span>
<span class="title">Galloping in Fast-Growth Natural Merge Sorts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.68">10.4230/LIPIcs.ICALP.2022.68</a>
</li>
<li>
<span class="authors">Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, and Sayantan Sen</span>
<span class="title">Tolerant Bipartiteness Testing in Dense Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.69">10.4230/LIPIcs.ICALP.2022.69</a>
</li>
<li>
<span class="authors">Martin Grohe, Gaurav Rattan, and Tim Seppelt</span>
<span class="title">Homomorphism Tensors and Linear Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.70">10.4230/LIPIcs.ICALP.2022.70</a>
</li>
<li>
<span class="authors">Nathaniel Harms and Yuichi Yoshida</span>
<span class="title">Downsampling for Testing and Learning in Product Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.71">10.4230/LIPIcs.ICALP.2022.71</a>
</li>
<li>
<span class="authors">Ishay Haviv</span>
<span class="title">A Fixed-Parameter Algorithm for the Kneser Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.72">10.4230/LIPIcs.ICALP.2022.72</a>
</li>
<li>
<span class="authors">Justin Holmgren, Andrea Lincoln, and Ron D. Rothblum</span>
<span class="title">Delegation for Search Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.73">10.4230/LIPIcs.ICALP.2022.73</a>
</li>
<li>
<span class="authors">Jakob Bæk Tejs Houen and Mikkel Thorup</span>
<span class="title">Understanding the Moments of Tabulation Hashing via Chaoses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.74">10.4230/LIPIcs.ICALP.2022.74</a>
</li>
<li>
<span class="authors">Ziyun Huang and Jinhui Xu</span>
<span class="title">In-Range Farthest Point Queries and Related Problem in High Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.75">10.4230/LIPIcs.ICALP.2022.75</a>
</li>
<li>
<span class="authors">Stavros D. Ioannidis, Bart de Keijzer, and Carmine Ventre</span>
<span class="title">Strong Approximations and Irrationality in Financial Networks with Derivatives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.76">10.4230/LIPIcs.ICALP.2022.76</a>
</li>
<li>
<span class="authors">Arun Jambulapati, Yujia Jin, Aaron Sidford, and Kevin Tian</span>
<span class="title">Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.77">10.4230/LIPIcs.ICALP.2022.77</a>
</li>
<li>
<span class="authors">Klaus Jansen, Arindam Khan, Marvin Lira, and K. V. N. Sreenivas</span>
<span class="title">A PTAS for Packing Hypercubes into a Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.78">10.4230/LIPIcs.ICALP.2022.78</a>
</li>
<li>
<span class="authors">Shunhua Jiang, Bento Natura, and Omri Weinstein</span>
<span class="title">A Faster Interior-Point Method for Sum-Of-Squares Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.79">10.4230/LIPIcs.ICALP.2022.79</a>
</li>
<li>
<span class="authors">Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, and Andreas Wiese</span>
<span class="title">Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.80">10.4230/LIPIcs.ICALP.2022.80</a>
</li>
<li>
<span class="authors">Sandra Kiefer and Daniel Neuen</span>
<span class="title">A Study of Weisfeiler-Leman Colorings on Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.81">10.4230/LIPIcs.ICALP.2022.81</a>
</li>
<li>
<span class="authors">Shimon Kogan and Merav Parter</span>
<span class="title">Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.82">10.4230/LIPIcs.ICALP.2022.82</a>
</li>
<li>
<span class="authors">Balagopal Komarath, Anurag Pandey, and Chengot Sankaramenon Rahul</span>
<span class="title">Monotone Arithmetic Complexity of Graph Homomorphism Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.83">10.4230/LIPIcs.ICALP.2022.83</a>
</li>
<li>
<span class="authors">Akash Kumar, Anand Louis, and Rameesh Paul</span>
<span class="title">Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.84">10.4230/LIPIcs.ICALP.2022.84</a>
</li>
<li>
<span class="authors">William Kuszmaul and Shyam Narayanan</span>
<span class="title">Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.85">10.4230/LIPIcs.ICALP.2022.85</a>
</li>
<li>
<span class="authors">Jakub Łącki and Yasamin Nazari</span>
<span class="title">Near-Optimal Decremental Hopsets with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.86">10.4230/LIPIcs.ICALP.2022.86</a>
</li>
<li>
<span class="authors">Alexandra Lassota, Aleksander Łukasiewicz, and Adam Polak</span>
<span class="title">Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.87">10.4230/LIPIcs.ICALP.2022.87</a>
</li>
<li>
<span class="authors">Clément Legrand-Duchesne, Ashutosh Rai, and Martin Tancer</span>
<span class="title">Parameterized Complexity of Untangling Knots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.88">10.4230/LIPIcs.ICALP.2022.88</a>
</li>
<li>
<span class="authors">Chao Liao, Qingyun Chen, Bundit Laekhanukit, and Yuhao Zhang</span>
<span class="title">Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.89">10.4230/LIPIcs.ICALP.2022.89</a>
</li>
<li>
<span class="authors">Bingkai Lin, Xuandi Ren, Yican Sun, and Xiuhan Wang</span>
<span class="title">On Lower Bounds of Approximating Parameterized k-Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.90">10.4230/LIPIcs.ICALP.2022.90</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Fahad Panolan, and M. S. Ramanujan</span>
<span class="title">Backdoor Sets on Nowhere Dense SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.91">10.4230/LIPIcs.ICALP.2022.91</a>
</li>
<li>
<span class="authors">Zhenjian Lu, Igor C. Oliveira, and Marius Zimand</span>
<span class="title">Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.92">10.4230/LIPIcs.ICALP.2022.92</a>
</li>
<li>
<span class="authors">Konrad Majewski, Tomáš Masařík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, and Marek Sokołowski</span>
<span class="title">Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.93">10.4230/LIPIcs.ICALP.2022.93</a>
</li>
<li>
<span class="authors">Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu</span>
<span class="title">Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.94">10.4230/LIPIcs.ICALP.2022.94</a>
</li>
<li>
<span class="authors">Claire Mathieu and Hang Zhou</span>
<span class="title">A PTAS for Capacitated Vehicle Routing on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.95">10.4230/LIPIcs.ICALP.2022.95</a>
</li>
<li>
<span class="authors">Andrew McGregor and Rik Sengupta</span>
<span class="title">Graph Reconstruction from Random Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.96">10.4230/LIPIcs.ICALP.2022.96</a>
</li>
<li>
<span class="authors">Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, and Xinyu Wu</span>
<span class="title">The SDP Value of Random 2CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.97">10.4230/LIPIcs.ICALP.2022.97</a>
</li>
<li>
<span class="authors">Ilan Newman and Nithin Varma</span>
<span class="title">Strongly Sublinear Algorithms for Testing Pattern Freeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.98">10.4230/LIPIcs.ICALP.2022.98</a>
</li>
<li>
<span class="authors">Takaaki Nishimoto, Shunsuke Kanda, and Yasuo Tabei</span>
<span class="title">An Optimal-Time RLBWT Construction in BWT-Runs Bounded Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.99">10.4230/LIPIcs.ICALP.2022.99</a>
</li>
<li>
<span class="authors">Theodoros Papamakarios and Alexander Razborov</span>
<span class="title">Space Characterizations of Complexity Measures and Size-Space Trade-Offs in Propositional Proof Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.100">10.4230/LIPIcs.ICALP.2022.100</a>
</li>
<li>
<span class="authors">Ján Pich and Rahul Santhanam</span>
<span class="title">Learning Algorithms Versus Automatability of Frege Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.101">10.4230/LIPIcs.ICALP.2022.101</a>
</li>
<li>
<span class="authors">Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk, and Alexandre Vigny</span>
<span class="title">Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.102">10.4230/LIPIcs.ICALP.2022.102</a>
</li>
<li>
<span class="authors">Guoliang Qiu, Yanheng Wang, and Chihao Zhang</span>
<span class="title">A Perfect Sampler for Hypergraph Independent Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.103">10.4230/LIPIcs.ICALP.2022.103</a>
</li>
<li>
<span class="authors">Nicolas Resch and Chen Yuan</span>
<span class="title">Threshold Rates of Code Ensembles: Linear Is Best</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.104">10.4230/LIPIcs.ICALP.2022.104</a>
</li>
<li>
<span class="authors">Ittai Rubinstein</span>
<span class="title">Explicit and Efficient Construction of Nearly Optimal Rate Codes for the Binary Deletion Channel and the Poisson Repeat Channel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.105">10.4230/LIPIcs.ICALP.2022.105</a>
</li>
<li>
<span class="authors">Aviad Rubinstein and Junyao Zhao</span>
<span class="title">Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.106">10.4230/LIPIcs.ICALP.2022.106</a>
</li>
<li>
<span class="authors">Jakub Tětek</span>
<span class="title">Approximate Triangle Counting via Sampling and Fast Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.107">10.4230/LIPIcs.ICALP.2022.107</a>
</li>
<li>
<span class="authors">Penghui Yao, Yitong Yin, and Xinyuan Zhang</span>
<span class="title">Polynomial-Time Approximation of Zero-Free Partition Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.108">10.4230/LIPIcs.ICALP.2022.108</a>
</li>
<li>
<span class="authors">Tianyi Zhang</span>
<span class="title">Faster Cut-Equivalent Trees in Simple Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.109">10.4230/LIPIcs.ICALP.2022.109</a>
</li>
<li>
<span class="authors">Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz, and Mateusz Skomra</span>
<span class="title">Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.110">10.4230/LIPIcs.ICALP.2022.110</a>
</li>
<li>
<span class="authors">Djamel Eddine Amir and Mathieu Hoyrup</span>
<span class="title">Computability of Finite Simplicial Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.111">10.4230/LIPIcs.ICALP.2022.111</a>
</li>
<li>
<span class="authors">David Barozzini, Paweł Parys, and Jan Wróblewski</span>
<span class="title">Unboundedness for Recursion Schemes: A Simpler Type System</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.112">10.4230/LIPIcs.ICALP.2022.112</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Nicolas Markey, Ocan Sankur, and Nicolas Waldburger</span>
<span class="title">Parameterized Safety Verification of Round-Based Shared-Memory Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.113">10.4230/LIPIcs.ICALP.2022.113</a>
</li>
<li>
<span class="authors">León Bohn and Christof Löding</span>
<span class="title">Passive Learning of Deterministic Büchi Automata by Combinations of DFAs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.114">10.4230/LIPIcs.ICALP.2022.114</a>
</li>
<li>
<span class="authors">Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, and Jean-François Raskin</span>
<span class="title">Strategy Synthesis for Global Window PCTL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.115">10.4230/LIPIcs.ICALP.2022.115</a>
</li>
<li>
<span class="authors">Léonard Brice, Jean-François Raskin, and Marie van den Bogaard</span>
<span class="title">The Complexity of SPEs in Mean-Payoff Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.116">10.4230/LIPIcs.ICALP.2022.116</a>
</li>
<li>
<span class="authors">Antonio Casares, Thomas Colcombet, and Karoliina Lehtinen</span>
<span class="title">On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.117">10.4230/LIPIcs.ICALP.2022.117</a>
</li>
<li>
<span class="authors">Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, and Raghunath Tewari</span>
<span class="title">Dynamic Meta-Theorems for Distance and Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.118">10.4230/LIPIcs.ICALP.2022.118</a>
</li>
<li>
<span class="authors">Niel de Beaudrap, Aleks Kissinger, and John van de Wetering</span>
<span class="title">Circuit Extraction for ZX-Diagrams Can Be #P-Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.119">10.4230/LIPIcs.ICALP.2022.119</a>
</li>
<li>
<span class="authors">Gaëtan Douéneau-Tabot</span>
<span class="title">Hiding Pebbles When the Output Alphabet Is Unary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.120">10.4230/LIPIcs.ICALP.2022.120</a>
</li>
<li>
<span class="authors">Amina Doumane</span>
<span class="title">Regular Expressions for Tree-Width 2 Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.121">10.4230/LIPIcs.ICALP.2022.121</a>
</li>
<li>
<span class="authors">Léo Exibard, Emmanuel Filiot, and Ayrat Khalimov</span>
<span class="title">A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.122">10.4230/LIPIcs.ICALP.2022.122</a>
</li>
<li>
<span class="authors">Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk</span>
<span class="title">Twin-Width and Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.123">10.4230/LIPIcs.ICALP.2022.123</a>
</li>
<li>
<span class="authors">Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, and Georg Zetzsche</span>
<span class="title">Reachability in Bidirected Pushdown VASS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.124">10.4230/LIPIcs.ICALP.2022.124</a>
</li>
<li>
<span class="authors">Hugo Gimbert, Corto Mascle, Anca Muscholl, and Igor Walukiewicz</span>
<span class="title">Distributed Controller Synthesis for Deadlock Avoidance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.125">10.4230/LIPIcs.ICALP.2022.125</a>
</li>
<li>
<span class="authors">Mika Göös, Stefan Kiefer, and Weiqiang Yuan</span>
<span class="title">Lower Bounds for Unambiguous Automata via Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.126">10.4230/LIPIcs.ICALP.2022.126</a>
</li>
<li>
<span class="authors">Paweł M. Idziak, Piotr Kawałek, Jacek Krzaczkowski, and Armin Weiß</span>
<span class="title">Satisfiability Problems for Finite Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.127">10.4230/LIPIcs.ICALP.2022.127</a>
</li>
<li>
<span class="authors">Tamio-Vesa Nakajima and Stanislav Živný</span>
<span class="title">Linearly Ordered Colourings of Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.128">10.4230/LIPIcs.ICALP.2022.128</a>
</li>
<li>
<span class="authors">Jakob Piribauer, Ocan Sankur, and Christel Baier</span>
<span class="title">The Variance-Penalized Stochastic Shortest Path Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.129">10.4230/LIPIcs.ICALP.2022.129</a>
</li>
<li>
<span class="authors">Enguerrand Prebet</span>
<span class="title">Functions and References in the Pi-Calculus: Full Abstraction and Proof Techniques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.130">10.4230/LIPIcs.ICALP.2022.130</a>
</li>
<li>
<span class="authors">Ville Salo and Ilkka Törmä</span>
<span class="title">What Can Oracles Teach Us About the Ultimate Fate of Life?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.131">10.4230/LIPIcs.ICALP.2022.131</a>
</li>
<li>
<span class="authors">Todd Schmid, Wojciech Różowski, Jurriaan Rot, and Alexandra Silva</span>
<span class="title">Processes Parametrised by an Algebraic Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.132">10.4230/LIPIcs.ICALP.2022.132</a>
</li>
<li>
<span class="authors">D. M. Stull</span>
<span class="title">The Dimension Spectrum Conjecture for Planar Lines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2022.133">10.4230/LIPIcs.ICALP.2022.133</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