| 2021 | Data Structures Lower Bounds and Popular Conjectures. | Pavel Dvork, Michal Kouck, Karel Krl, Veronika Slvov |
| 2021 | Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning. | Hu Ding |
| 2021 | Faster 3-Coloring of Small-Diameter Graphs. | Michal Debski, Marta Piecyk, Pawel Rzazewski |
| 2021 | An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh |
| 2021 | Minimum Common String Partition: Exact Algorithms. | Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov |
| 2021 | Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. | Radu Curticapean, Holger Dell, Thore Husfeldt |
| 2021 | Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. | Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel |
| 2021 | Feature Cross Search via Submodular Optimization. | Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu |
| 2021 | Faster Algorithms for Longest Common Substring. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski |
| 2021 | Dynamic Colored Orthogonal Range Searching. | Timothy M. Chan, Zhengcheng Huang |
| 2021 | ℓ | Karthekeyan Chandrasekaran, Weihang Wang |
| 2021 | All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. | Timothy M. Chan |
| 2021 | Balanced Crown Decomposition for Connectivity Constraints. | Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif |
| 2021 | Worst-Case Efficient Dynamic Geometric Independent Set. | Jean Cardinal, John Iacono, Grigorios Koumoutsos |
| 2021 | An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. | Jean Cardinal, Justin Dallant, John Iacono |
| 2021 | Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete. | David Caballero, Timothy Gomez, Robert Schweller, Tim Wylie |
| 2021 | Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. | Alexander Braun, Matthias Buttkus, Thomas Kesselheim |
| 2021 | Synchronized Planarity with Applications to Constrained Planarity Problems. | Thomas Blsius, Simon D. Fink, Ignaz Rutter |
| 2021 | Efficiently Computing Maximum Flows in Scale-Free Networks. | Thomas Blsius, Tobias Friedrich, Christopher Weyand |
| 2021 | Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. | Thomas Blsius, Tobias Friedrich, Maximilian Katzmann |
| 2021 | Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. | Davide Bil, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2021 | Distant Representatives for Rectangles in the Plane. | Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud |
| 2021 | Online Euclidean Spanners. | Sujoy Bhore, Csaba D. Tth |
| 2021 | Lyndon Words Accelerate Suffix Sorting. | Nico Bertram, Jonas Ellert, Johannes Fischer |
| 2021 | Incremental SCC Maintenance in Sparse Graphs. | Aaron Bernstein, Aditi Dudeja, Seth Pettie |