| 2021 | Treewidth-Pliability and PTAS for Max-CSPs. | Miguel Romero, Marcin Wrochna, Stanislav Zivn |
| 2021 | Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. | Peter Robinson |
| 2021 | Spectral Sparsification of Metrics and Kernels. | Kent Quanrud |
| 2021 | On Locating Paths in Compressed Tries. | Nicola Prezza |
| 2021 | Solving Sparse Linear Systems Faster than Matrix Multiplication. | Richard Peng, Santosh S. Vempala |
| 2021 | Directed Shortest Paths via Approximate Cost Balancing. | James B. Orlin, Lszl A. Vgh |
| 2021 | Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. | Krzysztof Nowicki, Krzysztof Onak |
| 2021 | The Demand Query Model for Bipartite Matching. | Noam Nisan |
| 2021 | Rankwidth meets stability. | Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2021 | New Data Structures for Orthogonal Range Reporting and Range Minima Queries. | Yakov Nekrich |
| 2021 | A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. | Jesper Nederlof, Jakub Pawlewicz, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2021 | Improved Algorithms for Population Recovery from the Deletion Channel. | Shyam Narayanan |
| 2021 | On Tolerant Distribution Testing in the Conditional Sampling Model. | Shyam Narayanan |
| 2021 | Online Generalized Network Design Under (Dis)Economies of Scale. | Viswanath Nagarajan, Lily Wang |
| 2021 | A tight condition for triangle factors in pseudorandom graphs. | Patrick Morris |
| 2021 | Minimum-cost integer circulations in given homology classes. | Sarah Morell, Ina Seidel, Stefan Weltge |
| 2021 | Robust Algorithms for Online Convex Problems via Primal-Dual. | Marco Molinaro |
| 2021 | Improved Sublinear Time Algorithm for Longest Increasing Subsequence. | Michael Mitzenmacher, Saeed Seddighin |
| 2021 | On a combinatorial generation problem of Knuth. | Arturo Merino, Ondrej Micka, Torsten Mtze |
| 2021 | Competitive Data-Structure Dynamization. | Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi |
| 2021 | Optimal | Arvind V. Mahankali, David P. Woodruff |
| 2021 | Planar Distance Oracles with Better Time-Space Tradeoffs. | Yaowei Long, Seth Pettie |
| 2021 | Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). | Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2021 | FPT-approximation for FPT Problems. | Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2021 | A Polynomial Time Algorithm for the | William Lochet |