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

Jan Vahrenhold

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

2008
30EELudger Becker, Hannes Partzsch, Jan Vahrenhold: Query Responsive Index Structures. GIScience 2008: 1-19
29EEJan Vahrenhold: B-trees. Encyclopedia of Algorithms 2008
28EEThomas 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
26EEProsenjit 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)
25EEJan Vahrenhold: Line-segment intersection made in-place. Comput. Geom. 38(3): 213-230 (2007)
24EEJan Vahrenhold: An in-place algorithm for Klee's measure problem in two dimensions. Inf. Process. Lett. 102(4): 169-174 (2007)
2006
23EEHenrik Blunck, Jan Vahrenhold: In-Place Randomized Slope Selection. CIAC 2006: 30-41
22EEHenrik Blunck, Jan Vahrenhold: In-Place Randomized Slope-Selection. Data Structures 2006
21EEThomas 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
20EEHenrik Blunck, Jan Vahrenhold: In-Place Algorithms for Computing (Layers of) Maxima. SWAT 2006: 363-374
2005
19EEJan Vahrenhold: Line-Segment Intersection Made In-Place. WADS 2005: 146-157
2004
18EEJoachim Gudmundsson, Jan Vahrenhold: A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. Cache-Oblivious and Cache-Aware Algorithms 2004
17EELudger Becker, Henrik Blunck, Klaus Hinrichs, Jan Vahrenhold: A Framework for Representing Moving Objects. DEXA 2004: 854-863
16EELudger 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
14EEJoachim Gudmundsson, Jan Vahrenhold: I/O-Efficiently Pruning Dense Spanners. JCDCG 2004: 106-116
13EELars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location. Comput. Geom. 29(2): 147-162 (2004)
2002
12EEChristian Breimann, Jan Vahrenhold: External Memory Computational Geometry Revisited. Algorithms for Memory Hierarchies 2002: 110-148
11EEAnil Maheshwari, Jan Vahrenhold, Norbert Zeh: On reverse nearest neighbor queries. CCCG 2002: 128-132
10EEJan Vahrenhold, Klaus Hinrichs: Planar Point Location For Large Data Sets: To Seek Or Not To Seek. ACM Journal of Experimental Algorithmics 7: 8 (2002)
9EELars 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
7EEPankaj 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
6EEPankaj K. Agarwal, Lars Arge, Jan Vahrenhold: Time Responsive External Data Structures for Moving Points. WADS 2001: 50-61
2000
5EEJan Vahrenhold, Klaus Hinrichs: Planar Point Location for Large Data Sets: To Seek or Not to Seek. Algorithm Engineering 2000: 183-194
4EELars 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
3EELars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location (extended abstract). Symposium on Computational Geometry 2000: 191-200
1999
2EELars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999: 328-348
1EELudger 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

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

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