Jan Vahrenhold

	2009
31		Jan Vahrenhold: Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings Springer 2009
	2008
30		Ludger Becker, Hannes Partzsch, Jan Vahrenhold: Query Responsive Index Structures. GIScience 2008: 1-19
29		Jan Vahrenhold: B-trees. Encyclopedia of Algorithms 2008
28		Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe: Terracost: Computing least-cost-path surfaces for massive grid terrains. ACM Journal of Experimental Algorithmics 12: (2008)
	2007
27		Frank Steinicke, Christian P. Jansen, Klaus Hinrichs, Jan Vahrenhold, Bernd Schwald: Generating optimized marker-based rigid bodies for optical tracking systems. VISAPP (2) 2007: 387-395
26		Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold: Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. 37(3): 209-227 (2007)
25		Jan Vahrenhold: Line-segment intersection made in-place. Comput. Geom. 38(3): 213-230 (2007)
24		Jan Vahrenhold: An in-place algorithm for Klee's measure problem in two dimensions. Inf. Process. Lett. 102(4): 169-174 (2007)
	2006
23		Henrik Blunck, Jan Vahrenhold: In-Place Randomized Slope Selection. CIAC 2006: 30-41
22		Henrik Blunck, Jan Vahrenhold: In-Place Randomized Slope-Selection. Data Structures 2006
21		Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe: TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains. SAC 2006: 52-57
20		Henrik Blunck, Jan Vahrenhold: In-Place Algorithms for Computing (Layers of) Maxima. SWAT 2006: 363-374
	2005
19		Jan Vahrenhold: Line-Segment Intersection Made In-Place. WADS 2005: 146-157
	2004
18		Joachim Gudmundsson, Jan Vahrenhold: A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. Cache-Oblivious and Cache-Aware Algorithms 2004
17		Ludger Becker, Henrik Blunck, Klaus Hinrichs, Jan Vahrenhold: A Framework for Representing Moving Objects. DEXA 2004: 854-863
16		Ludger Becker, Tobias Gerke, Klaus Hinrichs, Tina Strauf née Hausmann, Jan Vahrenhold: An XML- and Log-Based Infrastructure For Evaluating And Teaching Spatio-Temporal Indexing Schemes. DEXA Workshops 2004: 851-855
15		Ludger Becker, Henrik Blunck, Klaus Hinrichs, Jan Vahrenhold: Ein Rahmenwerk zur Repräsentation von sich bewegenden Objekten. Grundlagen und Anwendungen mobiler Informationstechnologie 2004: 3-12
14		Joachim Gudmundsson, Jan Vahrenhold: I/O-Efficiently Pruning Dense Spanners. JCDCG 2004: 106-116
13		Lars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location. Comput. Geom. 29(2): 147-162 (2004)
	2002
12		Christian Breimann, Jan Vahrenhold: External Memory Computational Geometry Revisited. Algorithms for Memory Hierarchies 2002: 110-148
11		Anil Maheshwari, Jan Vahrenhold, Norbert Zeh: On reverse nearest neighbor queries. CCCG 2002: 128-132
10		Jan Vahrenhold, Klaus Hinrichs: Planar Point Location For Large Data Sets: To Seek Or Not To Seek. ACM Journal of Experimental Algorithmics 7: 8 (2002)
9		Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33(1): 104-128 (2002)
8		Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23(2): 195-207 (2002)
	2001
7		Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS 2001: 122-134
6		Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold: Time Responsive External Data Structures for Moving Points. WADS 2001: 50-61
	2000
5		Jan Vahrenhold, Klaus Hinrichs: Planar Point Location for Large Data Sets: To Seek or Not to Seek. Algorithm Engineering 2000: 183-194
4		Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter: A Unified Approach for Indexed and Non-Indexed Spatial Joins. EDBT 2000: 413-429
3		Lars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location (extended abstract). Symposium on Computational Geometry 2000: 191-200
	1999
2		Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999: 328-348
1		Ludger Becker, André Giesen, Klaus Hinrichs, Jan Vahrenhold: Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets. SSD 1999: 270-285

Coauthor Index

1	Pankaj K. Agarwal	[6] [7] [8]
2	Lars Arge	[2] [3] [4] [6] [9] [13]
3	Ludger Becker	[1] [15] [16] [17] [30]
4	Mark de Berg	[7] [8]
5	Henrik Blunck	[15] [17] [20] [22] [23]
6	Prosenjit Bose	[26]
7	Tobias Gerke	[16]
8	André Giesen	[1]
9	Joachim Gudmundsson	[14] [18]
10	Sariel Har-Peled	[7] [8]
11	Tina Strauf née Hausmann	[16]
12	Thomas Hazel	[21] [28]
13	Klaus Hinrichs	[1] [2] [5] [9] [10] [15] [16] [17] [27]
14	Christian P. Jansen	[27]
15	Christian Kemmer (Christian Breimann)	[12]
16	Anil Maheshwari	[11] [26]
17	Pat Morin	[26]
18	Jason Morrison	[26]
19	Mark H. Overmars	[7] [8]
20	Hannes Partzsch	[30]
21	Octavian Procopiuc	[4]
22	Sridhar Ramaswamy	[4]
23	Bernd Schwald	[27]
24	Micha Sharir	[7] [8]
25	Michiel H. M. Smid	[26]
26	Frank Steinicke	[27]
27	Torsten Suel	[4]
28	Laura Toma	[21] [28]
29	Jeffrey Scott Vitter	[2] [4] [9]
30	Rajiv Wickremesinghe	[21] [28]
31	Norbert Zeh	[11]