| 2021 | Planar Reachability Under Single Vertex or Edge Failures. | Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis |
| 2021 | An improved procedure for colouring graphs of bounded local density. | Eoin Hurley, Rmi de Joannis de Verclos, Ross J. Kang |
| 2021 | PTAS for Minimum Cost Multi-covering with Disks. | Ziyun Huang, Qilong Feng, Jianxin Wang, Jinhui Xu |
| 2021 | Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. | Shuichi Hirahara, Nobutaka Shimizu |
| 2021 | Tight Bounds for Online Graph Partitioning. | Monika Henzinger, Stefan Neumann, Harald Rcke, Stefan Schmid |
| 2021 | Non-linear Hamilton cycles in linear quasi-random hypergraphs. | Jie Han, Xichao Shu, Guanghui Wang |
| 2021 | On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood. | Yanjun Han, Kirankumar Shiragur |
| 2021 | Explicit two-deletion codes with redundancy matching the existential bound. | Venkatesan Guruswami, Johan Hstad |
| 2021 | The Connectivity Threshold for Dense Graphs. | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2021 | Improving the dilation of a metric graph by adding edges. | Joachim Gudmundsson, Sampson Wong |
| 2021 | Deep Weisfeiler Leman. | Martin Grohe, Pascal Schweitzer, Daniel Wiebking |
| 2021 | Approximating Pathwidth for Graphs of Small Treewidth. | Carla Groenland, Gwenal Joret, Wojciech Nadara, Bartosz Walczak |
| 2021 | Concentration bounds for almost | Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu |
| 2021 | All-Pairs LCA in DAGs: Breaking through the | Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski |
| 2021 | Algorithms for weighted independent transversals and strong colouring. | Alessandra Graf, David G. Harris, Penny Haxell |
| 2021 | Algorithms for Persuasion with Limited Communication. | Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky |
| 2021 | The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. | Gramoz Goranci, Harald Rcke, Thatchaphol Saranurak, Zihan Tan |
| 2021 | Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. | Michael T. Goodrich, Riko Jacob, Nodari Sitchinava |
| 2021 | Spectral Clustering Oracles in Sublinear Time. | Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler |
| 2021 | Approximation Algorithms and Hardness for Strong Unique Games. | Suprovat Ghoshal, Anand Louis |
| 2021 | A Time-Optimal Randomized Parallel Algorithm for MIS. | Mohsen Ghaffari, Bernhard Haeupler |
| 2021 | Improved Deterministic Network Decomposition. | Mohsen Ghaffari, Christoph Grunau, Vclav Rozhon |
| 2021 | Beyond Submodular Maximization via One-Sided Smoothness. | Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd |
| 2021 | Planar Negative | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2021 | Shorter Labels for Routing in Trees. | Pawel Gawrychowski, Wojciech Janczewski, Jakub Lopuszanski |