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