<h2>LIPIcs, Volume 254, STACS 2023</h2>
<ul>
<li>
<span class="authors">Petra Berenbrink, Patricia Bouyer, Anuj Dawar, and Mamadou Moustapha Kanté</span>
<span class="title">LIPIcs, Volume 254, STACS 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023">10.4230/LIPIcs.STACS.2023</a>
</li>
<li>
<span class="authors">Petra Berenbrink, Patricia Bouyer, Anuj Dawar, and Mamadou Moustapha Kanté</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.0">10.4230/LIPIcs.STACS.2023.0</a>
</li>
<li>
<span class="authors">Karoliina Lehtinen</span>
<span class="title">A Brief History of History-Determinism (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.1">10.4230/LIPIcs.STACS.2023.1</a>
</li>
<li>
<span class="authors">Eva Rotenberg</span>
<span class="title">Amortised Analysis of Dynamic Data Structures (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.2">10.4230/LIPIcs.STACS.2023.2</a>
</li>
<li>
<span class="authors">Moshe Y. Vardi</span>
<span class="title">Logical Algorithmics: From Theory to Practice (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.3">10.4230/LIPIcs.STACS.2023.3</a>
</li>
<li>
<span class="authors">Erhard Aichinger and Simon Grünbacher</span>
<span class="title">The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.4">10.4230/LIPIcs.STACS.2023.4</a>
</li>
<li>
<span class="authors">Maxim Akhmedov and Maxim Babenko</span>
<span class="title">Packing Odd Walks and Trails in Multiterminal Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.5">10.4230/LIPIcs.STACS.2023.5</a>
</li>
<li>
<span class="authors">Cezar-Mihail Alexandru, Pavel Dvořák, Christian Konrad, and Kheeran K. Naidu</span>
<span class="title">Improved Weighted Matching in the Sliding Window Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.6">10.4230/LIPIcs.STACS.2023.6</a>
</li>
<li>
<span class="authors">Georgios Amanatidis and Pieter Kleer</span>
<span class="title">Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.7">10.4230/LIPIcs.STACS.2023.7</a>
</li>
<li>
<span class="authors">Antoine Amarilli and Mikaël Monet</span>
<span class="title">Enumerating Regular Languages with Bounded Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.8">10.4230/LIPIcs.STACS.2023.8</a>
</li>
<li>
<span class="authors">Pascal Baumann, Roland Meyer, and Georg Zetzsche</span>
<span class="title">Regular Separability in Büchi VASS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.9">10.4230/LIPIcs.STACS.2023.9</a>
</li>
<li>
<span class="authors">Pierre Bergé, Édouard Bonnet, Hugues Déprés, and Rémi Watrigant</span>
<span class="title">Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.10">10.4230/LIPIcs.STACS.2023.10</a>
</li>
<li>
<span class="authors">Benjamin Bergougnoux, Tuukka Korhonen, and Jesper Nederlof</span>
<span class="title">Tight Lower Bounds for Problems Parameterized by Rank-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.11">10.4230/LIPIcs.STACS.2023.11</a>
</li>
<li>
<span class="authors">Markus Bläser, Hendrik Mayer, and Devansh Shringi</span>
<span class="title">On the Multilinear Complexity of Associative Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.12">10.4230/LIPIcs.STACS.2023.12</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, and Daniel Stephan</span>
<span class="title">Strongly Hyperbolic Unit Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.13">10.4230/LIPIcs.STACS.2023.13</a>
</li>
<li>
<span class="authors">Narek Bojikian, Vera Chekan, Falko Hegerfeld, and Stefan Kratsch</span>
<span class="title">Tight Bounds for Connectivity Problems Parameterized by Cutwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.14">10.4230/LIPIcs.STACS.2023.14</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, and Stéphan Thomassé</span>
<span class="title">Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.15">10.4230/LIPIcs.STACS.2023.15</a>
</li>
<li>
<span class="authors">Nader H. Bshouty</span>
<span class="title">Non-Adaptive Proper Learning Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.16">10.4230/LIPIcs.STACS.2023.16</a>
</li>
<li>
<span class="authors">Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian Schmidt, Alexandru I. Tomescu, and Elia C. Zirondelli</span>
<span class="title">Cut Paths and Their Remainder Structure, with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.17">10.4230/LIPIcs.STACS.2023.17</a>
</li>
<li>
<span class="authors">Florent Capelli and Yann Strozecki</span>
<span class="title">Geometric Amortization of Enumeration Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.18">10.4230/LIPIcs.STACS.2023.18</a>
</li>
<li>
<span class="authors">Arnaud Carayol, Philippe Duchon, Florent Koechlin, and Cyril Nicaud</span>
<span class="title">One Drop of Non-Determinism in a Random Deterministic Automaton</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.19">10.4230/LIPIcs.STACS.2023.19</a>
</li>
<li>
<span class="authors">Dror Chawin and Ishay Haviv</span>
<span class="title">Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.20">10.4230/LIPIcs.STACS.2023.20</a>
</li>
<li>
<span class="authors">Sravanthi Chede and Anil Shukla</span>
<span class="title">Extending Merge Resolution to a Family of QBF-Proof Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.21">10.4230/LIPIcs.STACS.2023.21</a>
</li>
<li>
<span class="authors">Suryajith Chillara, Coral Grichener, and Amir Shpilka</span>
<span class="title">On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.22">10.4230/LIPIcs.STACS.2023.22</a>
</li>
<li>
<span class="authors">Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, and Neal E. Young</span>
<span class="title">Online Paging with Heterogeneous Cache Slots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.23">10.4230/LIPIcs.STACS.2023.23</a>
</li>
<li>
<span class="authors">Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, and Michał Pilipczuk</span>
<span class="title">On Rational Recursive Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.24">10.4230/LIPIcs.STACS.2023.24</a>
</li>
<li>
<span class="authors">Ruiwen Dong</span>
<span class="title">Semigroup Intersection Problems in the Heisenberg Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.25">10.4230/LIPIcs.STACS.2023.25</a>
</li>
<li>
<span class="authors">Ruiwen Dong</span>
<span class="title">Solving Homogeneous Linear Equations over Polynomial Semirings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.26">10.4230/LIPIcs.STACS.2023.26</a>
</li>
<li>
<span class="authors">Marc Dufay, Claire Mathieu, and Hang Zhou</span>
<span class="title">An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.27">10.4230/LIPIcs.STACS.2023.27</a>
</li>
<li>
<span class="authors">Zdeněk Dvořák</span>
<span class="title">Representation of Short Distances in Structurally Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.28">10.4230/LIPIcs.STACS.2023.28</a>
</li>
<li>
<span class="authors">Nicolas El Maalouly</span>
<span class="title">Exact Matching: Algorithms and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.29">10.4230/LIPIcs.STACS.2023.29</a>
</li>
<li>
<span class="authors">Jessica Enright, Kitty Meeks, and Hendrik Molter</span>
<span class="title">Counting Temporal Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.30">10.4230/LIPIcs.STACS.2023.30</a>
</li>
<li>
<span class="authors">Ora Nova Fandina, Mikael Møller Høgsgaard, and Kasper Green Larsen</span>
<span class="title">Barriers for Faster Dimensionality Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.31">10.4230/LIPIcs.STACS.2023.31</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Ismaël Jecker, Christof Löding, and Sarah Winter</span>
<span class="title">A Regular and Complete Notion of Delay for Streaming String Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.32">10.4230/LIPIcs.STACS.2023.32</a>
</li>
<li>
<span class="authors">Leszek Gąsieniec, Paul G. Spirakis, and Grzegorz Stachowiak</span>
<span class="title">New Clocks, Optimal Line Formation and Self-Replication Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.33">10.4230/LIPIcs.STACS.2023.33</a>
</li>
<li>
<span class="authors">Valentin Gledel and Nacim Oijid</span>
<span class="title">Avoidance Games Are PSPACE-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.34">10.4230/LIPIcs.STACS.2023.34</a>
</li>
<li>
<span class="authors">Klaus Heeger, André Nichterlein, and Rolf Niedermeier</span>
<span class="title">Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.35">10.4230/LIPIcs.STACS.2023.35</a>
</li>
<li>
<span class="authors">Monika Henzinger, Stefan Neumann, Harald Räcke, and Stefan Schmid</span>
<span class="title">Dynamic Maintenance of Monotone Dynamic Programs and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.36">10.4230/LIPIcs.STACS.2023.36</a>
</li>
<li>
<span class="authors">Shengyu Huang, Chih-Hung Liu, and Daniel Rutschmann</span>
<span class="title">Approximate Selection with Unreliable Comparisons in Optimal Expected Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.37">10.4230/LIPIcs.STACS.2023.37</a>
</li>
<li>
<span class="authors">Reijo Jaakkola, Antti Kuusisto, and Miikka Vilander</span>
<span class="title">Relating Description Complexity to Entropy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.38">10.4230/LIPIcs.STACS.2023.38</a>
</li>
<li>
<span class="authors">Tomohiro Koana</span>
<span class="title">Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.39">10.4230/LIPIcs.STACS.2023.39</a>
</li>
<li>
<span class="authors">Balagopal Komarath, Anant Kumar, Suchismita Mishra, and Aditi Sethia</span>
<span class="title">Finding and Counting Patterns in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.40">10.4230/LIPIcs.STACS.2023.40</a>
</li>
<li>
<span class="authors">Christian Konrad, Kheeran K. Naidu, and Arun Steward</span>
<span class="title">Maximum Matching via Maximal Matching Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.41">10.4230/LIPIcs.STACS.2023.41</a>
</li>
<li>
<span class="authors">François Le Gall, Masayuki Miyamoto, and Harumichi Nishimura</span>
<span class="title">Distributed Quantum Interactive Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.42">10.4230/LIPIcs.STACS.2023.42</a>
</li>
<li>
<span class="authors">Benjamin Lévêque, Moritz Mühlenthaler, and Thomas Suzan</span>
<span class="title">Reconfiguration of Digraph Homomorphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.43">10.4230/LIPIcs.STACS.2023.43</a>
</li>
<li>
<span class="authors">Haohong Li and Ge Xia</span>
<span class="title">An 𝒪(3.82^k) Time FPT Algorithm for Convex Flip Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.44">10.4230/LIPIcs.STACS.2023.44</a>
</li>
<li>
<span class="authors">Dimitrios Los and Thomas Sauerwald</span>
<span class="title">Tight Bounds for Repeated Balls-Into-Bins</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.45">10.4230/LIPIcs.STACS.2023.45</a>
</li>
<li>
<span class="authors">Konrad Majewski, Michał Pilipczuk, and Marek Sokołowski</span>
<span class="title">Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.46">10.4230/LIPIcs.STACS.2023.46</a>
</li>
<li>
<span class="authors">Augusto Modanese</span>
<span class="title">Sublinear-Time Probabilistic Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.47">10.4230/LIPIcs.STACS.2023.47</a>
</li>
<li>
<span class="authors">Satyadev Nandakumar and Subin Pulari</span>
<span class="title">Real Numbers Equally Compressible in Every Base</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.48">10.4230/LIPIcs.STACS.2023.48</a>
</li>
<li>
<span class="authors">Naoto Ohsaka</span>
<span class="title">Gap Preserving Reductions Between Reconfiguration Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.49">10.4230/LIPIcs.STACS.2023.49</a>
</li>
<li>
<span class="authors">Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki, and Anna Zych-Pawlewicz</span>
<span class="title">Dynamic Data Structures for Parameterized String Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.50">10.4230/LIPIcs.STACS.2023.50</a>
</li>
<li>
<span class="authors">Charles Paperman, Sylvain Salvati, and Claire Soyez-Martin</span>
<span class="title">An Algebraic Approach to Vectorial Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.51">10.4230/LIPIcs.STACS.2023.51</a>
</li>
<li>
<span class="authors">Gwenaël Richomme and Matthieu Rosenfeld</span>
<span class="title">Reconstructing Words Using Queries on Subwords or Factors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.52">10.4230/LIPIcs.STACS.2023.52</a>
</li>
<li>
<span class="authors">Yaniv Sadeh and Haim Kaplan</span>
<span class="title">Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.53">10.4230/LIPIcs.STACS.2023.53</a>
</li>
<li>
<span class="authors">James D. Watson, Johannes Bausch, and Sevag Gharibian</span>
<span class="title">The Complexity of Translationally Invariant Problems Beyond Ground State Energies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.54">10.4230/LIPIcs.STACS.2023.54</a>
</li>
<li>
<span class="authors">Philipp Zschoche</span>
<span class="title">Restless Temporal Path Parameterized Above Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2023.55">10.4230/LIPIcs.STACS.2023.55</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