Thomas Willhalm

	2009
20		Thomas Willhalm, Nicolae Popovici, Yazan Boshmaf, Hasso Plattner, Alexander Zeier, Jan Schaffner: SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units. PVLDB 2(1): 385-394 (2009)
	2007
19		Dorothea Wagner, Thomas Willhalm: Speed-Up Techniques for Shortest-Path Computations. STACS 2007: 23-36
	2006
18		Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm: Partitioning graphs to speedup Dijkstra's algorithm. ACM Journal of Experimental Algorithmics 11: (2006)
	2005
17		Dorothea Wagner, Thomas Willhalm: Drawing Graphs to Speed Up Shortest-Path Computations. ALENEX/ANALCO 2005: 17-25
16		Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm: Partitioning Graphs to Speed Up Dijkstra's Algorithm. WEA 2005: 189-202
15		Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Combining speed-up techniques for shortest-path computations. ACM Journal of Experimental Algorithmics 10: (2005)
14		Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis: Geometric containers for efficient shortest-path computation. ACM Journal of Experimental Algorithmics 10: (2005)
13		Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm: Geometric travel planning. IEEE Transactions on Intelligent Transportation Systems 6(1): 5-16 (2005)
	2004
12		Martin Holzer, Frank Schulz, Thomas Willhalm: Combining Speed-Up Techniques for Shortest-Path Computations. WEA 2004: 269-284
11		Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Generating node coordinates for shortest-path computations in transportation networks. ACM Journal of Experimental Algorithmics 9: (2004)
10		Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis: Dynamic Shortest Paths Containers. Electr. Notes Theor. Comput. Sci. 92: 65-84 (2004)
	2003
9		Dorothea Wagner, Thomas Willhalm: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. ESA 2003: 776-787
8		Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm: Accelerating Heuristic Search in Spatial Domains. PuK 2003
	2001
7		Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Travel Planning with Self-Made Maps. ALENEX 2001: 132-144
	2000
6		Karsten Weihe, Thomas Willhalm: Reconstructing the Topology of a CAD Model - a Discrete Approach. Algorithmica 26(1): 126-147 (2000)
5		Ulrik Brandes, Vanessa Kääb, Andres Löh, Dorothea Wagner, Thomas Willhalm: Dynamic WWW Structures in 3D. J. Graph Algorithms Appl. 4(3): 183-191 (2000)
	1999
4		Thomas Willhalm: Software Packages. Drawing Graphs 1999: 274-282
3		Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm: Empirical Design of Geometric Algorithms. Symposium on Computational Geometry 1999: 86-94
	1998
2		Karsten Weihe, Thomas Willhalm: Why CAD Data Repair Requires Discrete Algorithmic Techniques. Algorithm Engineering 1998: 1-12
	1997
1		Karsten Weihe, Thomas Willhalm: Reconstructing the Topology of a CAD Model: A Discrete Approach. ESA 1997: 500-513

Coauthor Index

1	Yazan Boshmaf	[20]
2	Ulrik Brandes	[3] [5] [7] [11]
3	Stefan Edelkamp	[8] [13]
4	Martin Holzer	[12] [15]
5	Shahid Jabbar	[8] [13]
6	Vanessa Kääb	[5]
7	Annegret Liebers	[3]
8	Andres Löh	[5]
9	Rolf H. Möhring	[16] [18]
10	Matthias Müller-Hannemann	[3]
11	Hasso Plattner	[20]
12	Nicolae Popovici	[20]
13	Jan Schaffner	[20]
14	Heiko Schilling	[16] [18]
15	Frank Schulz	[7] [11] [12] [15]
16	Birk Schütz	[16] [18]
17	Dorothea Wagner	[3] [5] [7] [9] [10] [11] [14] [15] [16] [17] [18] [19]
18	Karsten Weihe	[1] [2] [3] [6]
19	Christos D. Zaroliagis	[10] [14]
20	Alexander Zeier	[20]

Colors in the list of coauthors