Abstract is missing.
- Worst-Case Efficient Sorting with QuickMergesortStefan Edelkamp, Armin Weiß. 1-14 [doi]
- Simple and Fast BlockQuicksort using Lomuto's Partitioning SchemeMartin Aumüller 0001, Nikolaj Hass. 15-26 [doi]
- Lightweight Distributed Suffix Array ConstructionJohannes Fischer 0001, Florian Kurpicz. 27-38 [doi]
- Approximation of trees by self-nested treesRomain Azaïs, Jean-Baptiste Durand, Christophe Godin. 39-53 [doi]
- Fast and Exact Public Transit Routing with Restricted Pareto SetsDaniel Delling, Julian Dibbelt, Thomas Pajor. 54-65 [doi]
- Alternative Multicriteria RoutesFlorian Barth, Stefan Funke, Sabine Storandt. 66-80 [doi]
- Concatenated k-Path CoversMoritz Beck, Kam-yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu. 81-91 [doi]
- Batch-Parallel Euler Tour TreesThomas Tseng, Laxman Dhulipala, Guy E. Blelloch. 92-106 [doi]
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop ConstraintsAdalat Jabrayilov, Petra Mutzel. 107-116 [doi]
- SAT-Encodings for Treecut Width and TreedepthRobert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider. 117-129 [doi]
- Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data ProfilingThomas Bläsius, Tobias Friedrich 0001, Julius Lischeid, Kitty Meeks, Martin Schirneck. 130-143 [doi]
- Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World GraphsSebastian Lamm, Christian Schulz 0003, Darren Strash, Robert Williger, Huashuo Zhang. 144-158 [doi]
- Parallel Range, Segment and Rectangle Queries with Augmented MapsYihan Sun 0001, Guy E. Blelloch. 159-173 [doi]
- A Practical Algorithm for Spatial Agglomerative ClusteringThom Castermans, Bettina Speckmann, Kevin Verbeek. 174-185 [doi]
- Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn CostSándor P. Fekete, Dominik Krupke. 186-198 [doi]
- Faster Support Vector MachinesSebastian Schlag, Matthias Schmitt, Christian Schulz 0003. 199-210 [doi]
- Scalable Edge PartitioningSebastian Schlag, Christian Schulz 0003, Daniel Seemaier, Darren Strash. 211-225 [doi]