| 2025 | Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform. | Gabriele Fici, Estban Gabory |
| 2025 | Quantum Programming in Polylogarithmic Time. | Florent Ferrari, Emmanuel Hainry, Romain Pchoux, Mrio Silva |
| 2025 | Guarding Offices with Maximum Dispersion. | Sndor P. Fekete, Kai Kobbe, Dominik Krupke, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer |
| 2025 | Regular Model Checking for Systems with Effectively Regular Reachability Relation. | Javier Esparza, Valentin Krasotin |
| 2025 | An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines. | Leah Epstein, Asaf Levin |
| 2025 | The Complexity of Computing Second Solutions. | Fabian Egidy, Christian Glaer, Fynn Godau |
| 2025 | Broadcasting Under Structural Restrictions. | Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2025 | Token Sliding Reconfiguration on DAGs. | Jona Dirks, Alexandre Vigny |
| 2025 | Symmetric Proofs in the Ideal Proof System. | Anuj Dawar, Erich Grdel, Leon Kullmann, Benedikt Pago |
| 2025 | The Complexity of Separability for Semilinear Sets and Parikh Automata. | Elias Rojas Collins, Chris Kcher, Georg Zetzsche |
| 2025 | Lambdas, Transducers and MSO (Invited Talk). | Thomas Colcombet |
| 2025 | New Hardness Results for Low-Rank Matrix Completion. | Dror Chawin, Ishay Haviv |
| 2025 | Counting Distinct Square Substrings in Sublinear Time. | Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2025 | A Note on the Complexity of Defensive Domination. | Steven Chaplick, Grzegorz Gutowski, Tomasz Krawczyk |
| 2025 | Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts. | Balder ten Cate, Phokion G. Kolaitis, Arnar . Kristjnsson |
| 2025 | Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization. | Jean Cardinal, Xavier Goaoc, Sarah Wajsbrot |
| 2025 | A Proof of Shur's Conjecture on the Growth of Power-Free Languages over Large Alphabets. | Vuong Bui, Matthieu Rosenfeld |
| 2025 | Games with ω-Automatic Preference Relations. | Vronique Bruyre, Christophe Grandmont, Jean-Franois Raskin |
| 2025 | Finding Equilibria: Simpler for Pessimists, Simplest for Optimists. | Lonard Brice, Thomas A. Henzinger, K. S. Thejaswini |
| 2025 | A Universal Uniform Approximation Theorem for Neural Networks. | Olivier Bournez, Johanne Cohen, Adrian Wurm |
| 2025 | Graphs with No Long Claws: An Improved Bound for the Analog of the Gyrfs' Path Argument. | Romain Bourneuf, Jana Masarkov, Wojciech Nadara, Marcin Pilipczuk |
| 2025 | Cops and Robbers for Graphs on Surfaces with Crossings. | Prosenjit Bose, Pat Morin, Karthik Murali |
| 2025 | Computational Complexity of Covering Regular Trees. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl |
| 2025 | Polynomial-Time Tractable Problems over the p-Adic Numbers. | Manuel Bodirsky, Arno Fehm |
| 2025 | Temporal Valued Constraint Satisfaction Problems. | Manuel Bodirsky, douard Bonnet, Zaneta Semanisinov |