Abstract is missing.
- Triangle Listing Algorithms: Back from the DiversionMark Ortmann, Ulrik Brandes. 1-8 [doi]
- On the Scalability of Computing Triplet and Quartet DistancesMorten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal. 9-19 [doi]
- Simplifying massive planar subdivisionsLars Arge, Jakob Truelsen, Jungwoo Yang. 20-30 [doi]
- Distributed Computation of Persistent HomologyUlrich Bauer, Michael Kerber, Jan Reininghaus. 31-38 [doi]
- Top-k Substring Matching for Auto-CompletionYuzuru Okajima. 39-46 [doi]
- Multi-Pivot Quicksort: Theory and ExperimentsShrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, J. Ian Munro. 47-60 [doi]
- A Back-to-Basics Empirical Study of Priority QueuesDaniel Larkin, Siddhartha Sen, Robert Endre Tarjan. 61-72 [doi]
- An Exact Approach to Upward Crossing MinimizationMarkus Chimani, Robert Zeranski. 73-85 [doi]
- Practical Experience with Hanani-Tutte for Testing c-PlanarityCarsten Gutwenger, Petra Mutzel, Marcus Schaefer. 86-97 [doi]
- Order constraints for single machine scheduling with non-linear costChristoph Dürr, Oscar C. Vásquez. 98-111 [doi]
- Enumerating fundamental normal surfaces: Algorithms, experiments and invariantsBenjamin A. Burton. 112-124 [doi]
- Connection Scan AcceleratedBen Strasser, Dorothea Wagner. 125-137 [doi]
- Precomputation techniques for the stochastic on-time arrival problemGuillaume Sabran, Samitha Samaranayake, Alexandre M. Bayen. 138-146 [doi]
- Fast Shortest-path Distance Queries on Road Networks by Pruned Highway LabelingTakuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata. 147-154 [doi]
- Flow-Based Guidebook RoutingHannah Bast, Sabine Storandt. 155-165 [doi]