| 2020 | The Online Submodular Cover Problem. | Anupam Gupta, Roie Levin |
| 2020 | Improved Local Computation Algorithm for Set Cover via Sparsification. | Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian |
| 2020 | One (more) line on the most Ancient Algorithm in History. | Bruno Grenet, Ilya Volkovich |
| 2020 | Round Complexity of Common Randomness Generation: The Amortized Setting. | Noah Golowich, Madhu Sudan |
| 2020 | Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | The Directed Flat Wall Theorem. | Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon |
| 2020 | Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems. | Rohan Ghuge, Viswanath Nagarajan |
| 2020 | Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. | Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup |
| 2020 | Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. | Jugal Garg, Pooja Kulkarni, Rucha Kulkarni |
| 2020 | Sandwiching random regular graphs between binomial random graphs. | Pu Gao, Mikhail Isaev, Brendan D. McKay |
| 2020 | Atomic Embeddability, Clustered Planarity, and Thickenability. | Radoslav Fulek, Csaba D. Tth |
| 2020 | A randomly weighted minimum spanning tree with a random cost constraint. | Alan M. Frieze, Tomasz Tkocz |
| 2020 | Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. | Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2020 | Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2020 | Labelings vs. Embeddings: On Distributed Representations of Distances. | Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer |
| 2020 | A face cover perspective to | Arnold Filtser |
| 2020 | Embeddability of Simplicial Complexes is Undecidable. | Marek Filakovsk, Uli Wagner, Stephan Zhechev |
| 2020 | Quasi-popular Matchings, Optimality, and Extended Formulations. | Yuri Faenza, Telikepalli Kavitha |
| 2020 | Computational Concentration of Measure: Optimal Bounds, Reductions, and More. | Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody |
| 2020 | Lossless Prioritized Embeddings. | Michael Elkin, Ofer Neiman |
| 2020 | Differentially Private Release of Synthetic Graphs. | Marek Elis, Michael Kapralov, Janardhan Kulkarni, Yin Tat Lee |
| 2020 | Sample Efficient Toeplitz Covariance Estimation. | Yonina C. Eldar, Jerry Li, Cameron Musco, Christopher Musco |
| 2020 | Faster sublinear approximation of the number of | Talya Eden, Dana Ron, C. Seshadhri |
| 2020 | Baker game and polynomial-time approximation schemes. | Zdenek Dvork |
| 2020 | The Complexity of Contracts. | Paul Dtting, Tim Roughgarden, Inbal Talgam-Cohen |