| 2026 | Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion. | Samuel Humeau, Mamadou Moustapha Kant, Daniel Mock, Timoth Picavet, Alexandre Vigny |
| 2026 | One-Clock Synthesis Problems. | Slawomir Lasota, Mathieu Lehaut, Julie Parreaux, Radoslaw Pirkowski |
| 2026 | The Communication Complexity of Combinatorial Auctions in Graphs. | George Christodoulou, Elias Koutsoupias, Annamria Kovcs, Ioannis Vlachos |
| 2026 | Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms. | Antonios Antoniadis, Denise Graafsma, Ruben Hoeksma, Maria Vlasiou |
| 2026 | Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games. | Laurent Doyen, Shibashis Guha |
| 2026 | A Linear Kernel for Independent Set Reconfiguration in Planar Graphs. | Nicolas Bousquet, Daniel W. Cranston |
| 2026 | Counting Unit Circular Arc Intersections. | Haitao Wang |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2025 | Nearly-Optimal Algorithm for Non-Clairvoyant Service with Delay. | Noam Touitou |
| 2025 | Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position. | Anastasiia Tkachenko, Haitao Wang |
| 2025 | Card-Based Protocols Imply PSM Protocols. | Kazumasa Shinagawa, Koji Nuida |
| 2025 | Unfairly Splitting Separable Necklaces. | Patrick Schnider, Linus Stalder, Simon Weber |
| 2025 | Some Recent Advancements in Monotone Circuit Complexity (Invited Talk). | Susanna F. de Rezende |
| 2025 | Colorful Vertex Recoloring of Bipartite Graphs. | Boaz Patt-Shamir, Adi Rosn, Seeun William Umboh |
| 2025 | A Dichotomy Theorem for Ordinal Ranks in MSO. | Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2025 | Slightly Non-Linear Higher-Order Tree Transducers. | L Thnh Dung Nguyn, Gabriele Vanoni |
| 2025 | Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata. | Benjamin Hellouin de Menibus, Pacme Perrotin |
| 2025 | Commutative ℕ-Rational Series of Polynomial Growth. | Aliaume Lopez |
| 2025 | The Hardness of Decision Tree Complexity. | Bruno Loff, Alexey Milovanov |
| 2025 | On Average Baby PIH and Its Applications. | Yuwei Liu, Yijia Chen, Shuangle Li, Bingkai Lin, Xin Zheng |
| 2025 | Cluster Editing on Cographs and Related Classes. | Manuel Lafond, Alitzel Lpez Snchez, Weidong Luo |
| 2025 | Approximation of Spanning Tree Congestion Using Hereditary Bisection. | Petr Kolman |
| 2025 | Faster Algorithms on Linear Delta-Matroids. | Tomohiro Koana, Magnus Wahlstrm |
| 2025 | Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices. | Stefan Kiefer, Andrew Ryzhikov |
| 2025 | Modular Counting CSP: Reductions and Algorithms. | Amirhossein Kazeminia, Andrei A. Bulatov |