- Talya Eden, Reut Levi, Dana Ron. Testing Bounded Arboricity. ACM Transactions on Algorithms, 16(2), 2020.
- Friedrich Eisenbrand, Robert Weismantel. Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. ACM Transactions on Algorithms, 16(1), 2020.
- Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra. A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs. ACM Transactions on Algorithms, 16(1), 2020.
- Chloe Ching-Yun Hsu, Chris Umans. A New Algorithm for Fast Generalized DFTs. ACM Transactions on Algorithms, 16(1), 2020.
- Maria-Florina Balcan, Nika Haghtalab, Colin White. k-center Clustering under Perturbation Resilience. ACM Transactions on Algorithms, 16(2), 2020.
- Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu 0001. Algorithms to Approximate Column-sparse Packing Problems. ACM Transactions on Algorithms, 16(1), 2020.
- Manuela Fischer, Andreas Noever. Tight Analysis of Parallel Randomized Greedy MIS. ACM Transactions on Algorithms, 16(1), 2020.
- Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman. Ramsey Spanning Trees and Their Applications. ACM Transactions on Algorithms, 16(2), 2020.
- Pawel Gawrychowski, Shay Mozes, Oren Weimann. Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. ACM Transactions on Algorithms, 16(2), 2020.
- Saleh Soltan, Mihalis Yannakakis, Gil Zussman. Doubly Balanced Connected Graph Partitioning. ACM Transactions on Algorithms, 16(2), 2020.