| 2020 | New Bounds for Randomized List Update in the Paid Exchange Model. | Susanne Albers, Maximilian Janke |
| 2020 | Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. | S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas |
| 2020 | Grundy Coloring & Friends, Half-Graphs, Bicliques. | Pierre Aboulker, douard Bonnet, Eun Jung Kim, Florian Sikora |
| 2020 | Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. | Nikhil Vyas, R. Ryan Williams |
| 2020 | Asymptotic Divergences and Strong Dichotomy. | Xiang Huang, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull |
| 2020 | Generalised Pattern Matching Revisited. | Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya |
| 2020 | An FPT Algorithm for Minimum Additive Spanner Problem. | Yusuke Kobayashi |
| 2019 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2019 | A ZPP | Thomas Watson |
| 2019 | A Unified Approach to Tail Estimates for Randomized Incremental Construction. | Sandeep Sen |
| 2019 | Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension. | Gleb Posobin, Alexander Shen |
| 2019 | Paging with Dynamic Memory Capacity. | Enoch Peserico |
| 2019 | Finite Sequentiality of Unambiguous Max-Plus Tree Automata. | Erik Paul |
| 2019 | Stabilization Time in Weighted Minority Processes. | Pl Andrs Papp, Roger Wattenhofer |
| 2019 | Algorithmic Data Science (Invited Talk). | Petra Mutzel |
| 2019 | The Many Facets of String Transducers (Invited Talk). | Anca Muscholl, Gabriele Puppis |
| 2019 | The Containment Problem for Unambiguous Register Automata. | Antoine Mottet, Karin Quaas |
| 2019 | Beyond Boolean Surjective VCSPs. | Gregor Matl, Stanislav Zivn |
| 2019 | Car-Sharing on a Star Network: On-Line Scheduling with k Servers. | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
| 2019 | Lifting Theorems for Equality. | Bruno Loff, Sagnik Mukhopadhyay |
| 2019 | Constructive Discrepancy Minimization with Hereditary L2 Guarantees. | Kasper Green Larsen |
| 2019 | Tree Automata with Global Constraints for Infinite Trees. | Patrick Landwehr, Christof Lding |
| 2019 | Algorithmic Properties of Sparse Digraphs. | Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz |
| 2019 | The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. | Robert Krauthgamer, Ohad Trabelsi |
| 2019 | Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. | Dusan Knop, Michal Pilipczuk, Marcin Wrochna |