| 2019 | A Practical Algorithm for Spatial Agglomerative Clustering. Thom Castermans, Bettina Speckmann, Kevin Verbeek |
| 2019 | A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. Adalat Jabrayilov, Petra Mutzel |
| 2019 | Alternative Multicriteria Routes. Florian Barth, Stefan Funke, Sabine Storandt |
| 2019 | Approximation of trees by self-nested trees. Romain Azaïs, Jean-Baptiste Durand, Christophe Godin |
| 2019 | Batch-Parallel Euler Tour Trees. Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch |
| 2019 | Concatenated k-Path Covers. Moritz Beck, Kam-yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu |
| 2019 | Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck |
| 2019 | Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang |
| 2019 | Fast and Exact Public Transit Routing with Restricted Pareto Sets. Daniel Delling, Julian Dibbelt, Thomas Pajor |
| 2019 | Faster Support Vector Machines. Sebastian Schlag, Matthias Schmitt, Christian Schulz |
| 2019 | Lightweight Distributed Suffix Array Construction. Johannes Fischer, Florian Kurpicz |
| 2019 | Parallel Range, Segment and Rectangle Queries with Augmented Maps. Yihan Sun, Guy E. Blelloch |
| 2019 | Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. Sándor P. Fekete, Dominik Krupke |
| 2019 | Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019. Stephen G. Kobourov, Henning Meyerhenke |
| 2019 | SAT-Encodings for Treecut Width and Treedepth. Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2019 | Scalable Edge Partitioning. Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash |
| 2019 | Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. Martin Aumüller, Nikolaj Hass |
| 2019 | Worst-Case Efficient Sorting with QuickMergesort. Stefan Edelkamp, Armin Weiß |