Abstract is missing.
- Front Matter [doi]
- Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup TechniquesDaniel Bahrdt, Stefan Funke, Sokol Makolli, Claudius Proissl. 1-12 [doi]
- Practical Fully Dynamic Minimum Cut AlgorithmsMonika Henzinger, Alexander Noe, Christian Schulz 0003. 13-26 [doi]
- Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree SequenceDaniel Allendorf, Ulrich Meyer 0001, Manuel Penschuck, Hung Tran, Nick Wormald. 27-40 [doi]
- Effective Data Reduction for the Vertex Clique Cover ProblemDarren Strash, Louise Thompson. 41-53 [doi]
- McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization ProblemsJonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel. 54-66 [doi]
- A SAT Approach to Twin-WidthAndré Schidler, Stefan Szeider. 67-77 [doi]
- Computing Graph Hyperbolicity Using Dominating SetsDavid Coudert, André Nusser, Laurent Viennot. 78-90 [doi]
- Towards the 5/6-Density Conjecture of Pinwheel SchedulingLeszek Gasieniec, Benjamin Smith, Sebastian Wild. 91-103 [doi]
- Load Balancing: The Long Road from Theory to PracticeSebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder. 104-116 [doi]
- Efficient Access History for Race DetectionYifan Xu 0007, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl. 117-130 [doi]
- Shared-Memory n-level Hypergraph PartitioningLars Gottesbüren, Tobias Heuer, Peter Sanders 0001, Sebastian Schlag. 131-144 [doi]
- Fast Multimodal Journey Planning for Three CriteriaMoritz Potthoff, Jonas Sauer. 145-157 [doi]
- Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman ProblemEmil Biju, Sundar Raman P.. 158-168 [doi]
- Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph SparsificationTamal K. Dey, Simon Zhang. 169-183 [doi]
- k-median and Related ProblemsDena Tayebi, Saurabh Ray, Deepak Ajwani. 184-194 [doi]
- Parallel Nearest Neighbors in Low Dimensions with Batch UpdatesGuy E. Blelloch, Magdalen Dobson. 195-208 [doi]
- An Efficient Branch-and-Bound Solver for Hitting SetThomas Bläsius, Tobias Friedrich 0001, David Stangl, Christopher Weyand. 209-220 [doi]