<h2>LIPIcs, Volume 289, STACS 2024</h2>
<ul>
<li>
<span class="authors">Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, and Daniel Lokshtanov</span>
<span class="title">LIPIcs, Volume 289, STACS 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024">10.4230/LIPIcs.STACS.2024</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, and Daniel Lokshtanov</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.0">10.4230/LIPIcs.STACS.2024.0</a>
</li>
<li>
<span class="authors">Igor C. Oliveira</span>
<span class="title">Polynomial-Time Pseudodeterministic Constructions (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.1">10.4230/LIPIcs.STACS.2024.1</a>
</li>
<li>
<span class="authors">Sofya Raskhodnikova</span>
<span class="title">The Role of Local Algorithms in Privacy (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.2">10.4230/LIPIcs.STACS.2024.2</a>
</li>
<li>
<span class="authors">Szymon Toruńczyk</span>
<span class="title">Structurally Tractable Graph Classes (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.3">10.4230/LIPIcs.STACS.2024.3</a>
</li>
<li>
<span class="authors">Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, and Paweł Rzążewski</span>
<span class="title">Max Weight Independent Set in Sparse Graphs with No Long Claws</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.4">10.4230/LIPIcs.STACS.2024.4</a>
</li>
<li>
<span class="authors">C. Aiswarya, Soumodev Mal, and Prakash Saivasan</span>
<span class="title">Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.5">10.4230/LIPIcs.STACS.2024.5</a>
</li>
<li>
<span class="authors">V. Arvind, Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky</span>
<span class="title">On a Hierarchy of Spectral Invariants for Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.6">10.4230/LIPIcs.STACS.2024.6</a>
</li>
<li>
<span class="authors">Jakub Balabán, Robert Ganian, and Mathis Rocton</span>
<span class="title">Computing Twin-Width Parameterized by the Feedback Edge Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.7">10.4230/LIPIcs.STACS.2024.7</a>
</li>
<li>
<span class="authors">Max Bannach, Florian Andreas Marwitz, and Till Tantau</span>
<span class="title">Faster Graph Algorithms Through DAG Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.8">10.4230/LIPIcs.STACS.2024.8</a>
</li>
<li>
<span class="authors">Omkar Baraskar, Agrim Dewan, and Chandan Saha</span>
<span class="title">Testing Equivalence to Design Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.9">10.4230/LIPIcs.STACS.2024.9</a>
</li>
<li>
<span class="authors">Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing, Jonas Forster, Lutz Schröder, and Paul Wild</span>
<span class="title">Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.10">10.4230/LIPIcs.STACS.2024.10</a>
</li>
<li>
<span class="authors">Christoph Berkholz, Stefan Mengel, and Hermann Wilhelm</span>
<span class="title">A Characterization of Efficiently Compilable Constraint Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.11">10.4230/LIPIcs.STACS.2024.11</a>
</li>
<li>
<span class="authors">Christoph Berkholz, Dietrich Kuske, and Christian Schwarz</span>
<span class="title">Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.12">10.4230/LIPIcs.STACS.2024.12</a>
</li>
<li>
<span class="authors">Stéphane Bessy, Stéphan Thomassé, and Laurent Viennot</span>
<span class="title">Temporalizing Digraphs via Linear-Size Balanced Bi-Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.13">10.4230/LIPIcs.STACS.2024.13</a>
</li>
<li>
<span class="authors">Marcin Bienkowski and Stefan Schmid</span>
<span class="title">A Subquadratic Bound for Online Bisection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.14">10.4230/LIPIcs.STACS.2024.14</a>
</li>
<li>
<span class="authors">Marcin Bienkowski and Guy Even</span>
<span class="title">An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.15">10.4230/LIPIcs.STACS.2024.15</a>
</li>
<li>
<span class="authors">Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, and Teresa Anna Steiner</span>
<span class="title">Gapped String Indexing in Subquadratic Space and Sublinear Query Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.16">10.4230/LIPIcs.STACS.2024.16</a>
</li>
<li>
<span class="authors">Nicolás Bitar</span>
<span class="title">Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.17">10.4230/LIPIcs.STACS.2024.17</a>
</li>
<li>
<span class="authors">Hans-Joachim Böckenhauer, Fabian Frei, and Peter Rossmanith</span>
<span class="title">Removable Online Knapsack and Advice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.18">10.4230/LIPIcs.STACS.2024.18</a>
</li>
<li>
<span class="authors">Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, and Christoph Standke</span>
<span class="title">The Complexity of Homomorphism Reconstructibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.19">10.4230/LIPIcs.STACS.2024.19</a>
</li>
<li>
<span class="authors">Olivier Bournez and Riccardo Gozzi</span>
<span class="title">Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.20">10.4230/LIPIcs.STACS.2024.20</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Laurent Feuilloley, and Sébastien Zeitoun</span>
<span class="title">Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.21">10.4230/LIPIcs.STACS.2024.21</a>
</li>
<li>
<span class="authors">Geoffroy Caillat-Grenier and Andrei Romashchenko</span>
<span class="title">Spectral Approach to the Communication Complexity of Multi-Party Key Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.22">10.4230/LIPIcs.STACS.2024.22</a>
</li>
<li>
<span class="authors">Deeparnab Chakrabarty, Luc Cote, and Ankita Sarkar</span>
<span class="title">Fault-tolerant k-Supplier with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.23">10.4230/LIPIcs.STACS.2024.23</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Approximate Circular Pattern Matching Under Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.24">10.4230/LIPIcs.STACS.2024.24</a>
</li>
<li>
<span class="authors">Tameem Choudhury and Karteek Sreenivasaiah</span>
<span class="title">Depth-3 Circuit Lower Bounds for k-OV</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.25">10.4230/LIPIcs.STACS.2024.25</a>
</li>
<li>
<span class="authors">Nicola Cotumaccio</span>
<span class="title">A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.26">10.4230/LIPIcs.STACS.2024.26</a>
</li>
<li>
<span class="authors">Julian D'Costa, Joël Ouaknine, and James Worrell</span>
<span class="title">Nonnegativity Problems for Matrix Semigroups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.27">10.4230/LIPIcs.STACS.2024.27</a>
</li>
<li>
<span class="authors">Jack Dippel and Adrian Vetta</span>
<span class="title">One n Remains to Settle the Tree Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.28">10.4230/LIPIcs.STACS.2024.28</a>
</li>
<li>
<span class="authors">Andrei Draghici, Christoph Haase, and Florin Manea</span>
<span class="title">Semënov Arithmetic, Affine {VASS}, and String Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.29">10.4230/LIPIcs.STACS.2024.29</a>
</li>
<li>
<span class="authors">Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, and Vladimir Lysikov</span>
<span class="title">Fixed-Parameter Debordering of Waring Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.30">10.4230/LIPIcs.STACS.2024.30</a>
</li>
<li>
<span class="authors">Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, and Dhara Thakkar</span>
<span class="title">On the Power of Border Width-2 ABPs over Fields of Characteristic 2</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.31">10.4230/LIPIcs.STACS.2024.31</a>
</li>
<li>
<span class="authors">Franziska Eberle</span>
<span class="title">O(1/ε) Is the Answer in Online Weighted Throughput Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.32">10.4230/LIPIcs.STACS.2024.32</a>
</li>
<li>
<span class="authors">Nicolas El Maalouly, Sebastian Haslebacher, and Lasse Wulf</span>
<span class="title">On the Exact Matching Problem in Dense Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.33">10.4230/LIPIcs.STACS.2024.33</a>
</li>
<li>
<span class="authors">Marek Filakovský, Tamio-Vesa Nakajima, Jakub Opršal, Gianluca Tasinato, and Uli Wagner</span>
<span class="title">Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.34">10.4230/LIPIcs.STACS.2024.34</a>
</li>
<li>
<span class="authors">Janosch Fuchs and Philip Whittington</span>
<span class="title">The 2-Attractor Problem Is NP-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.35">10.4230/LIPIcs.STACS.2024.35</a>
</li>
<li>
<span class="authors">Moses Ganardi, Irmak Sağlam, and Georg Zetzsche</span>
<span class="title">Directed Regular and Context-Free Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.36">10.4230/LIPIcs.STACS.2024.36</a>
</li>
<li>
<span class="authors">Matthias Gehnen, Henri Lotze, and Peter Rossmanith</span>
<span class="title">Online Simple Knapsack with Bounded Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.37">10.4230/LIPIcs.STACS.2024.37</a>
</li>
<li>
<span class="authors">Stefan Göller and Nathan Grosshans</span>
<span class="title">The AC⁰-Complexity of Visibly Pushdown Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.38">10.4230/LIPIcs.STACS.2024.38</a>
</li>
<li>
<span class="authors">Ziyi Guan, Yunqi Huang, Penghui Yao, and Zekun Ye</span>
<span class="title">Quantum and Classical Communication Complexity of Permutation-Invariant Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.39">10.4230/LIPIcs.STACS.2024.39</a>
</li>
<li>
<span class="authors">David G. Harris and N. S. Narayanaswamy</span>
<span class="title">A Faster Algorithm for Vertex Cover Parameterized by Solution Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.40">10.4230/LIPIcs.STACS.2024.40</a>
</li>
<li>
<span class="authors">S. Hitarth, George Kenison, Laura Kovács, and Anton Varonka</span>
<span class="title">Linear Loop Synthesis for Quadratic Invariants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.41">10.4230/LIPIcs.STACS.2024.41</a>
</li>
<li>
<span class="authors">Martin Hoefer, Carmine Ventre, and Lisa Wilhelmi</span>
<span class="title">Algorithms for Claims Trading</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.42">10.4230/LIPIcs.STACS.2024.42</a>
</li>
<li>
<span class="authors">Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, and Yutong Yang</span>
<span class="title">A Faster Algorithm for Constructing the Frequency Difference Consensus Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.43">10.4230/LIPIcs.STACS.2024.43</a>
</li>
<li>
<span class="authors">Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, and Peter Strulo</span>
<span class="title">Decremental Sensitivity Oracles for Covering and Packing Minors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.44">10.4230/LIPIcs.STACS.2024.44</a>
</li>
<li>
<span class="authors">Piotr Kawałek, Michael Kompatscher, and Jacek Krzaczkowski</span>
<span class="title">Circuit Equivalence in 2-Nilpotent Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.45">10.4230/LIPIcs.STACS.2024.45</a>
</li>
<li>
<span class="authors">Michael Kompatscher</span>
<span class="title">The Subpower Membership Problem of 2-Nilpotent Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.46">10.4230/LIPIcs.STACS.2024.46</a>
</li>
<li>
<span class="authors">Katarzyna Kowalska and Michał Pilipczuk</span>
<span class="title">Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.47">10.4230/LIPIcs.STACS.2024.47</a>
</li>
<li>
<span class="authors">Matthias Lanzinger and Igor Razgon</span>
<span class="title">FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.48">10.4230/LIPIcs.STACS.2024.48</a>
</li>
<li>
<span class="authors">Ying Liu and Shiteng Chen</span>
<span class="title">Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.49">10.4230/LIPIcs.STACS.2024.49</a>
</li>
<li>
<span class="authors">James C. A. Main</span>
<span class="title">Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.50">10.4230/LIPIcs.STACS.2024.50</a>
</li>
<li>
<span class="authors">Andreas Maletti, Andreea-Teodora Nász, and Erik Paul</span>
<span class="title">Weighted HOM-Problem for Nonnegative Integers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.51">10.4230/LIPIcs.STACS.2024.51</a>
</li>
<li>
<span class="authors">Bodo Manthey and Jesse van Rhijn</span>
<span class="title">Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.52">10.4230/LIPIcs.STACS.2024.52</a>
</li>
<li>
<span class="authors">Daniel Neuen</span>
<span class="title">Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.53">10.4230/LIPIcs.STACS.2024.53</a>
</li>
<li>
<span class="authors">Pierre Ohlmann and Michał Skrzypczak</span>
<span class="title">Positionality in Σ⁰₂ and a Completeness Result</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.54">10.4230/LIPIcs.STACS.2024.54</a>
</li>
<li>
<span class="authors">Christophe Paul and Evangelos Protopapas</span>
<span class="title">Tree-Layout Based Graph Classes: Proper Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.55">10.4230/LIPIcs.STACS.2024.55</a>
</li>
<li>
<span class="authors">Swagato Sanyal</span>
<span class="title">Randomized Query Composition and Product Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.56">10.4230/LIPIcs.STACS.2024.56</a>
</li>
<li>
<span class="authors">Ildikó Schlotter</span>
<span class="title">Shortest Two Disjoint Paths in Conservative Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.57">10.4230/LIPIcs.STACS.2024.57</a>
</li>
<li>
<span class="authors">Haitao Wang</span>
<span class="title">Algorithms for Computing Closest Points for Segments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.58">10.4230/LIPIcs.STACS.2024.58</a>
</li>
<li>
<span class="authors">Emre Yolcu</span>
<span class="title">Lower Bounds for Set-Blocked Clauses Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2024.59">10.4230/LIPIcs.STACS.2024.59</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