97 citations · 229 across the 33 of their papers we have counts for
37 papers · 1 filter
More Recent Advances in (Hyper)Graph Partitioning
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj +8
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical…
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications
Valentin Buchhold, Dorothea Wagner
Customizable contraction hierarchies are one of the most popular route planning frameworks in practice, due to their simplicity and versatility. In this work, we present a novel al…
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
Moritz Baum, Julian Dibbelt, Dorothea Wagner +1
We study the problem of computing constrained shortest paths for battery electric vehicles. Since battery capacities are limited, fastest routes are often infeasible. Instead, user…
Fast, Exact and Scalable Dynamic Ridesharing
Valentin Buchhold, Peter Sanders, Dorothea Wagner
We study the problem of servicing a set of ride requests by dispatching a set of shared vehicles, which is faced by ridesharing companies such as Uber and Lyft. Solving this proble…
Zipping Segment Trees
Lukas Barth, Dorothea Wagner
Stabbing queries in sets of intervals are usually answered using segment trees. A dynamic variant of segment trees has been presented by van Kreveld and Overmars, which uses red-bl…
Engineering Exact Quasi-Threshold Editing
Lars Gottesbüren, Michael Hamann, Philipp Schoch +3
Quasi-threshold graphs are -free graphs, i.e., they do not contain any cycle or path of four nodes as an induced subgraph. We study the -free editing pr…