97 citations · 125 across the 6 of their papers we have counts for
7 papers
Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
Julian Patzner, Matthias Müller-Hannemann
Traffic assignment is a core component of many urban transport planning tools. It is used to determine how traffic is distributed over a transportation network. We study the task o…
Estimating the Robustness of Public Transport Systems Using Machine Learning
Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe +1
The planning of attractive and cost efficient public transport systems is a highly complex optimization process involving many steps. Integrating robustness from a passenger's poin…
Gerbil: A Fast and Memory-Efficient -mer Counter with GPU-Support
Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann
A basic task in bioinformatics is the counting of -mers in genome strings. The -mer counting problem is to build a histogram of all substrings of length in a given genome…
Route Planning in Transportation Networks
Hannah Bast, Daniel Delling, Andrew Goldberg +5
We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less ev…
A Fast Search Algorithm for <m,m,m> Triple Product Property Triples and an Application for 5x5 Matrix Multiplication
Sarah Hart, Ivo Hedtke, Matthias Müller-Hannemann +1
We present a new fast search algorithm for <m,m,m> Triple Product Property (TPP) triples as defined by Cohn and Umans in 2003. The new algorithm achieves a speed-up factor of 40 up…
How to Attack the NP-complete Dag Realization Problem in Practice
Annabell Berger, Matthias Müller-Hannemann
We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a da…
Phase Synchronization in Railway Timetables
Christoph Fretter, Lachezar Krumov, Karsten Weihe +2
Timetable construction belongs to the most important optimization problems in public transport. Finding optimal or near-optimal timetables under the subsidiary conditions of minimi…