97 citations · 229 across the 33 of their papers we have counts for
8 papers · 1 filter
Engineering Top-Down Weight-Balanced Trees
Lukas Barth, Dorothea Wagner
Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees, for example regarding the required work to balance…
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles
Moritz Baum, Julian Dibbelt, Andreas Gemsa +2
We study the problem of minimizing overall trip time for battery electric vehicles in road networks. As battery capacity is limited, stops at charging stations may be inevitable. C…
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks
Ben Strasser, Dorothea Wagner, Tim Zeitz
We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, fo…
Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA
Jonas Sauer, Dorothea Wagner, Tobias Zündorf
We study the problem of computing public transit traffic assignments in a multi-modal setting: Given a public transit timetable, an additional unrestricted transfer mode (in our ca…
Engineering Negative Cycle Canceling for Wind Farm Cabling
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner +2
In a wind farm turbines convert wind energy into electrical energy. The generation of each turbine is transmitted, possibly via other turbines, to a substation that is connected to…
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
Lars Gottesbüren, Michael Hamann, Dorothea Wagner
In this paper, we propose HyperFlowCutter, an algorithm for balanced hypergraph bipartitioning. It is based on minimum S-T hyperedge cuts and maximum flows. It computes a sequence…