| 2020 | Coresets for the Nearest-Neighbor Rule. | Alejandro Flores-Velazco, David M. Mount |
| 2020 | Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. | Andreas Emil Feldmann, David Saulpic |
| 2020 | Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. | Chenglin Fan, Benjamin Raichel |
| 2020 | A (1-e | Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai |
| 2020 | Approximate CVP | Friedrich Eisenbrand, Moritz Venzin |
| 2020 | A Polynomial Kernel for Line Graph Deletion. | Eduard Eiben, William Lochet |
| 2020 | Optimally Handling Commitment Issues in Online Throughput Maximization. | Franziska Eberle, Nicole Megow, Kevin Schewior |
| 2020 | First-Order Model-Checking in Random Graphs and Complex Networks. | Jan Dreier, Philipp Kuinke, Peter Rossmanith |
| 2020 | Practical Performance of Space Efficient Data Structures for Longest Common Extensions. | Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz |
| 2020 | A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions. | Hu Ding |
| 2020 | Approximation Algorithms for Clustering with Dynamic Points. | Shichuan Deng, Jian Li, Yuval Rabani |
| 2020 | Compact Oblivious Routing in Weighted Graphs. | Philipp Czerner, Harald Rcke |
| 2020 | Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. | Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl |
| 2020 | Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays. | Man-Kwun Chiu, Matias Korman, Martin Suderland, Takeshi Tokuyama |
| 2020 | The Number of Repetitions in 2D-Strings. | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2020 | Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. | Panagiotis Charalampopoulos, Adam Karczmarz |
| 2020 | More on Change-Making and Related Problems. | Timothy M. Chan, Qizheng He |
| 2020 | The Maximum Binary Tree Problem. | Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu |
| 2020 | New Binary Search Tree Bounds via Geometric Inversions. | Parinya Chalermsook, Wanchote Po Jiamjitrak |
| 2020 | Sometimes Reliable Spanners of Almost Linear Size. | Kevin Buchin, Sariel Har-Peled, Dniel Olh |
| 2020 | Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice. | Peter A. Brooksbank, Yinan Li, Youming Qiao, James B. Wilson |
| 2020 | When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Frchet Distance Under Translation. | Karl Bringmann, Marvin Knnemann, Andr Nusser |
| 2020 | Reconfiguration of Spanning Trees with Many or Few Leaves. | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
| 2020 | An Algorithmic Weakening of the Erdős-Hajnal Conjecture. | douard Bonnet, Stphan Thomass, Xuan Thang Tran, Rmi Watrigant |
| 2020 | Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. | Jan Bok, Nikola Jedlickov, Barnaby Martin, Danil Paulusma, Siani Smith |