dblp.uni-trier.dewww.uni-trier.de

Dominik Schultes

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
15EERobert Geisberger, Peter Sanders, Dominik Schultes: Better Approximation of Betweenness Centrality. ALENEX 2008: 90-100
14 Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A* on Time-dependent Graphs. CTW 2008: 132-135
13EEPeter Sanders, Dominik Schultes, Christian Vetter: Mobile Route Planning. ESA 2008: 732-743
12EEReinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. WEA 2008: 303-318
11EERobert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. WEA 2008: 319-333
10EEGiacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A* Search for Time-Dependent Fast Paths. WEA 2008: 334-346
9EEDominik Schultes: Routing in Road Networks with Transit Nodes. Encyclopedia of Algorithms 2008
2007
8EESebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. ALENEX 2007
7EEHolger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes: In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007
6EEPeter Sanders, Dominik Schultes: Engineering Fast Route Planning Algorithms. WEA 2007: 23-36
5EEDominik Schultes, Peter Sanders: Dynamic Highway-Node Routing. WEA 2007: 66-79
2006
4EEPeter Sanders, Dominik Schultes: Engineering Highway Hierarchies. ESA 2006: 804-816
3EEDominik Schultes: Rainbow Sort: Sorting at the Speed of Light. Natural Computing 5(1): 67-82 (2006)
2005
2EEPeter Sanders, Dominik Schultes: Highway Hierarchies Hasten Exact Shortest Path Queries. ESA 2005: 568-579
2004
1 Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn: Engineering an External Memory Minimum Spanning Tree Algorithm. IFIP TCS 2004: 195-208

Coauthor Index

1Holger Bast (Hannah Bast) [7]
2Reinhard Bauer [12]
3Daniel Delling [10] [11] [12] [14]
4Roman Dementiev [1]
5Stefan Funke [7]
6Robert Geisberger [11] [15]
7Sebastian Knopp [8]
8Leo Liberti [10] [14]
9Domagoj Matijevic [7]
10Giacomo Nannicini [10] [14]
11Peter Sanders [1] [2] [4] [5] [6] [7] [8] [11] [12] [13] [15]
12Dennis Schieferdecker [12]
13Frank Schulz [8]
14Jop F. Sibeyn [1]
15Christian Vetter [13]
16Dorothea Wagner [8] [12]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)