LIPIcs, Volume 327, STACS 2025

• Olaf Beyersdorff, Michał Pilipczuk, Elaine Pimentel, and Nguyễn Kim Thắng LIPIcs, Volume 327, STACS 2025, Complete Volume 10.4230/LIPIcs.STACS.2025
• Olaf Beyersdorff, Michał Pilipczuk, Elaine Pimentel, and Nguyễn Kim Thắng Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.STACS.2025.0
• Albert Atserias Proof Complexity and Its Relations to SAT Solving (Invited Talk) 10.4230/LIPIcs.STACS.2025.1
• Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, and László A. Végh A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk) 10.4230/LIPIcs.STACS.2025.2
• Anupam Das Algebras for Automata: Reasoning with Regularity (Invited Talk) 10.4230/LIPIcs.STACS.2025.3
• Susanna F. de Rezende Some Recent Advancements in Monotone Circuit Complexity (Invited Talk) 10.4230/LIPIcs.STACS.2025.4
• Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Shaily Verma Parameterized Saga of First-Fit and Last-Fit Coloring 10.4230/LIPIcs.STACS.2025.5
• Jungho Ahn, Hugo Jacob, Noleen Köhler, Christophe Paul, Amadeus Reinald, and Sebastian Wiederrecht Twin-Width One 10.4230/LIPIcs.STACS.2025.6
• Shyan Akmal and Tomohiro Koana Faster Edge Coloring by Partition Sieving 10.4230/LIPIcs.STACS.2025.7
• Yaroslav Alekseev, Dima Grigoriev, and Edward A. Hirsch Tropical Proof Systems: Between R(CP) and Resolution 10.4230/LIPIcs.STACS.2025.8
• Sharareh Alipour, Ermiya Farokhnejad, and Tobias Mömke Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model 10.4230/LIPIcs.STACS.2025.9
• Quentin Aristote Monotone Weak Distributive Laws over the Lifted Powerset Monad in Categories of Algebras 10.4230/LIPIcs.STACS.2025.10
• Srinivasan Arunachalam and Louis Schatzki Generalized Inner Product Estimation with Limited Quantum Communication 10.4230/LIPIcs.STACS.2025.11
• Christine Awofeso, Patrick Greaves, Oded Lachish, and Felix Reidl Results on H-Freeness Testing in Graphs of Bounded r-Admissibility 10.4230/LIPIcs.STACS.2025.12
• Samuel Baguley, Yannic Maus, Janosch Ruff, and George Skretas Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring 10.4230/LIPIcs.STACS.2025.13
• Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, and Saket Saurabh Multivariate Exploration of Metric Dilation 10.4230/LIPIcs.STACS.2025.14
• Max Bannach and Markus Hecher Structure-Guided Automated Reasoning 10.4230/LIPIcs.STACS.2025.15
• Nastaran Behrooznia and Torsten Mütze Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges 10.4230/LIPIcs.STACS.2025.16
• Matthias Bentert, Fedor V. Fomin, and Petr A. Golovach Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths 10.4230/LIPIcs.STACS.2025.17
• Marcin Bienkowski, Jarosław Byrka, and Łukasz Jeż Online Disjoint Set Covers: Randomization Is Not Necessary 10.4230/LIPIcs.STACS.2025.18
• Benjamin Bordais, Daniel Neider, and Rajarshi Roy The Complexity of Learning LTL, CTL and ATL Formulas 10.4230/LIPIcs.STACS.2025.19
• Roberto Borelli, Luca Geatti, Marco Montali, and Angelo Montanari On Cascades of Reset Automata 10.4230/LIPIcs.STACS.2025.20
• Antonin Callard, Léo Paviet Salomon, and Pascal Vanier Computability of Extender Sets in Multidimensional Subshifts 10.4230/LIPIcs.STACS.2025.21
• Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, and Noleen Köhler CMSO-Transducing Tree-Like Graph Decompositions 10.4230/LIPIcs.STACS.2025.22
• Rémy Cerda and Lionel Vaux Auclair How to Play the Accordion: Uniformity and the (Non-)Conservativity of the Linear Approximation of the λ-Calculus 10.4230/LIPIcs.STACS.2025.23
• Keerti Choudhary and Rishabh Dhiman A Deterministic Approach to Shortest Path Restoration in Edge Faulty Graphs 10.4230/LIPIcs.STACS.2025.24
• Aleksander Bjørn Christiansen, Ivor van der Hoog, and Eva Rotenberg Local Density and Its Distributed Approximation 10.4230/LIPIcs.STACS.2025.25
• Nikolai Chukhin, Alexander S. Kulikov, and Ivan Mihajlin Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function 10.4230/LIPIcs.STACS.2025.26
• Nathan Claudet and Simon Perdrix Local Equivalence of Stabilizer States: A Graphical Characterisation 10.4230/LIPIcs.STACS.2025.27
• Radu Curticapean, Simon Döring, Daniel Neuen, and Jiaheng Wang Can You Link Up With Treewidth? 10.4230/LIPIcs.STACS.2025.28
• Dariusz Dereniowski, Aleksander Łukasiewicz, and Przemysław Uznański Noisy (Binary) Searching: Simple, Fast and Correct 10.4230/LIPIcs.STACS.2025.29
• Stéphane Devismes, David Ilcinkas, Colette Johnen, and Frédéric Mazoit Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences 10.4230/LIPIcs.STACS.2025.30
• Leah Epstein and Asaf Levin Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines 10.4230/LIPIcs.STACS.2025.31
• Nick Fischer, Evangelos Kipouridis, Jonas Klausen, and Mikkel Thorup A Faster Algorithm for Constrained Correlation Clustering 10.4230/LIPIcs.STACS.2025.32
• Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale Metric Dimension and Geodetic Set Parameterized by Vertex Cover 10.4230/LIPIcs.STACS.2025.33
• Pierre Fraigniaud, Minh Hang Nguyen, and Ami Paz Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure 10.4230/LIPIcs.STACS.2025.34
• Ameet Gadekar and Tanmay Inamdar Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering 10.4230/LIPIcs.STACS.2025.35
• Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, and Roohani Sharma MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal 10.4230/LIPIcs.STACS.2025.36
• Jorge Gallego-Hernández and Alessio Mansutti On the Existential Theory of the Reals Enriched with Integer Powers of a Computable Number 10.4230/LIPIcs.STACS.2025.37
• Arnab Ganguly, Daniel Gibney, Rahul Shah, and Sharma V. Thankachan Two-Dimensional Longest Common Extension Queries in Compact Space 10.4230/LIPIcs.STACS.2025.38
• Ebrahim Ghorbani, Jonah Leander Hoff, and Matthias Mnich A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs 10.4230/LIPIcs.STACS.2025.39
• Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, and Paul Wild Identity-Preserving Lax Extensions and Where to Find Them 10.4230/LIPIcs.STACS.2025.40
• Jakob Greilhuber, Philipp Schepper, and Philip Wellnitz Residue Domination in Bounded-Treewidth Graphs 10.4230/LIPIcs.STACS.2025.41
• Mohit Gurumukhani, Ramamohan Paturi, Michael Saks, and Navid Talebanfard Local Enumeration: The Not-All-Equal Case 10.4230/LIPIcs.STACS.2025.42
• Sariel Har-Peled and Saladi Rahul Approximating Densest Subgraph in Geometric Intersection Graphs 10.4230/LIPIcs.STACS.2025.43
• Tim A. Hartmann and Dániel Marx Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances 10.4230/LIPIcs.STACS.2025.44
• Deborah Haun, Laura Merker, and Sergey Pupyrev Forbidden Patterns in Mixed Linear Layouts 10.4230/LIPIcs.STACS.2025.45
• Úrsula Hébert-Johnson and Daniel Lokshtanov Sampling Unlabeled Chordal Graphs in Expected Polynomial Time 10.4230/LIPIcs.STACS.2025.46
• Klaus Heeger and Hendrik Molter Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines 10.4230/LIPIcs.STACS.2025.47
• Benjamin Hellouin de Menibus and Pacôme Perrotin Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata 10.4230/LIPIcs.STACS.2025.48
• Quentin Hillebrand, Vorapong Suppakitpaisarn, and Tetsuo Shibuya Cycle Counting Under Local Differential Privacy for Degeneracy-Bounded Graphs 10.4230/LIPIcs.STACS.2025.49
• Martin Hoefer, Conrad Schecker, and Kevin Schewior Designing Exploration Contracts 10.4230/LIPIcs.STACS.2025.50
• Felix Hommelsheim, Zhenwei Liu, Nicole Megow, and Guochuan Zhang Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures 10.4230/LIPIcs.STACS.2025.51
• Séhane Bel Houari-Durand, Eduard Eiben, and Magnus Wahlström Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion 10.4230/LIPIcs.STACS.2025.52
• Pavel Hrubeš and Pushkar S. Joglekar On Read-k Projections of the Determinant 10.4230/LIPIcs.STACS.2025.53
• Stacey Jeffery and Galina Pass Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer 10.4230/LIPIcs.STACS.2025.54
• Jean Christoph Jung and Jędrzej Kołodziejski Modal Separation of Fixpoint Formulae 10.4230/LIPIcs.STACS.2025.55
• Julia Katheder, Michael Kaufmann, Sergey Pupyrev, and Torsten Ueckerdt Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs 10.4230/LIPIcs.STACS.2025.56
• Matthias Kaul, Kelin Luo, Matthias Mnich, and Heiko Röglin Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously 10.4230/LIPIcs.STACS.2025.57
• Piotr Kawałek and Armin Weiß Violating Constant Degree Hypothesis Requires Breaking Symmetry 10.4230/LIPIcs.STACS.2025.58
• Yasushi Kawase and Tomohiro Nakayoshi Online Matching with Delays and Size-Based Costs 10.4230/LIPIcs.STACS.2025.59
• Amirhossein Kazeminia and Andrei A. Bulatov Modular Counting CSP: Reductions and Algorithms 10.4230/LIPIcs.STACS.2025.60
• Stefan Kiefer and Andrew Ryzhikov Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices 10.4230/LIPIcs.STACS.2025.61
• Tomohiro Koana and Magnus Wahlström Faster Algorithms on Linear Delta-Matroids 10.4230/LIPIcs.STACS.2025.62
• Petr Kolman Approximation of Spanning Tree Congestion Using Hereditary Bisection 10.4230/LIPIcs.STACS.2025.63
• Manuel Lafond, Alitzel López Sánchez, and Weidong Luo Cluster Editing on Cographs and Related Classes 10.4230/LIPIcs.STACS.2025.64
• Yuwei Liu, Yijia Chen, Shuangle Li, Bingkai Lin, and Xin Zheng On Average Baby PIH and Its Applications 10.4230/LIPIcs.STACS.2025.65
• Bruno Loff and Alexey Milovanov The Hardness of Decision Tree Complexity 10.4230/LIPIcs.STACS.2025.66
• Aliaume Lopez Commutative ℕ-Rational Series of Polynomial Growth 10.4230/LIPIcs.STACS.2025.67
• Lê Thành Dũng (Tito) Nguyễn and Gabriele Vanoni Slightly Non-Linear Higher-Order Tree Transducers 10.4230/LIPIcs.STACS.2025.68
• Damian Niwiński, Paweł Parys, and Michał Skrzypczak A Dichotomy Theorem for Ordinal Ranks in MSO 10.4230/LIPIcs.STACS.2025.69
• Boaz Patt-Shamir, Adi Rosén, and Seeun William Umboh Colorful Vertex Recoloring of Bipartite Graphs 10.4230/LIPIcs.STACS.2025.70
• Patrick Schnider, Linus Stalder, and Simon Weber Unfairly Splitting Separable Necklaces 10.4230/LIPIcs.STACS.2025.71
• Kazumasa Shinagawa and Koji Nuida Card-Based Protocols Imply PSM Protocols 10.4230/LIPIcs.STACS.2025.72
• Anastasiia Tkachenko and Haitao Wang Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position 10.4230/LIPIcs.STACS.2025.73
• Noam Touitou Nearly-Optimal Algorithm for Non-Clairvoyant Service with Delay 10.4230/LIPIcs.STACS.2025.74
• Oleg Verbitsky and Maksim Zhukovskii Canonical Labeling of Sparse Random Graphs 10.4230/LIPIcs.STACS.2025.75
• Haitao Wang and Yiming Zhao Dynamic Unit-Disk Range Reporting 10.4230/LIPIcs.STACS.2025.76