| 2026 | Lower Bounds for Ranking-Based Pivot Rules. | Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis |
| 2026 | Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions. | Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy |
| 2026 | A Pumping-Like Lemma for Languages over Infinite Alphabets. | Yoav Danieli |
| 2026 | Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank. | Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin, Arina Smirnova |
| 2026 | Approximate Cartesian Tree Matching with Substitutions. | Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed |
| 2026 | Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing. | Marek Cern, Tim Seppelt |
| 2026 | Foremost, Fastest, Shortest: Temporal Graph Realization Under Various Path Metrics. | Justine Cauvi, Nils Morawietz, Laurent Viennot |
| 2026 | Simple Circuit Extensions for XOR in PTIME. | Marco Carmosino, Ngu Dang, Tim Jackman |
| 2026 | Modular Counting over 3-Element and Conservative Domains. | Andrei A. Bulatov, Amirhossein Kazeminia |
| 2026 | Decidability of Extensions of Presburger Arithmetic by Hardy Field Functions. | Hera Brown, Jakub Konieczny |
| 2026 | Approximation Algorithms for Integer Programming with Resource Augmentation. | Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen, Guochuan Zhang |
| 2026 | Optimal Deterministic Rendezvous in Labeled Lines. | Yann Bourreau, Ananth Narayanan, Alexandre Nolin |
| 2026 | Kernelization Dichotomies for Hitting Minors Under Structural Parameterizations. | Marin Bougeret, Eric Brandwein, Ignasi Sau |
| 2026 | To Buy or Not to Buy: Online Rent-Or-Buy on Node-Weighted Graphs. | Sander Borst, Moritz Venzin |
| 2026 | The Complexity of Resilience for Digraph Queries. | Manuel Bodirsky, Zaneta Semanisinov |
| 2026 | Computing Tarski Fixed Points in Financial Networks. | Leander Besting, Martin Hoefer, Lars Huth |
| 2026 | Line Cover and Related Problems. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana |
| 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 | The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs. | Zylan Benjert, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi |
| 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 | Algebraic Characterizations of Classes of Regular Languages in DynFO. | Corentin Barloy, Felix Tschirbs, Nils Vortmeier, Thomas Zeume |
| 2026 | On the p-adic Skolem Problem. | Piotr Bacik, Jol Ouaknine, David Purser, James Worrell |
| 2026 | Threshold-Driven Streaming Graph: Expansion and Rumor Spreading. | Flora Angileri, Andrea Clementi, Emanuele Natale, Michele Salvi, Isabella Ziccardi |
| 2026 | On the Complexity of Language Membership for Probabilistic Words. | Antoine Amarilli, Mikal Monet, Paul Raphal, Sylvain Salvati |
| 2026 | Unit Interval Selection in Random Order Streams. | Cezar-Mihail Alexandru, Adithya Diddapur, Magns M. Halldrsson, Christian Konrad, Kheeran K. Naidu |