Dominik Schultes

	2009
16		Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner: Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks 2009: 117-139
	2008
15		Robert 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
13		Peter Sanders, Dominik Schultes, Christian Vetter: Mobile Route Planning. ESA 2008: 732-743
12		Reinhard 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
11		Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. WEA 2008: 319-333
10		Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A* Search for Time-Dependent Fast Paths. WEA 2008: 334-346
9		Dominik Schultes: Routing in Road Networks with Transit Nodes. Encyclopedia of Algorithms 2008
	2007
8		Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. ALENEX 2007
7		Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes: In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007
6		Peter Sanders, Dominik Schultes: Engineering Fast Route Planning Algorithms. WEA 2007: 23-36
5		Dominik Schultes, Peter Sanders: Dynamic Highway-Node Routing. WEA 2007: 66-79
	2006
4		Peter Sanders, Dominik Schultes: Engineering Highway Hierarchies. ESA 2006: 804-816
3		Dominik Schultes: Rainbow Sort: Sorting at the Speed of Light. Natural Computing 5(1): 67-82 (2006)
	2005
2		Peter 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

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