| 2025 | Which Graph Motif Parameters Count? | Markus Blser, Radu Curticapean, Julian Drfler, Christian Ikenmeyer |
| 2025 | On the Reachability Problem for Two-Dimensional Branching VASS. | Clotilde Bizire, Thibault Hilaire, Jrme Leroux, Grgoire Sutre |
| 2025 | On the Performance of Mildly Greedy Players in k-Coloring Games. | Vittorio Bil, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano |
| 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 | Monotone Bounded-Depth Complexity of Homomorphism Polynomials. | C. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi |
| 2025 | Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. | Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth |
| 2025 | Sensitivity and Query Complexity Under Uncertainty. | Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah |
| 2025 | Isometric-Universal Graphs for Trees. | Edgar Baucher, Franois Dross, Cyril Gavoille |
| 2025 | Symmetry Classes of Hamiltonian Cycles. | Jlia Baligcs, Sofia Brenner, Annette Lutz, Lena Volk |
| 2025 | Register Automata with Permutations. | Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini, Nikos Tzevelekos |
| 2025 | Solving Partial Dominating Set and Related Problems Using Twin-Width. | Jakub Balabn, Daniel Mock, Peter Rossmanith |
| 2025 | Online Knapsack Problems with Estimates. | Jakub Balabn, Matthias Gehnen, Henri Lotze, Finn Seesemann, Moritz Stocker |
| 2025 | Universality Frontier for Asynchronous Cellular Automata. | Ivan Baburin, Matthew Cook, Florian Grtschla, Andreas Plesner, Roger Wattenhofer |
| 2025 | Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations. | Melissa Antonelli, Arnaud Durand, Juha Kontinen |
| 2025 | Linear Time Subsequence and Supersequence Regex Matching. | Antoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid |
| 2025 | Dynamic Membership for Regular Tree Languages. | Antoine Amarilli, Corentin Barloy, Louis Jachiet, Charles Paperman |
| 2025 | Approximating Prize-Collecting Variants of TSP. | Morteza Alimi, Tobias Mmke, Michael Ruderer |
| 2025 | Catalytic Computing and Register Programs Beyond Log-Depth. | Yaroslav Alekseev, Yuval Filmus, Ian Mertz, Alexander Smal, Antoine Vinciguerra |
| 2025 | Right-Linear Lattices: An Algebraic Theory of ω-Regular Languages, with Fixed Points. | Anupam Das, Abhishek De |
| 2025 | Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. | Jingyang Zhao, Mingyu Xiao |
| 2024 | Approximate Suffix-Prefix Dictionary Queries. | Wiktor Zuba, Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan |
| 2024 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2024 | Leakage-Resilient Hardness Equivalence to Logspace Derandomization. | Yakov Shalunov |
| 2024 | An Algorithmic Meta Theorem for Homomorphism Indistinguishability. | Tim Seppelt |
| 2024 | Monoids of Upper Triangular Matrices over the Boolean Semiring. | Andrew Ryzhikov, Petra Wolf |