| 2019 | SAT-Encodings for Treecut Width and Treedepth. | Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2019 | Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. | Sndor P. Fekete, Dominik Krupke |
| 2019 | Worst-Case Efficient Sorting with QuickMergesort. | Stefan Edelkamp, Armin Wei |
| 2019 | Fast and Exact Public Transit Routing with Restricted Pareto Sets. | Daniel Delling, Julian Dibbelt, Thomas Pajor |
| 2019 | A Practical Algorithm for Spatial Agglomerative Clustering. | Thom Castermans, Bettina Speckmann, Kevin Verbeek |
| 2019 | Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. | Thomas Blsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck |
| 2019 | Concatenated k-Path Covers. | Moritz Beck, Kam-yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu |
| 2019 | Alternative Multicriteria Routes. | Florian Barth, Stefan Funke, Sabine Storandt |
| 2019 | Approximation of trees by self-nested trees. | Romain Azas, Jean-Baptiste Durand, Christophe Godin |
| 2019 | Lightweight Distributed Suffix Array Construction. | Johannes Fischer, Florian Kurpicz |
| 2019 | Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. | Martin Aumller, Nikolaj Hass |
| 2019 | Parallel Range, Segment and Rectangle Queries with Augmented Maps. | Yihan Sun, Guy E. Blelloch |
| 2018 | Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
| 2018 | A Geometric Heuristic for Rectilinear Crossing Minimization. | Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner |
| 2018 | Adaptive Cuckoo Filters. | Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego |
| 2018 | Area-Preserving Subdivision Simplification with Topology Constraints: Exactly and in Practice. | Thomas Mendel |
| 2018 | Faster Approximation Algorithm for the | Nirman Kumar, Stavros Sintos |
| 2018 | A practical fpt algorithm for Flow Decomposition and transcript assembly. | Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Snchez Villaamil, Blair D. Sullivan, Andrew van der Poel |
| 2018 | Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs. | Petteri Kaski |
| 2018 | Scalable Kernelization for Maximum Independent Sets. | Demian Hespe, Christian Schulz, Darren Strash |
| 2018 | Practical Minimum Cut Algorithms. | Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash |
| 2018 | Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. | Marc Hellmuth, Anders S. Knudsen, Michal Kotrbck, Daniel Merkle, Nikolai Njgaard |
| 2018 | Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. | Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel |
| 2018 | Hybrid Indexing Revisited. | Hctor Ferrada, Dominik Kempa, Simon J. Puglisi |
| 2018 | Grid peeling and the affine curve-shortening flow. | David Eppstein, Sariel Har-Peled, Gabriel Nivasch |