| 2025 | On Large Zeros of Linear Recurrence Sequences. | Florian Luca, Jol Ouaknine, James Worrell |
| 2025 | Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width. | Aliaume Lopez |
| 2025 | FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree. | Markus Lohrey, Sebastian Maneth, Markus L. Schmid |
| 2025 | Quantitative Monoidal Algebra: Axiomatising Distance with String Diagrams. | Gabriele Lobbia, Wojciech Rozowski, Ralph Sarkis, Fabio Zanasi |
| 2025 | #SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank. | Nutan Limaye, Adarsh Srinivasan, Srikanth Srinivasan |
| 2025 | Deciding Regular Games: a Playground for Exponential Time Algorithms. | Zihui Liang, Bakh Khoussainov, Mingyu Xiao |
| 2025 | Parameterized Spanning Tree Congestion. | Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2025 | Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk). | Rasmus Kyng |
| 2025 | Positional-Player Games. | Orna Kupferman, Noam Shenwald |
| 2025 | Shortest Paths in Multimode Graphs. | Yael Kirkpatrick, Virginia Vassilevska Williams |
| 2025 | The Complexity of Reachability Problems in Strongly Connected Finite Automata. | Stefan Kiefer, Andrew Ryzhikov |
| 2025 | Quantum Relaxations of CSP and Structure Isomorphism. | Amin Karamlou |
| 2025 | Reachability in Symmetric VASS. | Lukasz Kaminski, Slawomir Lasota |
| 2025 | Higher Connectivity in Directed Graphs (Invited Talk). | Giuseppe F. Italiano |
| 2025 | Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs. | Petr Hlinen |
| 2025 | Random Permutations in Computational Complexity. | John M. Hitchcock, Adewale Sekoni, Hadi Shafei |
| 2025 | Resolving Nondeterminism with Randomness. | Thomas A. Henzinger, Aditya Prakash, K. S. Thejaswini |
| 2025 | Negated String Containment Is Decidable. | Vojtech Havlena, Michal Hecko, Luks Holk, Ondrej Lengl |
| 2025 | Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. | Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2025 | Wait-Only Broadcast Protocols Are Easier to Verify. | Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder |
| 2025 | On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy. | Christoph Grne, Lasse Wulf |
| 2025 | Word Structures and Their Automatic Presentations. | Xiaoyang Gong, Bakh Khoussainov, Yuyang Zhuge |
| 2025 | Model-Theoretic Forcing in Transition Algebra. | Hashimoto Go, Daniel Gaina |
| 2025 | Lexicographic Transductions of Finite Words. | Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier |
| 2025 | Morphisms and BWT-Run Sensitivity. | Gabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina |