Search the dblp DataBase

Publications of Author

1. Peter Sanders, Dominik Schultes
   Highway Hierarchies Hasten Exact Shortest Path Queries. [Citation Graph (0, 0)][DBLP]
   ESA, 2005, pp:568-579 [Conf]
   
2. Peter Sanders, Dominik Schultes
   Engineering Highway Hierarchies. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:804-816 [Conf]
   
3. Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn
   Engineering an External Memory Minimum Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP]
   IFIP TCS, 2004, pp:195-208 [Conf]
   
4. Dominik Schultes
   Rainbow Sort: Sorting at the Speed of Light. [Citation Graph (0, 0)][DBLP]
   Natural Computing, 2006, v:5, n:1, pp:67-82 [Journal]
   
5. Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner
   Computing Many-to-Many Shortest Paths Using Highway Hierarchies. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
6. Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes
   In Transit to Constant Time Shortest-Path Queries in Road Networks. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
7. Peter Sanders, Dominik Schultes
   Engineering Fast Route Planning Algorithms. [Citation Graph (0, 0)][DBLP]
   WEA, 2007, pp:23-36 [Conf]
   
8. Dominik Schultes, Peter Sanders
   Dynamic Highway-Node Routing. [Citation Graph (0, 0)][DBLP]
   WEA, 2007, pp:66-79 [Conf]
   
9. 
   Better Approximation of Betweenness Centrality. [Citation Graph (, )][DBLP]
   
   
10. 
    Engineering Route Planning Algorithms. [Citation Graph (, )][DBLP]
    
    
11. 
    Mobile Route Planning. [Citation Graph (, )][DBLP]
    
    
12. 
    Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. [Citation Graph (, )][DBLP]
    
    
13. 
    Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. [Citation Graph (, )][DBLP]
    
    
14. 
    Bidirectional A^* Search for Time-Dependent Fast Paths. [Citation Graph (, )][DBLP]
    
    
15. 
    Bidirectional A^* on Time-dependent Graphs. [Citation Graph (, )][DBLP]