Abstract is missing.
- A Fast and Tight Heuristic for A* in Road NetworksBen Strasser, Tim Zeitz. [doi]
- Engineering Predecessor Data Structures for Dynamic Integer SetsPatrick Dinklage, Johannes Fischer 0001, Alexander Herlez. [doi]
- Force-Directed Embedding of Scale-Free Networks in the Hyperbolic PlaneThomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- How to Find the Exit from a 3-Dimensional MazeMiki Hermann. [doi]
- Parallel Five-Cycle Counting AlgorithmsLouisa Ruixue Huang, Jessica Shi, Julian Shun. [doi]
- Nearest-Neighbor Queries in Customizable Contraction Hierarchies and ApplicationsValentin Buchhold, Dorothea Wagner. [doi]
- O'Reach: Even Faster Reachability in Large GraphsKathrin Hanauer, Christian Schulz 0003, Jonathan Trummer. [doi]
- An Experimental Study of External Memory Algorithms for Connected ComponentsGerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer 0001, Manuel Penschuck, Hung Tran. [doi]
- On Computing the Diameter of (Weighted) Link StreamsMarco Calamai, Pierluigi Crescenzi, Andrea Marino. [doi]
- Minimum Scan Cover and Variants - Theory and ExperimentsKevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs. [doi]
- Fréchet Mean and p-Mean on the Unit Circle: Decidability, Algorithm, and Applications to Clustering on the Flat TorusFrédéric Cazals, Bernard Delmas, Timothee O'Donnell. [doi]
- Engineering Nearly Linear-Time Algorithms for Small Vertex ConnectivityMax Franck, Sorrachai Yingchareonthawornchai. [doi]
- Multilevel Hypergraph Partitioning with Vertex Weights RevisitedTobias Heuer, Nikolai Maas, Sebastian Schlag. [doi]
- On Tamaki's Algorithm to Compute TreewidthsErnst Althaus, Daniela Schnurbusch, Julian Wüschner, Sarah Ziegler. [doi]
- Three Is Enough for Steiner TreesEmmanuel Arrighi, Mateus de Oliveira Oliveira. [doi]
- Document Retrieval HacksSimon J. Puglisi, Bella Zhukova. [doi]
- Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in PracticeLoukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas. [doi]
- Multi-Level Weighted Additive SpannersAbu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence. [doi]
- Practical Implementation of Encoding Range Top-2 QueriesSeungbum Jo, Wooyoung Park, Srinivasa Rao Satti. [doi]
- A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA StructuresColine Gianfrotta, Vladimir Reinharz, Dominique Barth, Alain Denise. [doi]
- Targeted Branching for the Maximum Independent Set ProblemDemian Hespe, Sebastian Lamm, Christian Schorr. [doi]
- Approximation Algorithms for 1-Wasserstein Distance Between Persistence DiagramsSamantha Chen, Yusu Wang. [doi]
- Fast and Robust Vectorized In-Place Sorting of Primitive TypesMark Blacher, Joachim Giesen, Lars Kuehne. [doi]