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