| 2021 | Crossing-Optimal Extension of Simple Drawings. | Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber |
| 2021 | Universal Algorithms for Clustering Problems. | Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi |
| 2021 | Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. | Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang |
| 2021 | Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. | Zachary Friggstad, Chaitanya Swamy |
| 2021 | The Theory of Concatenation over Finite Models. | Dominik D. Freydenberger, Liat Peterfreund |
| 2021 | On the Approximability of Multistage Min-Sum Set Cover. | Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis |
| 2021 | Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. | Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2021 | Linear Time Runs Over General Ordered Alphabets. | Jonas Ellert, Johannes Fischer |
| 2021 | Error Resilient Space Partitioning (Invited Talk). | Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, Ran J. Tessler |
| 2021 | Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. | Ewan Davies, Will Perkins |
| 2021 | Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. | Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci |
| 2021 | On Greedily Packing Anchored Rectangles. | Christoph Damerius, Dominik Kaaser, Peter Kling, Florian Schneider |
| 2021 | Approximation Algorithms for Min-Distance Problems in DAGs. | Mina Dalirrooyfard, Jenny Kaufmann |
| 2021 | Haystack Hunting Hints and Locker Room Communication. | Artur Czumaj, George Kontogeorgiou, Mike Paterson |
| 2021 | New Techniques for Universality in Unambiguous Register Automata. | Wojciech Czerwinski, Antoine Mottet, Karin Quaas |
| 2021 | Improved Lower Bounds for Reachability in Vector Addition Systems. | Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski |
| 2021 | A Complexity Approach to Tree Algebras: the Bounded Case. | Thomas Colcombet, Arthur Jaquard |
| 2021 | Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle. | Christian Coester, Elias Koutsoupias |
| 2021 | Deterministic and Game Separability for Regular Languages of Infinite Trees. | Lorenzo Clemente, Michal Skrzypczak |
| 2021 | Inference Systems with Corules for Fair Subtyping and Liveness Properties of Binary Session Types. | Luca Ciccone, Luca Padovani |
| 2021 | Quantum Query Complexity with Matrix-Vector Products. | Andrew M. Childs, Shih-Han Hung, Tongyang Li |
| 2021 | Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries. | Yu Chen, Sanjeev Khanna, Ansh Nagda |
| 2021 | Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. | Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng |
| 2021 | Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. | Chandra Chekuri, Kent Quanrud |
| 2021 | Faster Algorithms for Rooted Connectivity in Directed Graphs. | Chandra Chekuri, Kent Quanrud |