| 2021 | Hardness of Approximation for Orienteering with Multiple Time Windows. | Naveen Garg, Sanjeev Khanna, Amit Kumar |
| 2021 | Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. | Sebastian Forster, Gramoz Goranci, Monika Henzinger |
| 2021 | Counting Homomorphisms to | Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivn |
| 2021 | Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. | Arnold Filtser, Michael Kapralov, Navid Nouri |
| 2021 | Static and Streaming Data Structures for Frchet Distance Queries. | Arnold Filtser, Omrit Filtser |
| 2021 | A Topological Characterization of Modulo- | Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis |
| 2021 | Consistent k-Clustering for General Metrics. | Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson |
| 2021 | On Efficient Distance Approximation for Graph Properties. | Nimrod Fiat, Dana Ron |
| 2021 | Two-stage Stochastic Matching with Application to Ride Hailing. | Yiding Feng, Rad Niazadeh, Amin Saberi |
| 2021 | Distributed Metropolis Sampler with Optimal Parallelism. | Weiming Feng, Thomas P. Hayes, Yitong Yin |
| 2021 | Rapid Mixing from Spectral Independence beyond the Boolean Domain. | Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang |
| 2021 | Counting Small Permutation Patterns. | Chaim Even-Zohar, Calvin Leng |
| 2021 | EPTAS for | Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov |
| 2021 | Approximate Distance Oracles Subject to Multiple Vertex Failures. | Ran Duan, Yong Gu, Hanlin Ren |
| 2021 | Approximate Evaluation of First-Order Counting Queries. | Jan Dreier, Peter Rossmanith |
| 2021 | Rolling backwards can move you forward: on embedding problems in sparse expanders. | Nemanja Draganic, Michael Krivelevich, Rajko Nenadov |
| 2021 | Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting. | Itai Dinur |
| 2021 | Branch-and-Bound Solves Random Binary IPs in Polytime. | Santanu S. Dey, Yatharth Dubey, Marco Molinaro |
| 2021 | Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. | Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins |
| 2021 | Online Combinatorial Auctions. | Yuan Deng, Debmalya Panigrahi, Hanrui Zhang |
| 2021 | Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines. | Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang |
| 2021 | A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. | Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish |
| 2021 | A Fast Minimum Degree Algorithm and Matching Lower Bound. | Robert Cummings, Matthew Fahrbach, Animesh Fatehpuria |
| 2021 | Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. | Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschrder, Lars Rohwedder, Robert Weismantel |
| 2021 | On Indexing and Compressing Finite Automata. | Nicola Cotumaccio, Nicola Prezza |