| 2021 | The Secretary Problem with Independent Sampling. | Jos Correa, Andrs Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis |
| 2021 | Hamiltonicity of random subgraphs of the hypercube. | Padraig Condon, Alberto Espuny Daz, Antnio Giro, Daniela Khn, Deryk Osthus |
| 2021 | On Approximability of Clustering Problems Without Candidate Centers. | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2021 | Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. | Julia Chuzhoy, Thatchaphol Saranurak |
| 2021 | Rapid Mixing for Colorings via Spectral Independence. | Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2021 | Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. | Kuan Cheng, Xin Li |
| 2021 | Efficient Linear and Affine Codes for Correcting Insertions/Deletions. | Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li |
| 2021 | Polynomial-time trace reconstruction in the smoothed complexity model. | Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha |
| 2021 | Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. | Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wrblewski, Anna Zych-Pawlewicz |
| 2021 | Incremental Single Source Shortest Paths in Sparse Digraphs. | Shiri Chechik, Tianyi Zhang |
| 2021 | Optimal Girth Approximation for Dense Directed Graphs. | Shiri Chechik, Gur Lifshitz |
| 2021 | Competitive Allocation of a Mixed Manna. | Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta |
| 2021 | Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. | Karthekeyan Chandrasekaran, Chandra Chekuri |
| 2021 | Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices. | Timothy M. Chan |
| 2021 | (Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems. | Timothy M. Chan |
| 2021 | How to Morph Graphs on the Torus. | Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa |
| 2021 | Coloring and Maximum Weight Independent Set of Rectangles. | Parinya Chalermsook, Bartosz Walczak |
| 2021 | Vertex Sparsification for Edge Connectivity. | Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz |
| 2021 | Approximating the Median under the Ulam Metric. | Diptarka Chakraborty, Debarati Das, Robert Krauthgamer |
| 2021 | Tight Distributed Listing of Cliques. | Keren Censor-Hillel, Yi-Jun Chang, Franois Le Gall, Dean Leitersdorf |
| 2021 | Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning. | Clment L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten |
| 2021 | An Efficient | Yang Cai, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao |
| 2021 | An FPTAS for the square lattice six-vertex and eight-vertex models at low temperatures. | Jin-Yi Cai, Tianyu Liu |
| 2021 | On Multi-Dimensional Gains from Trade Maximization. | Yang Cai, Kira Goldner, Steven Ma, Mingfei Zhao |
| 2021 | New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification. | Jin-Yi Cai, Zhiguo Fu, Shuai Shao |