| 2020 | Wear Leveling Revisited. | Taku Onodera, Tetsuo Shibuya |
| 2020 | Compact Routing in Unit Disk Graphs. | Wolfgang Mulzer, Max Willert |
| 2020 | Shared vs Private Randomness in Distributed Interactive Proofs. | Pedro Montealegre, Diego Ramrez-Romero, Ivan Rapaport |
| 2020 | Sorting by Prefix Block-Interchanges. | Anthony Labarre |
| 2020 | The k-Server Problem with Delays on the Uniform Metric Space. | Predrag Krnetic, Darya Melnyk, Yuyi Wang, Roger Wattenhofer |
| 2020 | Between Shapes, Using the Hausdorff Distance. | Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen |
| 2020 | Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. | Martin Kouteck, Johannes Zink |
| 2020 | Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2020 | Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem. | Kangsan Kim, Yongho Shin, Hyung-Chan An |
| 2020 | Indexing Isodirectional Pointer Sequences. | Sung-Hwan Kim, Hwan-Gue Cho |
| 2020 | Contracting to a Longest Path in H-Free Graphs. | Walter Kern, Danil Paulusma |
| 2020 | Approximations for Throughput Maximization. | Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
| 2020 | Space Hardness of Solving Structured Linear Systems. | Xuangui Huang |
| 2020 | Recency Queries with Succinct Representation. | William L. Holland, Anthony Wirth, Justin Zobel |
| 2020 | Gourds: A Sliding-Block Puzzle with Turning. | Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden |
| 2020 | Approximating the Packedness of Polygonal Curves. | Joachim Gudmundsson, Yuan Sha, Sampson Wong |
| 2020 | Improved FPT Algorithms for Deletion to Forest-Like Structures. | Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh |
| 2020 | Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. | Loukas Georgiadis, Evangelos Kosinas |
| 2020 | Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences. | Stefan Funke, Felix Weitbrecht |
| 2020 | Complexity of Stability. | Fabian Frei, Edith Hemaspaandra, Jrg Rothe |
| 2020 | Diverse Pairs of Matchings. | Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov |
| 2020 | Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. | Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche |
| 2020 | A Unified Framework of FPT Approximation Algorithms for Clustering Problems. | Qilong Feng, Zhen Zhang, Ziyun Huang, Jinhui Xu, Jianxin Wang |
| 2020 | Sparse Hop Spanners for Unit Disk Graphs. | Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tth |
| 2020 | Efficient Labeling for Reachability in Directed Acyclic Graphs. | Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski |