LIPIcs, Volume 289, STACS 2024

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