| 2020 | Distributionally Robust Max Flows. | Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi |
| 2020 | Reconstruction under outliers for Fourier-sparse functions. | Xue Chen, Anindya De |
| 2020 | Fast LP-based Approximations for Geometric Packing and Covering Problems. | Chandra Chekuri, Sariel Har-Peled, Kent Quanrud |
| 2020 | Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. | Shiri Chechik, Tianyi Zhang |
| 2020 | A Little Charity Guarantees Almost Envy-Freeness. | Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa |
| 2020 | Adaptive Discrete Phase Retrieval. | Moses Charikar, Xian Wu, Yinyu Ye |
| 2020 | Better Data Structures for Colored Orthogonal Range Reporting. | Timothy M. Chan, Yakov Nekrich |
| 2020 | Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. | T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi |
| 2020 | On the Change-Making Problem. | Timothy M. Chan, Qizheng He |
| 2020 | Reducing 3SUM to Convolution-3SUM. | Timothy M. Chan, Qizheng He |
| 2020 | Tightening Curves on Surfaces Monotonically with Applications. | Hsien-Chih Chang, Arnaud de Mesmay |
| 2020 | Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. | Timothy M. Chan |
| 2020 | Multi-transversals for Triangles and the Tuza's Conjecture. | Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal |
| 2020 | On a Decentralized (Δ+1)-Graph Coloring Algorithm. | Deeparnab Chakrabarty, Paul de Supinski |
| 2020 | Vertex Ordering Problems in Directed Graph Streams. | Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, Sofya Vorotnikova |
| 2020 | Learning from satisfying assignments under continuous distributions. | Clment L. Canonne, Anindya De, Rocco A. Servedio |
| 2020 | Counting independent sets in unbalanced bipartite graphs. | Sarah Cannon, Will Perkins |
| 2020 | Chasing Nested Convex Bodies Nearly Optimally. | Sbastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li, Mark Sellke |
| 2020 | Extended Formulation Lower Bounds for Refuting Random CSPs. | Jonah Brown-Cohen, Prasad Raghavendra |
| 2020 | A Deterministic Linear Program Solver in Current Matrix Multiplication Time. | Jan van den Brand |
| 2020 | Symmetric Polymorphisms and Efficient Decidability of Promise CSPs. | Joshua Brakensiek, Venkatesan Guruswami |
| 2020 | Competitive Online Search Trees on Trees. | Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman |
| 2020 | Improved Algorithms for Edit Distance and LCS: Beyond Worst Case. | Mahdi Boroujeni, Masoud Seddighin, Saeed Seddighin |
| 2020 | Shorter Labeling Schemes for Planar Graphs. | Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk |
| 2020 | The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains. | Erica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell |