| 2025 | Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences. | Stphane Devismes, David Ilcinkas, Colette Johnen, Frdric Mazoit |
| 2025 | Noisy (Binary) Searching: Simple, Fast and Correct. | Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski |
| 2025 | A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk). | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, Lszl A. Vgh |
| 2025 | Can You Link Up With Treewidth? | Radu Curticapean, Simon Dring, Daniel Neuen, Jiaheng Wang |
| 2025 | Local Equivalence of Stabilizer States: A Graphical Characterisation. | Nathan Claudet, Simon Perdrix |
| 2025 | Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function. | Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin |
| 2025 | Local Density and Its Distributed Approximation. | Aleksander Bjrn Grodt Christiansen, Ivor van der Hoog, Eva Rotenberg |
| 2025 | A Deterministic Approach to Shortest Path Restoration in Edge Faulty Graphs. | Keerti Choudhary, Rishabh Dhiman |
| 2025 | How to Play the Accordion: Uniformity and the (Non-)Conservativity of the Linear Approximation of the λ-Calculus. | Rmy Cerda, Lionel Vaux Auclair |
| 2025 | CMSO-Transducing Tree-Like Graph Decompositions. | Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kant, Eun Jung Kim, Noleen Khler |
| 2025 | Computability of Extender Sets in Multidimensional Subshifts. | Antonin Callard, Lo Paviet Salomon, Pascal Vanier |
| 2025 | On Cascades of Reset Automata. | Roberto Borelli, Luca Geatti, Marco Montali, Angelo Montanari |
| 2025 | The Complexity of Learning LTL, CTL and ATL Formulas. | Benjamin Bordais, Daniel Neider, Rajarshi Roy |
| 2025 | Online Disjoint Set Covers: Randomization Is Not Necessary. | Marcin Bienkowski, Jaroslaw Byrka, Lukasz Jez |
| 2025 | Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach |
| 2025 | Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges. | Nastaran Behrooznia, Torsten Mtze |
| 2025 | Structure-Guided Automated Reasoning. | Max Bannach, Markus Hecher |
| 2025 | Multivariate Exploration of Metric Dilation. | Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh |
| 2025 | Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring. | Samuel Baguley, Yannic Maus, Janosch Ruff, George Skretas |
| 2025 | Results on H-Freeness Testing in Graphs of Bounded r-Admissibility. | Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl |
| 2025 | Proof Complexity and Its Relations to SAT Solving (Invited Talk). | Albert Atserias |
| 2025 | Generalized Inner Product Estimation with Limited Quantum Communication. | Srinivasan Arunachalam, Louis Schatzki |
| 2025 | Monotone Weak Distributive Laws over the Lifted Powerset Monad in Categories of Algebras. | Quentin Aristote |
| 2025 | Improved Approximation Algorithms for (1, 2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model. | Sharareh Alipour, Ermiya Farokhnejad, Tobias Mmke |
| 2025 | Tropical Proof Systems: Between R(CP) and Resolution. | Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch |