| 2020 | Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. | Jacobo Torn, Florian Wrz |
| 2020 | Statistical Physics and Algorithms (Invited Talk). | Dana Randall |
| 2020 | Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. | Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
| 2020 | Randomness and Initial Segment Complexity for Probability Measures. | Andr Nies, Frank Stephan |
| 2020 | The SDP Value for Random Two-Eigenvalue CSPs. | Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes |
| 2020 | Computing Maximum Matchings in Temporal Graphs. | George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche |
| 2020 | A Trichotomy for Regular Trail Queries. | Wim Martens, Matthias Niewerth, Tina Trautner |
| 2020 | Inapproximability Results for Scheduling with Interval and Resource Restrictions. | Marten Maack, Klaus Jansen |
| 2020 | The Tandem Duplication Distance Is NP-Hard. | Manuel Lafond, Binhai Zhu, Peng Zou |
| 2020 | Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths. | Stefan Kratsch, Florian Nelles |
| 2020 | Decidability and Periodicity of Low Complexity Tilings. | Jarkko Kari, Etienne Moutot |
| 2020 | Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. | Taisuke Izumi, Franois Le Gall, Frdric Magniez |
| 2020 | On the Termination of Flooding. | Walter Hussak, Amitabh Trehan |
| 2020 | Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
| 2020 | Constant-Time Dynamic (Δ+1)-Coloring. | Monika Henzinger, Pan Peng |
| 2020 | Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space. | Falko Hegerfeld, Stefan Kratsch |
| 2020 | Parameterized Pre-Coloring Extension and List Coloring Problems. | Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlstrm |
| 2020 | Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. | Brieuc Guinard, Amos Korman |
| 2020 | Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). | Martin Grohe |
| 2020 | Oracle Complexity Classes and Local Measurements on Physical Hamiltonians. | Sevag Gharibian, Stephen Piddock, Justin Yirka |
| 2020 | Existential Length Universality. | Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula |
| 2020 | Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before. | Michal Ganczorz |
| 2020 | Computing Shrub-Depth Decompositions. | Jakub Gajarsk, Stephan Kreutzer |
| 2020 | Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. | Mitsuru Funakoshi, Julian Pape-Lange |
| 2020 | Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. | Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |