Worst-case efficient sorting with QuickMergeSort / Stefan Edelkamp and Armin Wei
Simple and fast BlockQuicksort using Lomuto's partitioning scheme / Martin Aumüller and Nikolaj Hass
Lightweight distributed suffix array construction / Johannes Fischer and Florian Kurpicz
Approximation of trees by self-nested trees / Romain Azaïs, Jean-Baptiste Durand, and Christophe Godin
Fast and exact public transit routing with restricted Pareto sets / Daniel Delling, Julian Dibbelt, and Thomas Pajor
Alternative multicriteria routes / Florian Barth, Stefan Funke, and Sabine Storandt
Concatenated k-path covers / Moritz Beck, Kam-Yiu Lam, Joseph Kee Yin Ng, Sabine Storandt, and Chun Jiang Zhu
Batch-parallel Euler tour trees / Thomas Tseng, Laxman Dhulipala, and Guy Blelloch
A new integer linear program for the Steiner tree problem with revenues, budget and hop constraints / Adalat Jabrayilov and Petra Mutzel
SAT-Encodings for treecut width and treedepth / Robert Ganian, Neha Lodha, Sebastian Ordyniak, and Stefan Szeider
Efficiently enumerating hitting sets of hypergraphs arising in data profiling / Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, and Martin Schirneck
Exactly solving the maximum weight independent set problem on large real-world graphs / Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, and Huashuo Zhang
Parallel range, segment and rectangle queries with augmented maps / Yihan Sun and Guy E. Blelloch
A practical algorithm for spatial agglomerative clustering / Thom Castermans, Bettina Speckman, and Kevin Verbeek
Practical methods for computing large covering tours and cycle covers with turn cost / Sándor P. Fekete and Dominik Krupke
Faster support vector machines / Sebastian Schlag, Matthias Schmitt, and Christian Schulz
Scalable edge partitioning / Sebastian Schlag, Christian Schulz, Daniel Seemaier, and Darren Strash.