Daniel Delling

From MaRDI portal
(Redirected from Person:390153)
Daniel Delling Q390153



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 sets
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-13Paper
Exact combinatorial branch-and-bound for graph bisection
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Round-Based Public Transit Routing
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Robust mobile route planning with limited connectivity
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Time-dependent contraction hierarchies
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
SHARC: fast and robust unidirectional routing
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Highway dimension and provably efficient shortest path algorithms
Journal of the ACM
2018-08-02Paper
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Core routing on dynamic time-dependent road networks
INFORMS Journal on Computing
2016-06-29Paper
An exact combinatorial algorithm for minimum graph bisection
Mathematical Programming. Series A. Series B
2015-10-19Paper
Alternative routes in road networks
ACM Journal of Experimental Algorithmics
2015-03-16Paper
Robust distance queries on massive networks
Algorithms - ESA 2014
2014-10-08Paper
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
ACM Journal of Experimental Algorithmics
2014-04-01Paper
SHARC, fast and robust unidirectional routing
ACM Journal of Experimental Algorithmics
2014-04-01Paper
Parallel computation of best connections in public transportation networks
ACM Journal of Experimental Algorithmics
2014-04-01Paper
On d-regular schematization of embedded paths
Computational Geometry
2014-01-22Paper
Computing multimodal journeys in practice2014-01-21Paper
The shortcut problem - complexity and algorithms
Journal of Graph Algorithms and Applications
2012-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 paths
Algorithms – ESA 2012
2012-09-25Paper
Better Bounds for Graph Bisection
Algorithms – ESA 2012
2012-09-25Paper
Bidirectional A^* search on time-dependent road networks
Networks
2012-06-18Paper
VC-dimension and shortest path algorithms
Automata, Languages and Programming
2011-07-06Paper
Time-dependent SHARC-routing
Algorithmica
2011-07-01Paper
scientific article; zbMATH DE number 5734725 (Why is no real title available?)2010-07-09Paper
High-performance multi-level routing2010-07-09Paper
Path Schematization for Route Sketches
Lecture Notes in Computer Science
2010-06-22Paper
Time-dependent route planning
Robust and Online Large-Scale Optimization
2009-12-03Paper
Engineering Time-Expanded Graphs for Faster Timetable Information
Robust and Online Large-Scale Optimization
2009-12-03Paper
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
2009-07-09Paper
The Shortcut Problem – Complexity and Approximation
Lecture Notes in Computer Science
2009-02-03Paper
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
Algorithms and Computation
2009-01-29Paper
Time-Dependent SHARC-Routing
Algorithms - ESA 2008
2008-11-25Paper
Engineering Comparators for Graph Clusterings
Algorithmic Aspects in Information and Management
2008-07-10Paper
On Finding Graph Clusterings with Maximum Modularity
Graph-Theoretic Concepts in Computer Science
2008-07-01Paper
Bidirectional A  ∗  Search for Time-Dependent Fast Paths
Experimental Algorithms
2008-06-13Paper
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Experimental Algorithms
2008-06-13Paper


Research outcomes over time


This page was built for person: Daniel Delling