| 2021 | k-Center Clustering with Outliers in the Sliding-Window Model. | Mark de Berg, Morteza Monemizadeh, Yu Zhong |
| 2021 | Incremental Edge Orientation in Forests. | Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein |
| 2021 | k-Distinct Branchings Admits a Polynomial Kernel. | Jrgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh |
| 2021 | Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. | Evripidis Bampis, Christoph Drr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlter |
| 2021 | The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. | Nikhil Ayyadevara, Ashish Chiplunkar |
| 2021 | Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. | Sepehr Assadi, Shay Solomon |
| 2021 | Graph Connectivity and Single Element Recovery via Linear and OR Queries. | Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna |
| 2021 | Parallel Computation of Combinatorial Symmetries. | Markus Anders, Pascal Schweitzer |
| 2021 | The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. | Carlos Alegra, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Hendrik Schrezenmaier, Carlos Seara, Martin Suderland |
| 2021 | A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. | Maor Akav, Liam Roditty |
| 2021 | Bi-Objective Search with Bi-Directional A. | Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby |
| 2021 | Restricted t-Matchings via Half-Edges. | Katarzyna Paluch, Mateusz Wasylkiewicz |
| 2021 | Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2021 | On Approximate Compressions for Connected Minor-Hitting Sets. | M. S. Ramanujan |
| 2021 | A User Friendly Power Tool for Deriving Online Learning Algorithms (Invited Talk). | Aaron Roth |
| 2020 | On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP. | Xianghui Zhong |
| 2020 | Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents. | Hanrui Zhang |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2020 | Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. | Ben Strasser, Dorothea Wagner, Tim Zeitz |
| 2020 | Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. | Philipp Schepper |
| 2020 | Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. | Hanlin Ren |
| 2020 | Efficient Computation of 2-Covers of a String. | Jakub Radoszewski, Juliusz Straszynski |
| 2020 | Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching. | Ioannis Panagiotas, Bora Uar |
| 2020 | Generalizing CGAL Periodic Delaunay Triangulations. | Georg Osang, Mael Rouxel-Labb, Monique Teillaud |
| 2020 | Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. | Karolina Okrasa, Marta Piecyk, Pawel Rzazewski |