| 2020 | Equivalences between triangle and range query problems. | Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams |
| 2020 | On the Cover of the Rolling Stone. | Adrian Dumitrescu, Csaba D. Tth |
| 2020 | Diameter computation on | Guillaume Ducoffe, Michel Habib, Laurent Viennot |
| 2020 | Computing Circle Packing Representations of Planar Graphs. | Sally Dong, Yin Tat Lee, Kent Quanrud |
| 2020 | Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. | Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani |
| 2020 | Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. | Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun |
| 2020 | Computing Minimal Persistent Cycles: Polynomial and Hard Cases. | Tamal K. Dey, Tao Hou, Sayan Mandal |
| 2020 | Approximately counting and sampling small witnesses using a colourful decision oracle. | Holger Dell, John Lapinskas, Kitty Meeks |
| 2020 | Improved bounds for centered colorings. | Michal Debski, Stefan Felsner, Piotr Micek, Felix Schrder |
| 2020 | A Tale of Santa Claus, Hypergraphs and Matroids. | Sami Davies, Thomas Rothvoss, Yihao Zhang |
| 2020 | On the Learnability of Random Deep Networks. | Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar, Rina Panigrahy |
| 2020 | Sublinear time approximation of the cost of a metric | Artur Czumaj, Christian Sohler |
| 2020 | Individual Sensitivity Preprocessing for Data Privacy. | Rachel Cummings, David Durfee |
| 2020 | Algorithmic Price Discrimination. | Rachel Cummings, Nikhil R. Devanur, Zhiyi Huang, Xiangning Wang |
| 2020 | The Two-Sided Game of Googol and Sample-Based Prophet Inequalities. | Jos R. Correa, Andrs Cristi, Boris Epstein, Jos A. Soto |
| 2020 | The stable set problem in graphs with bounded genus and bounded odd cycle packing number. | Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenal Joret, Stefan Weltge |
| 2020 | The rank of sparse random matrices. | Amin Coja-Oghlan, Alperen Ali Ergr, Pu Gao, Samuel Hetterich, Maurice Rolvien |
| 2020 | Instance-Optimality in the Noisy Value-and Comparison-Model. | Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu |
| 2020 | Approximation Schemes for Capacitated Clustering in Doubling Metrics. | Vincent Cohen-Addad |
| 2020 | Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. | Timothy Chu, Gary L. Miller, Donald R. Sheehy |
| 2020 | Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in | Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stphan Thomass |
| 2020 | Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms. | Keerti Choudhary, Omer Gold |
| 2020 | Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity. | Alessandro Chiesa, Tom Gur, Igor Shinkar |
| 2020 | Selling Information Through Consulting. | Yiling Chen, Haifeng Xu, Shuran Zheng |
| 2020 | A Lower Bound on Cycle-Finding in Sparse Digraphs. | Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun |