The following pages link to Daniel Delling (Q390153):
Displaying 39 items.
- On \(d\)-regular schematization of embedded paths (Q390156) (← links)
- (Q547278) (redirect page) (← links)
- Time-dependent SHARC-routing (Q547279) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Core Routing on Dynamic Time-Dependent Road Networks (Q2815439) (← links)
- Bidirectional A* search on time-dependent road networks (Q2892160) (← links)
- Hierarchical Hub Labelings for Shortest Paths (Q2912823) (← links)
- Better Bounds for Graph Bisection (Q2912858) (← links)
- (Q2917325) (← links)
- Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected (Q2917326) (← links)
- Engineering Time-Expanded Graphs for Faster Timetable Information (Q2917364) (← links)
- Robust Distance Queries on Massive Networks (Q2921417) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- The Shortcut Problem - Complexity and Algorithms (Q3143749) (← links)
- Highway Dimension and Provably Efficient Shortest Path Algorithms (Q3177817) (← links)
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks (Q3506418) (← links)
- Bidirectional A ∗ Search for Time-Dependent Fast Paths (Q3506419) (← links)
- On Finding Graph Clusterings with Maximum Modularity (Q3508560) (← links)
- Engineering Comparators for Graph Clusterings (Q3511422) (← links)
- Time-Dependent SHARC-Routing (Q3541096) (← links)
- Path Schematization for Route Sketches (Q3569898) (← links)
- (Q3574263) (← links)
- (Q3574265) (← links)
- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks (Q3597882) (← links)
- The Shortcut Problem – Complexity and Approximation (Q3599067) (← links)
- Engineering Route Planning Algorithms (Q3637315) (← links)
- Engineering Time-Expanded Graphs for Faster Timetable Information (Q3649165) (← links)
- Time-Dependent Route Planning (Q3649166) (← links)
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs (Q4575632) (← links)
- Alternative routes in road networks (Q5178735) (← links)
- Fast and Exact Public Transit Routing with Restricted Pareto Sets (Q5232751) (← links)
- SHARC: Fast and Robust Unidirectional Routing (Q5233507) (← links)
- Time-Dependent Contraction Hierarchies (Q5233569) (← links)
- Exact Combinatorial Branch-and-Bound for Graph Bisection (Q5233715) (← links)
- Round-Based Public Transit Routing (Q5233725) (← links)
- Robust Mobile Route Planning with Limited Connectivity (Q5233727) (← links)
- SHARC (Q5406205) (← links)
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm (Q5406231) (← links)
- Parallel computation of best connections in public transportation networks (Q5406283) (← links)
