| 2020 | Domain Reduction for Monotonicity Testing: A | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2020 | Locally Consistent Parsing for Text Indexing in Small Space. | Or Birenzwige, Shay Golan, Ely Porat |
| 2020 | A Short Proof of the Toughness of Delaunay Triangulations. | Ahmad Biniaz |
| 2020 | Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. | Ahmad Biniaz |
| 2020 | Finding a latent | Chiranjib Bhattacharyya, Ravindran Kannan |
| 2020 | Coarse-Grained Complexity for Dynamic Algorithms. | Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak |
| 2020 | An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs. | Sayan Bhattacharya, Janardhan Kulkarni |
| 2020 | Reconstruction of Depth-4 Multilinear Circuits. | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
| 2020 | Flushing Without Cascades. | Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul |
| 2020 | New ( | Uri Ben-Levy, Merav Parter |
| 2020 | Very fast construction of bounded-degree spanning graphs via the semi-random graph process. | Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich |
| 2020 | Testing convexity of functions over finite domains. | Aleksandrs Belovs, Eric Blais, Abhinav Bommireddi |
| 2020 | Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. | Xiaohui Bei, Xiaoming Sun, Hao Wu, Jialin Zhang, Zhijie Zhang, Wei Zi |
| 2020 | Fully Dynamic Matching: Beating 2-Approximation in Δ | Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni |
| 2020 | Finding a Bounded-Degree Expander Inside a Dense One. | Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan |
| 2020 | A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
| 2020 | Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. | Yair Bartal, Nova Fandina, Seeun William Umboh |
| 2020 | Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. | Leonid Barenboim, Gal Oren |
| 2020 | Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces. | Jose Balanza-Martinez, Timothy Gomez, David Caballero, Austin Luchsinger, Angel A. Cantu, Rene Reyes, Mauricio Flores, Robert Schweller, Tim Wylie |
| 2020 | Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets. | Moshe Babaioff, Kira Goldner, Yannai A. Gonczarowski |
| 2020 | Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. | Brian Axelrod, Yang P. Liu, Aaron Sidford |
| 2020 | Improved Inapproximability of Rainbow Coloring. | Per Austrin, Amey Bhangale, Aditya Potukuchi |
| 2020 | Shortest Paths in a Hybrid Network Model. | John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider |
| 2020 | Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. | Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi |
| 2020 | Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. | Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |