| 2025 | #SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank. Nutan Limaye, Adarsh Srinivasan, Srikanth Srinivasan |
| 2025 | 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, Warsaw, Poland, August 25-29, 2025 Pawel Gawrychowski, Filip Mazowiecki, Michal Skrzypczak |
| 2025 | A Note on the Complexity of Defensive Domination. Steven Chaplick, Grzegorz Gutowski, Tomasz Krawczyk |
| 2025 | A Proof of Shur's Conjecture on the Growth of Power-Free Languages over Large Alphabets. Vuong Bui, Matthieu Rosenfeld |
| 2025 | A Universal Uniform Approximation Theorem for Neural Networks. Olivier Bournez, Johanne Cohen, Adrian Wurm |
| 2025 | Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts. Balder ten Cate, Phokion G. Kolaitis, Arnar Á. Kristjánsson |
| 2025 | Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings. Andrei Romashchenko |
| 2025 | Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk). Rasmus Kyng |
| 2025 | An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines. Leah Epstein, Asaf Levin |
| 2025 | Approximating Prize-Collecting Variants of TSP. Morteza Alimi, Tobias Mömke, Michael Ruderer |
| 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 | Catalytic Computing and Register Programs Beyond Log-Depth. Yaroslav Alekseev, Yuval Filmus, Ian Mertz, Alexander Smal, Antoine Vinciguerra |
| 2025 | Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations. Melissa Antonelli, Arnaud Durand, Juha Kontinen |
| 2025 | Color Refinement for Relational Structures. Benjamin Scheidt, Nicole Schweikardt |
| 2025 | Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs. Petr Hlinený |
| 2025 | Computational Complexity of Covering Regular Trees. Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl |
| 2025 | Cops and Robbers for Graphs on Surfaces with Crossings. Prosenjit Bose, Pat Morin, Karthik Murali |
| 2025 | Counting Distinct Square Substrings in Sublinear Time. Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2025 | Counting Locally Optimal Tours in the TSP. Bodo Manthey, Jesse van Rhijn |
| 2025 | Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits. Neil J. Ross, Scott Wesley |
| 2025 | Deciding Regular Games: a Playground for Exponential Time Algorithms. Zihui Liang, Bakh Khoussainov, Mingyu Xiao |
| 2025 | Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space. Eike Neumann |
| 2025 | Deciding Termination of Simple Randomized Loops. Éléanore Meyer, Jürgen Giesl |
| 2025 | Dynamic Membership for Regular Tree Languages. Antoine Amarilli, Corentin Barloy, Louis Jachiet, Charles Paperman |
| 2025 | Efficient Matching of Some Fundamental Regular Expressions with Backreferences. Taisei Nogami, Tachio Terauchi |
| 2025 | Elimination Distance to Dominated Clusters. Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny |
| 2025 | FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree. Markus Lohrey, Sebastian Maneth, Markus L. Schmid |
| 2025 | Finding Equilibria: Simpler for Pessimists, Simplest for Optimists. Léonard Brice, Thomas A. Henzinger, K. S. Thejaswini |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | Games with ω-Automatic Preference Relations. Véronique Bruyère, Christophe Grandmont, Jean-François Raskin |
| 2025 | Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform. Gabriele Fici, Estéban Gabory |
| 2025 | Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument. Romain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk |
| 2025 | Guarding Offices with Maximum Dispersion. Sándor P. Fekete, Kai Kobbe, Dominik Krupke, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer |
| 2025 | Higher Connectivity in Directed Graphs (Invited Talk). Giuseppe F. Italiano |
| 2025 | Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization. Jean Cardinal, Xavier Goaoc, Sarah Wajsbrot |
| 2025 | Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and Requantification. Georg Schindling |
| 2025 | Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. Jingyang Zhao, Mingyu Xiao |
| 2025 | Isometric-Universal Graphs for Trees. Edgar Baucher, François Dross, Cyril Gavoille |
| 2025 | Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components. Sriram Bhyravarapu, Pritesh Kumar, Madhumita Kundu, Shivesh K. Roy, Sahiba, Saket Saurabh |
| 2025 | Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width. Aliaume Lopez |
| 2025 | Lambdas, Transducers and MSO (Invited Talk). Thomas Colcombet |
| 2025 | Lazy B-Trees. Casper Moldrup Rysgaard, Sebastian Wild |
| 2025 | Lexicographic Transductions of Finite Words. Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier |
| 2025 | Linear Time Subsequence and Supersequence Regex Matching. Antoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid |
| 2025 | Minimization of Deterministic Finite Automata Modulo the Edit Distance. Jakub Michaliszyn, Jan Otop |
| 2025 | Model-Theoretic Forcing in Transition Algebra. Hashimoto Go, Daniel Gaina |
| 2025 | Monotone Bounded-Depth Complexity of Homomorphism Polynomials. C. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi |
| 2025 | Morphisms and BWT-Run Sensitivity. Gabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina |
| 2025 | Negated String Containment Is Decidable. Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál |
| 2025 | New Hardness Results for Low-Rank Matrix Completion. Dror Chawin, Ishay Haviv |
| 2025 | On Expansions of Monadic Second-Order Logic with Dynamical Predicates. Joris Nieuwveld, Joël Ouaknine |
| 2025 | On Graph Queries and Modal Constraints (Invited Talk). Filip Murlak |
| 2025 | On Large Zeros of Linear Recurrence Sequences. Florian Luca, Joël Ouaknine, James Worrell |
| 2025 | On Piecewise Affine Reachability with Bellman Operators. Anton Varonka, Kazuki Watanabe |
| 2025 | On Synthesis of Distributed Monitors (Invited Talk). Anca Muscholl |
| 2025 | On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy. Christoph Grüne, Lasse Wulf |
| 2025 | On the Performance of Mildly Greedy Players in k-Coloring Games. Vittorio Bilò, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano |
| 2025 | On the Reachability Problem for Two-Dimensional Branching VASS. Clotilde Bizière, Thibault Hilaire, Jérôme Leroux, Grégoire Sutre |
| 2025 | One-Parametric Presburger Arithmetic Has Quantifier Elimination. Alessio Mansutti, Mikhail R. Starchak |
| 2025 | Online Knapsack Problems with Estimates. Jakub Balabán, Matthias Gehnen, Henri Lotze, Finn Seesemann, Moritz Stocker |
| 2025 | Parameterized Spanning Tree Congestion. Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2025 | Polynomial-Time Tractable Problems over the p-Adic Numbers. Manuel Bodirsky, Arno Fehm |
| 2025 | Positional-Player Games. Orna Kupferman, Noam Shenwald |
| 2025 | Probabilistic Finite Automaton Emptiness Is Undecidable for a Fixed Automaton. Günter Rote |
| 2025 | Quantitative Monoidal Algebra: Axiomatising Distance with String Diagrams. Gabriele Lobbia, Wojciech Rozowski, Ralph Sarkis, Fabio Zanasi |
| 2025 | Quantum Programming in Polylogarithmic Time. Florent Ferrari, Emmanuel Hainry, Romain Péchoux, Mário Silva |
| 2025 | Quantum Relaxations of CSP and Structure Isomorphism. Amin Karamlou |
| 2025 | Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2025 | Random Permutations in Computational Complexity. John M. Hitchcock, Adewale Sekoni, Hadi Shafei |
| 2025 | Reachability in Symmetric VASS. Lukasz Kaminski, Slawomir Lasota |
| 2025 | Register Automata with Permutations. Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini, Nikos Tzevelekos |
| 2025 | Regular Model Checking for Systems with Effectively Regular Reachability Relation. Javier Esparza, Valentin Krasotin |
| 2025 | Relative Randomness and Continuous Translation Functions. Ivan Titov |
| 2025 | Resolving Nondeterminism with Randomness. Thomas A. Henzinger, Aditya Prakash, K. S. Thejaswini |
| 2025 | Right-Linear Lattices: An Algebraic Theory of ω-Regular Languages, with Fixed Points. Anupam Das, Abhishek De |
| 2025 | Sensitivity and Query Complexity Under Uncertainty. Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah |
| 2025 | Shortest Paths in Multimode Graphs. Yael Kirkpatrick, Virginia Vassilevska Williams |
| 2025 | Solving Partial Dominating Set and Related Problems Using Twin-Width. Jakub Balabán, Daniel Mock, Peter Rossmanith |
| 2025 | Strong Keys for Tensor Isomorphism Cryptography. Anand Kumar Narayanan |
| 2025 | Subcoloring of (Unit) Disk Graphs. Malory Marin, Rémi Watrigant |
| 2025 | Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth |
| 2025 | Symmetric Proofs in the Ideal Proof System. Anuj Dawar, Erich Grädel, Leon Kullmann, Benedikt Pago |
| 2025 | Symmetry Classes of Hamiltonian Cycles. Júlia Baligács, Sofia Brenner, Annette Lutz, Lena Volk |
| 2025 | Temporal Graph Realization with Bounded Stretch. George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis |
| 2025 | Temporal Valued Constraint Satisfaction Problems. Manuel Bodirsky, Édouard Bonnet, Zaneta Semanisinová |
| 2025 | The Complexity of Computing Second Solutions. Fabian Egidy, Christian Glaßer, Fynn Godau |
| 2025 | The Complexity of Reachability Problems in Strongly Connected Finite Automata. Stefan Kiefer, Andrew Ryzhikov |
| 2025 | The Complexity of Separability for Semilinear Sets and Parikh Automata. Elias Rojas Collins, Chris Köcher, Georg Zetzsche |
| 2025 | Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction. Michael Pinsker, Jakub Rydval, Moritz Schöbi, Christoph Spiess |
| 2025 | Tight Analysis of the Primal-Dual Method for Edge-Covering Pliable Set Families. Zeev Nutov |
| 2025 | Token Sliding Reconfiguration on DAGs. Jona Dirks, Alexandre Vigny |
| 2025 | Universality Frontier for Asynchronous Cellular Automata. Ivan Baburin, Matthew Cook, Florian Grötschla, Andreas Plesner, Roger Wattenhofer |
| 2025 | Wait-Only Broadcast Protocols Are Easier to Verify. Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder |
| 2025 | Which Graph Motif Parameters Count? Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer |
| 2025 | Word Structures and Their Automatic Presentations. Xiaoyang Gong, Bakh Khoussainov, Yuyang Zhuge |