| 2024 | Removable Online Knapsack and Advice. | Hans-Joachim Bckenhauer, Fabian Frei, Peter Rossmanith |
| 2024 | Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability. | Nicols Bitar |
| 2024 | Gapped String Indexing in Subquadratic Space and Sublinear Query Time. | Philip Bille, Inge Li Grtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner |
| 2024 | An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. | Marcin Bienkowski, Guy Even |
| 2024 | A Subquadratic Bound for Online Bisection. | Marcin Bienkowski, Stefan Schmid |
| 2024 | Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. | Stphane Bessy, Stphan Thomass, Laurent Viennot |
| 2024 | A Characterization of Efficiently Compilable Constraint Languages. | Christoph Berkholz, Stefan Mengel, Hermann Wilhelm |
| 2024 | Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form. | Christoph Berkholz, Dietrich Kuske, Christian Schwarz |
| 2024 | Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. | Harsh Beohar, Sebastian Gurke, Barbara Knig, Karla Messing, Jonas Forster, Lutz Schrder, Paul Wild |
| 2024 | Testing Equivalence to Design Polynomials. | Omkar Baraskar, Agrim Dewan, Chandan Saha |
| 2024 | Faster Graph Algorithms Through DAG Compression. | Max Bannach, Florian Andreas Marwitz, Till Tantau |
| 2024 | Computing Twin-Width Parameterized by the Feedback Edge Number. | Jakub Balabn, Robert Ganian, Mathis Rocton |
| 2024 | On a Hierarchy of Spectral Invariants for Graphs. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2024 | Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers. | C. Aiswarya, Soumodev Mal, Prakash Saivasan |
| 2024 | Max Weight Independent Set in Sparse Graphs with No Long Claws. | Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski |
| 2024 | Algorithms for Claims Trading. | Martin Hoefer, Carmine Ventre, Lisa Wilhelmi |
| 2024 | A Faster Algorithm for Constructing the Frequency Difference Consensus Tree. | Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang |
| 2024 | A Faster Algorithm for Vertex Cover Parameterized by Solution Size. | David G. Harris, N. S. Narayanaswamy |
| 2024 | Algorithms for Computing Closest Points for Segments. | Haitao Wang |
| 2023 | Restless Temporal Path Parameterized Above Lower Bounds. | Philipp Zschoche |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2023 | The Complexity of Translationally Invariant Problems Beyond Ground State Energies. | James D. Watson, Johannes Bausch, Sevag Gharibian |
| 2023 | Logical Algorithmics: From Theory to Practice (Invited Talk). | Moshe Y. Vardi |
| 2023 | Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. | Yaniv Sadeh, Haim Kaplan |
| 2023 | Amortised Analysis of Dynamic Data Structures (Invited Talk). | Eva Rotenberg |