| 2026 | The Power of Small Symmetries. | Nikita Gaevoy |
| 2026 | Generalized Snarks, Disjoint Perfect Matchings, and Graph Covers. | Filip Filipi, Jan Kratochvl, Roman Nedela |
| 2026 | Computational Power of Energy-Constrained Autonomous Robots Under Sequential Schedulers. | Caterina Feletti, Paola Flocchini, Nicola Santoro |
| 2026 | How Long Can The Escaping Ant Be Confined? | Kossi Roland Etse |
| 2026 | Lower Bounds for Meta-Reconfiguration. | Kord Eickmeyer, Tatsuya Gima, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2026 | Quantitative Equational Rewriting. | Besik Dundua, Georg Ehling, Santiago Escobar, Maribel Fernndez, Temur Kutsia |
| 2026 | Space Complexity of Reachability in Simple Path Graphs. | Krishnamoorthy Dinesh, Chandana Sasidharan |
| 2026 | Testing Equivalence to the Hamiltonian Cycle Polynomial. | Agrim Dewan |
| 2026 | Counting Equitable k-Colorings in Graphs of Bounded Clique-Width. | Holger Dell, Thore Husfeldt, Amir Nikabadi |
| 2026 | Connectivity Augmentation of Plane Graphs. | Krishnan Dehaleesan, Asif Khan, Pranabendu Misra |
| 2026 | Hamming Distance Between Finite Transducers. | Luc Dartois, Pierre-Cyrille Ham, Ismal Jecker, Silvio Vescovo |
| 2026 | Flood-It with Jewelry - Characterizing the Game Complexity for Cograph Generalizations. | Martin Darmntzel, Christian Rosenke, Mark Scheibner |
| 2026 | On Positivity of Exponential-Trigonometric Polynomials and Irrationality Exponents. | Pieter Collins, Bernard Hanzon, Eike Neumann |
| 2026 | Finite-State Dimension and the Davenport-Erdős Theorem. | Joe Clanin, Matthew Rayman |
| 2026 | The Descriptive Complexity of Relation Modification Problems. | Florian Chudigiewitsch, Marlene Grndel, Christian Komusiewicz, Nils Morawietz, Till Tantau |
| 2026 | Algorithmic Information Bounds for Distances and Orthogonal Projections. | Peter Cholak, Marianna Csrnyei, Neil Lutz, Patrick Lutz, Elvira Mayordomo, Donald M. Stull |
| 2026 | Nearly Tight Bounds on the Block Number of Boolean Functions in Terms of Sensitivity. | Sourav Chakraborty, Anna Gl |
| 2026 | Compression for Coinductive Rewriting and the Cut-Elimination of Non-Wellfounded Proofs. | Rmy Cerda, Alexis Saurin |
| 2026 | On Jumps, Interactions, and Intersection Types. | Stefano Catozi, Ugo Dal Lago, Gabriele Vanoni |
| 2026 | Characterizing LTL Formulas by Examples. | Balder ten Cate, Dana Fisman, Roi Ohayon, Patrik Sestic |
| 2026 | Generating Minimal Redundant and Maximal Irredundant Sets in Incidence Graphs. | Emanuel Elias Silva Castelo, Jrmie Chalopin, Oscar Defrain, Simon Vilmin |
| 2026 | Finding Shortest Reconfiguration Sequences on Independent Set Polytopes. | Jean Cardinal, Kevin Mann, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | Model Checking with Temporal Graphs and Their Derivative. | Binh-Minh Bui-Xuan, Florent Krasnopol, Bruno Monasson, Nathalie Sznajder |
| 2026 | The Entailment Problem for Separation Logic with Overlaid Structures. | Lucas Bueri, Nicolas Peltier, Quentin Petitjean, Mihaela Sighireanu |
| 2026 | Sublinear Time Algorithms for Abelian Group Property Testing. | Nader H. Bshouty |