| 2021 | Distance Computations in the Hybrid Network Model via Oracle Simulations. | Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin |
| 2021 | The Complexity of the Distributed Constraint Satisfaction Problem. | Silvia Butti, Victor Dalmau |
| 2021 | Optimization, Complexity and Invariant Theory (Invited Talk). | Peter Brgisser |
| 2021 | A Framework of Quantum Strong Exponential-Time Hypotheses. | Harry Buhrman, Subhasree Patro, Florian Speelman |
| 2021 | The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. | Ulrich A. Brodowsky, Stefan Hougardy |
| 2021 | Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio. | douard Bonnet |
| 2021 | Online Simple Knapsack with Reservation Costs. | Hans-Joachim Bckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith |
| 2021 | An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs. | Andreas Bjrklund |
| 2021 | A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. | Marcin Bienkowski, Bjrn Feldkord, Pawel Schmidt |
| 2021 | On Euclidean Steiner (1+ε)-Spanners. | Sujoy Bhore, Csaba D. Tth |
| 2021 | Synchronizing Strongly Connected Partial DFAs. | Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula |
| 2021 | A Characterization of Wreath Products Where Knapsack Is Decidable. | Pascal Bergstrer, Moses Ganardi, Georg Zetzsche |
| 2021 | Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case. | Libor Barto, Diego Battistelli, Kevin M. Berg |
| 2021 | Tight Approximation Guarantees for Concave Coverage Problems. | Siddharth Barman, Omar Fawzi, Paul Ferm |
| 2021 | Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. | Corentin Barloy, Lorenzo Clemente |
| 2021 | Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means. | Anna Arutyunova, Melanie Schmidt |
| 2021 | A Unified Framework of Quantum Walk Search. | Simon Apers, Andrs Gilyn, Stacey Jeffery |
| 2021 | An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. | Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2021 | Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen |
| 2021 | Spectrum Preserving Short Cycle Removal on Regular Graphs. | Pedro Paredes |
| 2021 | Lower Bounds for Graph-Walking Automata. | Olga Martynova, Alexander Okhotin |
| 2020 | Secret Key Agreement from Correlated Data, with No Prior Information. | Marius Zimand |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2020 | Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. | Michal Wrona |
| 2020 | An Automaton Group with PSPACE-Complete Word Problem. | Jan Philipp Wchter, Armin Wei |