Daniel Delling

From MaRDI portal
Person:390153

Available identifiers

zbMath Open delling.danielMaRDI QIDQ390153

List of research outcomes





PublicationDate of PublicationType
Robustness generalizations of the shortest feasible path problem for electric vehicles2024-08-13Paper
Fast and exact public transit routing with restricted Pareto sets2019-09-13Paper
Exact combinatorial branch-and-bound for graph bisection2019-09-12Paper
Round-Based Public Transit Routing2019-09-12Paper
Robust mobile route planning with limited connectivity2019-09-12Paper
Time-dependent contraction hierarchies2019-09-11Paper
SHARC: fast and robust unidirectional routing2019-09-11Paper
Highway dimension and provably efficient shortest path algorithms2018-08-02Paper
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs2018-07-16Paper
Core routing on dynamic time-dependent road networks2016-06-29Paper
An exact combinatorial algorithm for minimum graph bisection2015-10-19Paper
Alternative routes in road networks2015-03-16Paper
Robust distance queries on massive networks2014-10-08Paper
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm2014-04-01Paper
SHARC, fast and robust unidirectional routing2014-04-01Paper
Parallel computation of best connections in public transportation networks2014-04-01Paper
On \(d\)-regular schematization of embedded paths2014-01-22Paper
Computing multimodal journeys in practice2014-01-21Paper
The shortcut problem - complexity and algorithms2012-12-04Paper
Accelerating time-dependent multi-criteria timetable information is harder than expected2012-09-28Paper
Arc-flags in dynamic graphs2012-09-28Paper
Engineering time-expanded graphs for faster timetable information2012-09-28Paper
Hierarchical hub labelings for shortest paths2012-09-25Paper
Better Bounds for Graph Bisection2012-09-25Paper
Bidirectional \(A^*\) search on time-dependent road networks2012-06-18Paper
VC-dimension and shortest path algorithms2011-07-06Paper
Time-dependent SHARC-routing2011-07-01Paper
https://portal.mardi4nfdi.de/entity/Q35742652010-07-09Paper
High-performance multi-level routing2010-07-09Paper
Path Schematization for Route Sketches2010-06-22Paper
Time-dependent route planning2009-12-03Paper
Engineering Time-Expanded Graphs for Faster Timetable Information2009-12-03Paper
Engineering Route Planning Algorithms2009-07-09Paper
The Shortcut Problem – Complexity and Approximation2009-02-03Paper
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks2009-01-29Paper
Time-Dependent SHARC-Routing2008-11-25Paper
Engineering Comparators for Graph Clusterings2008-07-10Paper
On Finding Graph Clusterings with Maximum Modularity2008-07-01Paper
Bidirectional A  ∗  Search for Time-Dependent Fast Paths2008-06-13Paper
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks2008-06-13Paper

Research outcomes over time

This page was built for person: Daniel Delling