<h2>LIPIcs, Volume 219, STACS 2022</h2>
<ul>
<li>
<span class="authors">Petra Berenbrink and Benjamin Monmege</span>
<span class="title">LIPIcs, Volume 219, STACS 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022">10.4230/LIPIcs.STACS.2022</a>
</li>
<li>
<span class="authors">Petra Berenbrink and Benjamin Monmege</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.0">10.4230/LIPIcs.STACS.2022.0</a>
</li>
<li>
<span class="authors">Marie Albenque</span>
<span class="title">Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.1">10.4230/LIPIcs.STACS.2022.1</a>
</li>
<li>
<span class="authors">Maria-Florina Balcan</span>
<span class="title">Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.2">10.4230/LIPIcs.STACS.2022.2</a>
</li>
<li>
<span class="authors">Fabian Kuhn</span>
<span class="title">Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.3">10.4230/LIPIcs.STACS.2022.3</a>
</li>
<li>
<span class="authors">Ramtin Afshar, Michael T. Goodrich, Pedro Matias, and Martha C. Osegueda</span>
<span class="title">Mapping Networks via Parallel kth-Hop Traceroute Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.4">10.4230/LIPIcs.STACS.2022.4</a>
</li>
<li>
<span class="authors">S. Akshay, Hugo Bazille, Blaise Genest, and Mihir Vahanwala</span>
<span class="title">On Robustness for the Skolem and Positivity Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.5">10.4230/LIPIcs.STACS.2022.5</a>
</li>
<li>
<span class="authors">Yacine Al-Najjar, Walid Ben-Ameur, and Jérémie Leguay</span>
<span class="title">Approximability of Robust Network Design: The Directed Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.6">10.4230/LIPIcs.STACS.2022.6</a>
</li>
<li>
<span class="authors">Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, and Georg Zetzsche</span>
<span class="title">Existential Definability over the Subword Ordering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.7">10.4230/LIPIcs.STACS.2022.7</a>
</li>
<li>
<span class="authors">Nikolay Bazhenov, Dariusz Kalociński, and Michał Wrocławski</span>
<span class="title">Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.8">10.4230/LIPIcs.STACS.2022.8</a>
</li>
<li>
<span class="authors">Pierre Bergé, Guillaume Ducoffe, and Michel Habib</span>
<span class="title">Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.9">10.4230/LIPIcs.STACS.2022.9</a>
</li>
<li>
<span class="authors">Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra</span>
<span class="title">Faster Counting and Sampling Algorithms Using Colorful Decision Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.10">10.4230/LIPIcs.STACS.2022.10</a>
</li>
<li>
<span class="authors">Laurent Bienvenu, Valentino Delle Rose, and Tomasz Steifer</span>
<span class="title">Probabilistic vs Deterministic Gamblers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.11">10.4230/LIPIcs.STACS.2022.11</a>
</li>
<li>
<span class="authors">Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, and Mirko Rossi</span>
<span class="title">Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.12">10.4230/LIPIcs.STACS.2022.12</a>
</li>
<li>
<span class="authors">Ahmad Biniaz, Majid Daliri, and Amir Hossein Moradpour</span>
<span class="title">A 10-Approximation of the π/2-MST</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.13">10.4230/LIPIcs.STACS.2022.13</a>
</li>
<li>
<span class="authors">Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, and Jin Young Son</span>
<span class="title">On Explicit Constructions of Extremely Depth Robust Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.14">10.4230/LIPIcs.STACS.2022.14</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, and Kunihiro Wasa</span>
<span class="title">Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.15">10.4230/LIPIcs.STACS.2022.15</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Mickael Randour, and Pierre Vandenhove</span>
<span class="title">Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.16">10.4230/LIPIcs.STACS.2022.16</a>
</li>
<li>
<span class="authors">Nader H. Bshouty and Catherine A. Haddad-Zaknoon</span>
<span class="title">On Testing Decision Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.17">10.4230/LIPIcs.STACS.2022.17</a>
</li>
<li>
<span class="authors">Andrei A. Bulatov and Akbar Rafiey</span>
<span class="title">The Ideal Membership Problem and Abelian Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.18">10.4230/LIPIcs.STACS.2022.18</a>
</li>
<li>
<span class="authors">Antonin Callard and Benjamin Hellouin de Menibus</span>
<span class="title">The Aperiodic Domino Problem in Higher Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.19">10.4230/LIPIcs.STACS.2022.19</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, and Ronald de Wolf</span>
<span class="title">Symmetry and Quantum Query-To-Communication Simulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.20">10.4230/LIPIcs.STACS.2022.20</a>
</li>
<li>
<span class="authors">Jianer Chen, Qin Huang, Iyad Kanj, and Ge Xia</span>
<span class="title">Near-Optimal Algorithms for Point-Line Covering Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.21">10.4230/LIPIcs.STACS.2022.21</a>
</li>
<li>
<span class="authors">Leroy Chew and Friedrich Slivovsky</span>
<span class="title">Towards Uniform Certification in QBF</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.22">10.4230/LIPIcs.STACS.2022.22</a>
</li>
<li>
<span class="authors">Yung-Chung Chiu and Hsueh-I Lu</span>
<span class="title">Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.23">10.4230/LIPIcs.STACS.2022.23</a>
</li>
<li>
<span class="authors">Stefan Dantchev, Nicola Galesi, Abdul Ghani, and Barnaby Martin</span>
<span class="title">Depth Lower Bounds in Stabbing Planes for Combinatorial Principles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.24">10.4230/LIPIcs.STACS.2022.24</a>
</li>
<li>
<span class="authors">Bireswar Das, Anant Kumar, Shivdutt Sharma, and Dhara Thakkar</span>
<span class="title">Linear Space Data Structures for Finite Groups with Constant Query-Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.25">10.4230/LIPIcs.STACS.2022.25</a>
</li>
<li>
<span class="authors">Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, and Armin Weiß</span>
<span class="title">The Isomorphism Problem for Plain Groups Is in Σ₃^{𝖯}</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.26">10.4230/LIPIcs.STACS.2022.26</a>
</li>
<li>
<span class="authors">Michael Elkin and Ofer Neiman</span>
<span class="title">Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.27">10.4230/LIPIcs.STACS.2022.27</a>
</li>
<li>
<span class="authors">Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder</span>
<span class="title">Cardinality Constrained Scheduling in Online Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.28">10.4230/LIPIcs.STACS.2022.28</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, and Saket Saurabh</span>
<span class="title">Detours in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.29">10.4230/LIPIcs.STACS.2022.29</a>
</li>
<li>
<span class="authors">Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken</span>
<span class="title">Delay-Robust Routes in Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.30">10.4230/LIPIcs.STACS.2022.30</a>
</li>
<li>
<span class="authors">Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, and Yu Yokoi</span>
<span class="title">Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.31">10.4230/LIPIcs.STACS.2022.31</a>
</li>
<li>
<span class="authors">Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, and Hanna Sumita</span>
<span class="title">Online Scheduling on Identical Machines with a Metric State Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.32">10.4230/LIPIcs.STACS.2022.32</a>
</li>
<li>
<span class="authors">Éric Goubault, Jérémy Ledent, and Sergio Rajsbaum</span>
<span class="title">A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.33">10.4230/LIPIcs.STACS.2022.33</a>
</li>
<li>
<span class="authors">Petr Gregor, Torsten Mütze, and Arturo Merino</span>
<span class="title">Star Transposition Gray Codes for Multiset Permutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.34">10.4230/LIPIcs.STACS.2022.34</a>
</li>
<li>
<span class="authors">Sander Gribling and Harold Nieuwboer</span>
<span class="title">Improved Quantum Lower and Upper Bounds for Matrix Scaling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.35">10.4230/LIPIcs.STACS.2022.35</a>
</li>
<li>
<span class="authors">Carla Groenland, Isja Mannens, Jesper Nederlof, and Krisztina Szilágyi</span>
<span class="title">Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.36">10.4230/LIPIcs.STACS.2022.36</a>
</li>
<li>
<span class="authors">Paweł M. Idziak, Piotr Kawałek, and Jacek Krzaczkowski</span>
<span class="title">Satisfiability of Circuits and Equations over Finite Malcev Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.37">10.4230/LIPIcs.STACS.2022.37</a>
</li>
<li>
<span class="authors">Lars Jaffke, O-joung Kwon, and Jan Arne Telle</span>
<span class="title">Classes of Intersection Digraphs with Good Algorithmic Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.38">10.4230/LIPIcs.STACS.2022.38</a>
</li>
<li>
<span class="authors">Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, and Saket Saurabh</span>
<span class="title">Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.39">10.4230/LIPIcs.STACS.2022.39</a>
</li>
<li>
<span class="authors">Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, and Sang-il Oum</span>
<span class="title">Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.40">10.4230/LIPIcs.STACS.2022.40</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Fairly Popular Matchings and Optimality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.41">10.4230/LIPIcs.STACS.2022.41</a>
</li>
<li>
<span class="authors">Tomohiro Koana, Christian Komusiewicz, André Nichterlein, and Frank Sommer</span>
<span class="title">Covering Many (Or Few) Edges with k Vertices in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.42">10.4230/LIPIcs.STACS.2022.42</a>
</li>
<li>
<span class="authors">Alexander Kozachinskiy</span>
<span class="title">One-To-Two-Player Lifting for Mildly Growing Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.43">10.4230/LIPIcs.STACS.2022.43</a>
</li>
<li>
<span class="authors">Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, and Anamay Tengse</span>
<span class="title">If VNP Is Hard, Then so Are Equations for It</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.44">10.4230/LIPIcs.STACS.2022.44</a>
</li>
<li>
<span class="authors">Michael Lampis</span>
<span class="title">Determining a Slater Winner Is Complete for Parallel Access to NP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.45">10.4230/LIPIcs.STACS.2022.45</a>
</li>
<li>
<span class="authors">Sławomir Lasota</span>
<span class="title">Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.46">10.4230/LIPIcs.STACS.2022.46</a>
</li>
<li>
<span class="authors">Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang</span>
<span class="title">Scheduling with Communication Delay in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.47">10.4230/LIPIcs.STACS.2022.47</a>
</li>
<li>
<span class="authors">Jack H. Lutz, Neil Lutz, and Elvira Mayordomo</span>
<span class="title">Extending the Reach of the Point-To-Set Principle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.48">10.4230/LIPIcs.STACS.2022.48</a>
</li>
<li>
<span class="authors">Nikhil S. Mande, Swagato Sanyal, and Suhail Sherif</span>
<span class="title">One-Way Communication Complexity and Non-Adaptive Decision Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.49">10.4230/LIPIcs.STACS.2022.49</a>
</li>
<li>
<span class="authors">Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, and Karol Węgrzycki</span>
<span class="title">Isolation Schemes for Problems on Decomposable Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.50">10.4230/LIPIcs.STACS.2022.50</a>
</li>
<li>
<span class="authors">Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, and Guillaume Theyssier</span>
<span class="title">Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.51">10.4230/LIPIcs.STACS.2022.51</a>
</li>
<li>
<span class="authors">Michał Pilipczuk, Marek Sokołowski, and Anna Zych-Pawlewicz</span>
<span class="title">Compact Representation for Matrices of Bounded Twin-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.52">10.4230/LIPIcs.STACS.2022.52</a>
</li>
<li>
<span class="authors">C. Ramya and Anamay Tengse</span>
<span class="title">On Finer Separations Between Subclasses of Read-Once Oblivious ABPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.53">10.4230/LIPIcs.STACS.2022.53</a>
</li>
<li>
<span class="authors">Hanlin Ren and Rahul Santhanam</span>
<span class="title">A Relativization Perspective on Meta-Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.54">10.4230/LIPIcs.STACS.2022.54</a>
</li>
<li>
<span class="authors">András Z. Salamon and Michael Wehar</span>
<span class="title">Superlinear Lower Bounds Based on ETH</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.55">10.4230/LIPIcs.STACS.2022.55</a>
</li>
<li>
<span class="authors">Martin Škoviera and Peter Varša</span>
<span class="title">NP-Completeness of Perfect Matching Index of Cubic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.56">10.4230/LIPIcs.STACS.2022.56</a>
</li>
<li>
<span class="authors">D. M. Stull</span>
<span class="title">Optimal Oracles for Point-To-Set Principles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.57">10.4230/LIPIcs.STACS.2022.57</a>
</li>
<li>
<span class="authors">Takeshi Tokuyama and Ryo Yoshimura</span>
<span class="title">High Quality Consistent Digital Curved Rays via Vector Field Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.58">10.4230/LIPIcs.STACS.2022.58</a>
</li>
<li>
<span class="authors">Christopher Williamson</span>
<span class="title">Sharp Indistinguishability Bounds from Non-Uniform Approximations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.59">10.4230/LIPIcs.STACS.2022.59</a>
</li>
<li>
<span class="authors">Xinyu Wu</span>
<span class="title">Analyzing XOR-Forrelation Through Stochastic Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2022.60">10.4230/LIPIcs.STACS.2022.60</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