| 2020 | Approximating k-Connected m-Dominating Sets. | Zeev Nutov |
| 2020 | Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. | Dniel Marx, R. B. Sandeep |
| 2020 | Chordless Cycle Packing Is Fixed-Parameter Tractable. | Dniel Marx |
| 2020 | Augmenting the Algebraic Connectivity of Graphs. | Bogdan-Adrian Manghiuc, Pan Peng, He Sun |
| 2020 | On the Computational Complexity of Linear Discrepancy. | Lily Li, Aleksandar Nikolov |
| 2020 | Light Euclidean Spanners with Steiner Points. | Hung Le, Shay Solomon |
| 2020 | Settling the Relationship Between Wilber's Bounds for Dynamic Optimality. | Victor Lecomte, Omri Weinstein |
| 2020 | Many Visits TSP Revisited. | Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlstrm |
| 2020 | Exploiting c-Closure in Kernelization Algorithms for Graph Problems. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2020 | A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. | Mamadou Moustapha Kant, Christophe Paul, Dimitrios M. Thilikos |
| 2020 | Optimal Polynomial-Time Compression for Boolean Max CSP. | Bart M. P. Jansen, Michal Wlodarczyk |
| 2020 | The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance. | Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan |
| 2020 | Approximate Turing Kernelization for Problems Parameterized by Treewidth. | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
| 2020 | Finding All Global Minimum Cuts in Practice. | Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash |
| 2020 | Fully-Dynamic Coresets. | Monika Henzinger, Sagar Kale |
| 2020 | Dynamic Matching Algorithms in Practice. | Monika Henzinger, Shahbaz Khan, Richard D. Paul, Christian Schulz |
| 2020 | An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams. | Martin Held, Stefan de Lorenzo |
| 2020 | Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. | Naveen Garg, Nikhil Kumar |
| 2020 | Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. | Younan Gao, Meng He, Yakov Nekrich |
| 2020 | A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. | Zachary Friggstad, Chaitanya Swamy |
| 2020 | On Compact RAC Drawings. | Henry Frster, Michael Kaufmann |
| 2020 | An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. | Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | On the Complexity of Recovering Incidence Matrices. | Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan |
| 2020 | Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. | Fedor V. Fomin, Petr A. Golovach |
| 2020 | Kernelization of Whitney Switches. | Fedor V. Fomin, Petr A. Golovach |