Abstract is missing.
- Engineering Oracles for Time-Dependent Road NetworksSpyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis. 1-14 [doi]
- Scalable Transfer PatternsHannah Bast, Matthias Hertel, Sabine Storandt. 15-29 [doi]
- Experimental Evaluation of Distributed Node Coloring Algorithms for Wireless NetworksFabian Fuchs. 30-38 [doi]
- Generating Massive Scale-Free Networks under Resource ConstraintsUlrich Meyer, Manuel Penschuck. 39-52 [doi]
- n-Level Recursive BisectionSebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz 0003. 53-67 [doi]
- k Closeness Centrality Faster in Unweighted GraphsElisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke. 68-80 [doi]
- An Algorithm for Online K-Means ClusteringEdo Liberty, Ram Sriharsha, Maxim Sviridenko. 81-89 [doi]
- Graph Bisection with Pareto-OptimizationMichael Hamann, Ben Strasser. 90-102 [doi]
- Geometry Helps to Compare Persistence DiagramsMichael Kerber, Dmitriy Morozov, Arnur Nigmetov. 103-112 [doi]
- Fast Algorithms for PseudoarboricityMarkus Blumenstock. 113-126 [doi]
- Real-Time k-bounded Preemptive SchedulingSivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir. 127-137 [doi]
- Finding Near-Optimal Independent Sets at ScaleSebastian Lamm, Peter Sanders, Christian Schulz 0003, Darren Strash, Renato F. Werneck. 138-150 [doi]
- A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow ProblemRuben Becker, Maximilian Fickert, Andreas Karrenbauer. 151-159 [doi]
- A General Framework for Dynamic Succinct and Compressed Data StructuresPatrick Klitzke, Patrick K. Nicholson. 160-173 [doi]
- An Empirical Comparison of Graph Laplacian SolversErik G. Boman, Kevin Deweese, John R. Gilbert. 174-188 [doi]