| 2020 | Computational Complexity of Synchronization Under Regular Commutative Constraints. | Stefan Hoffmann |
| 2020 | Approximation Algorithms for the Lower-Bounded k-Median and Its Generalizations. | Lu Han, Chunlin Hao, Chenchen Wu, Zhenning Zhang |
| 2020 | Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games. | Gregory Z. Gutin, Philip R. Neary, Anders Yeo |
| 2020 | Computing a Maximum Clique in Geometric Superclasses of Disk Graphs. | Nicolas Grelier |
| 2020 | End-Vertices of AT-free Bigraphs. | Jan Gorzny, Jing Huang |
| 2020 | Approaching Optimal Duplicate Detection in a Sliding Window. | Rmi Graud-Stewart, Marius Lombard-Platet, David Naccache |
| 2020 | Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road Networks. | Stefan Funke |
| 2020 | Approximate Set Union via Approximate Randomization. | Bin Fu, Pengfei Gu, Yuming Zhao |
| 2020 | Hardness of Sparse Sets and Minimal Circuit Size Problem. | Bin Fu |
| 2020 | An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane. | Patrick Eades, Julin Mestre |
| 2020 | Realization Problems on Reachability Sequences. | Matthew Dippel, Ravi Sundaram, Akshar Varma |
| 2020 | Subspace Approximation with Outliers. | Amit Deshpande, Rameshwar Pratap |
| 2020 | Coding with Noiseless Feedback over the Z-Channel. | Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii |
| 2020 | On the Complexity of Directed Intersection Representation of DAGs. | Andrea Caucchiolo, Ferdinando Cicalese |
| 2020 | Deep Specification Mining with Attention. | Zhi Cao, Nan Zhang |
| 2020 | k-Critical Graphs in P | Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi |
| 2020 | Local Routing in a Tree Metric 1-Spanner. | Milutin Brankovic, Joachim Gudmundsson, Andr van Renssen |
| 2020 | On the Restricted 1-Steiner Tree Problem. | Prosenjit Bose, Anthony D'Angelo, Stephane Durocher |
| 2020 | Linear-Time Algorithms for Eliminating Claws in Graphs. | Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uverton S. Souza, Jayme Luiz Szwarcfiter |
| 2020 | Constructing Tree Decompositions of Graphs with Bounded Gonality. | Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit |
| 2020 | W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension. | Johannes Blum |
| 2020 | Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. | Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh |
| 2020 | A Non-Extendibility Certificate for Submodularity and Applications. | Umang Bhaskar, Gunjan Kumar |
| 2020 | Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. | Ivona Bezkov, Wenbo Sun |
| 2020 | A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. | Stephan Beyer, Markus Chimani, Joachim Spoerhase |