| 2026 | 2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs. Rohit Gurjar, Kilian Rothmund, Thomas Thierauf |
| 2026 | 43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026 Meena Mahajan, Florin Manea, Annabelle McIver, Kim Thang Nguyen |
| 2026 | A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm. Stefan Hougardy, Bart Zondervan |
| 2026 | A Linear Kernel for Independent Set Reconfiguration in Planar Graphs. Nicolas Bousquet, Daniel W. Cranston |
| 2026 | A Permanental Analog of the Rank-Nullity Theorem for Symmetric Matrices. Priyanshu Pant, Surabhi Chakrabartty, Ranveer Singh |
| 2026 | A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP. Andreas Kalavas, Charalampos Platanos, Thanos Tolias |
| 2026 | A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths. Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet |
| 2026 | A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs. Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi |
| 2026 | A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling. Klaus Jansen, Felix Ohnesorge |
| 2026 | A Pumping-Like Lemma for Languages over Infinite Alphabets. Yoav Danieli |
| 2026 | A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. Pavel Dvorák, Bruno Loff, Suhail Sherif |
| 2026 | Advancements in Online Edge Coloring Algorithms (Invited Talk). Ola Svensson |
| 2026 | Algebraic Characterizations of Classes of Regular Languages in DynFO. Corentin Barloy, Felix Tschirbs, Nils Vortmeier, Thomas Zeume |
| 2026 | Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games. Laurent Doyen, Shibashis Guha |
| 2026 | An Improved Version of Hmelevskii's Theorem on Three-Variable Word Equations. Aleksi Saarela |
| 2026 | Approximate Cartesian Tree Matching with Substitutions. Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed |
| 2026 | Approximating q → p Norms of Non-Negative Matrices in Nearly-Linear Time. Étienne Objois, Adrian Vladu |
| 2026 | Approximation Algorithms for Integer Programming with Resource Augmentation. Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen, Guochuan Zhang |
| 2026 | Broadcast in Almost Mixing Time. Anton Paramonov, Roger Wattenhofer |
| 2026 | Circle Graphs Can Be Recognized in Linear Time. Christophe Paul, Ignaz Rutter |
| 2026 | Colouring Probe H-Free Graphs. Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen |
| 2026 | Computational Hardness of Estimating Quantum Entropies via Binary Entropy Bounds. Yupan Liu |
| 2026 | Computing Tarski Fixed Points in Financial Networks. Leander Besting, Martin Hoefer, Lars Huth |
| 2026 | Computing Twin-Width via Treedepth and Vertex Integrity. Robert Ganian, Mathis Rocton |
| 2026 | Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank. Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin, Arina Smirnova |
| 2026 | Counting Unit Circular Arc Intersections. Haitao Wang |
| 2026 | Decidability of Extensions of Presburger Arithmetic by Hardy Field Functions. Hera Brown, Jakub Konieczny |
| 2026 | Demystifying Codensity Monads via Duality. Fabian Lenke, Nico Wittrock, Stefan Milius, Henning Urbat |
| 2026 | Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density. Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein |
| 2026 | Dynamic Pattern Matching with Wildcards. Arshia Ataee Naeini, Amir-Parsa Mobed, Masoud Seddighin, Saeed Seddighin |
| 2026 | Effective Versions of Strong Measure Zero. Matthew Rayman |
| 2026 | Efficient Compression in Semigroups. Alexander Thumm, Armin Weiß |
| 2026 | Foremost, Fastest, Shortest: Temporal Graph Realization Under Various Path Metrics. Justine Cauvi, Nils Morawietz, Laurent Viennot |
| 2026 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2026 | Fully Dynamic Spectral Sparsification for Directed Hypergraphs. Sebastian Forster, Gramoz Goranci, Ali Momeni |
| 2026 | Generalised Quantifiers Based on Rabin-Mostowski Index. Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2026 | Higher Hardness Results for the Reconfiguration of Odd Matchings. Joseph Dorfer |
| 2026 | Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing. Marek Cerný, Tim Seppelt |
| 2026 | Improving Lagarias-Odlyzko Algorithm for Average-Case Subset Sum: Modular Arithmetic Approach. Antoine Joux, Karol Wegrzycki |
| 2026 | Kernelization Dichotomies for Hitting Minors Under Structural Parameterizations. Marin Bougeret, Eric Brandwein, Ignasi Sau |
| 2026 | Line Cover and Related Problems. Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana |
| 2026 | List Coloring Ordered Graphs with Forbidden Induced Subgraphs. Marta Piecyk, Pawel Rzazewski |
| 2026 | Lower Bounds for Ranking-Based Pivot Rules. Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis |
| 2026 | Maker-Maker Games of Rank 4 Are PSPACE-Complete. Florian Galliot, Jonas Sénizergues |
| 2026 | Maximum Reachability Orientation of Mixed Graphs. Florian Hörsch |
| 2026 | Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More. Mihail Stoian |
| 2026 | Modular Counting over 3-Element and Conservative Domains. Andrei A. Bulatov, Amirhossein Kazeminia |
| 2026 | Modularity of Preferential Attachment Graphs. Katarzyna Rybarczyk, Malgorzata Sulkowska |
| 2026 | Moments in Time: Algebraic Analysis for Solvable Loops (Invited Talk). Laura Kovács |
| 2026 | On Effective Banach-Mazur Games and an Application to the Poincaré Recurrence Theorem for Category. Prajval Koul, Satyadev Nandakumar |
| 2026 | On the Complexity of Computing Strahler Numbers. Moses Ganardi, Markus Lohrey |
| 2026 | On the Complexity of Language Membership for Probabilistic Words. Antoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati |
| 2026 | On the Hardness of the One-Sided Code Sparsifier Problem. Elena Grigorescu, Alice Moayyedi |
| 2026 | On the p-adic Skolem Problem. Piotr Bacik, Joël Ouaknine, David Purser, James Worrell |
| 2026 | One-Clock Synthesis Problems. Slawomir Lasota, Mathieu Lehaut, Julie Parreaux, Radoslaw Piórkowski |
| 2026 | Optimal Average Disk-Inspection via Fermat's Principle. Konstantinos Georgiou |
| 2026 | Optimal Deterministic Rendezvous in Labeled Lines. Yann Bourreau, Ananth Narayanan, Alexandre Nolin |
| 2026 | Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid. Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter |
| 2026 | Planting and MCMC Sampling from the Potts Model. Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2026 | Polynomial Complementation of Nondeterministic Two-Way Finite Automata by 1-Limited Automata. Bruno Guillon, Luca Prigioniero, Javad Taheri |
| 2026 | Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors. Roohani Sharma, Michal Wlodarczyk |
| 2026 | Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata. Filip Mazowiecki, Antoni Puch, Daniel Smertnig |
| 2026 | Query Languages for Machine-Learning Models (Invited Talk). Martin Grohe |
| 2026 | Random Models and Guarded Logic. Oskar Fiuk |
| 2026 | Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms. Antonios Antoniadis, Denise Graafsma, Ruben Hoeksma, Maria Vlasiou |
| 2026 | Relative Compressed Reverse Suffix Array. Muhammed Oguzhan Külekci, Mano Prakash Parthasarathi, Rahul Shah, Sharma V. Thankachan |
| 2026 | Simple Circuit Extensions for XOR in PTIME. Marco Carmosino, Ngu Dang, Tim Jackman |
| 2026 | Smaller Circuits for Bit Addition. Mikhail Goncharov, Alexander S. Kulikov, Georgie Levtsov |
| 2026 | Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions. Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy |
| 2026 | Stealing from the Dragon's Hoard: Online Unbounded Knapsack With Removal. Matthias Gehnen, Moritz Stocker |
| 2026 | Structural Parameterization of Steiner Tree Packing. Niko Hastrich, Kirill Simonov |
| 2026 | Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion. Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny |
| 2026 | The Asymptotic Size of Finite Irreducible Semigroups of Rational Matrices. Stefan Kiefer, Andrew Ryzhikov |
| 2026 | The Communication Complexity of Combinatorial Auctions in Graphs. George Christodoulou, Elias Koutsoupias, Annamária Kovács, Ioannis Vlachos |
| 2026 | The Complexity of Homomorphism Reconstruction Revisited. Timo Gervens, Martin Grohe, Louis Härtel, Philipp da Silva Fonseca |
| 2026 | The Complexity of Resilience for Digraph Queries. Manuel Bodirsky, Zaneta Semanisinová |
| 2026 | The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs. Zylan Benjert, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi |
| 2026 | Threshold-Driven Streaming Graph: Expansion and Rumor Spreading. Flora Angileri, Andrea Clementi, Emanuele Natale, Michele Salvi, Isabella Ziccardi |
| 2026 | Time-Optimal Construction of String Synchronizing Sets. Jonas Ellert, Tomasz Kociumaka |
| 2026 | To Buy or Not to Buy: Online Rent-Or-Buy on Node-Weighted Graphs. Sander Borst, Moritz Venzin |
| 2026 | Unit Interval Selection in Random Order Streams. Cezar-Mihail Alexandru, Adithya Diddapur, Magnús M. Halldórsson, Christian Konrad, Kheeran K. Naidu |
| 2026 | Upper and Lower Bounds for the Linear Ordering Principle. Edward A. Hirsch, Ilya Volkovich |
| 2026 | When Is Local Search Both Effective and Efficient? Artem Kaznatcheev, Sofia Vazquez Alferez |