Jan Vahrenhold

Holger Danielsiek, Ludger Humbert, Jan Vahrenhold: Research-Based Learning Revisited: On Using a Delphi Process in Informatics Teacher Education. ISSEP 2013: 196-208

Wolfgang Paul, Jan Vahrenhold: Hunting high and low: instruments to detect misconceptions related to algorithms and data structures. SIGCSE 2013: 29-34

Renate Thies, Jan Vahrenhold: On plugging "unplugged" into CS classes. SIGCSE 2013: 365-370

Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold: Resilient k-d trees: k-means in space revisited. Frontiers of Computer Science 6(2): 166-178 (2012)

Jan Vahrenhold: On the Space Efficiency of the "Ultimate Planar Convex Hull Algorithm". CCCG 2012: 131-136

Joachim Gudmundsson, Andreas Thom, Jan Vahrenhold: Of motifs and goals: mining trajectory data. SIGSPATIAL/GIS 2012: 129-138

Holger Danielsiek, Wolfgang Paul, Jan Vahrenhold: Detecting and understanding students' misconceptions related to algorithms and data structures. SIGCSE 2012: 21-26

Arno Pasternak, Jan Vahrenhold: Design and evaluation of a braided teaching course in sixth grade computer science education. SIGCSE 2012: 45-50

Renate Thies, Jan Vahrenhold: Reflections on outreach programs in CS classes: learning objectives for "unplugged" activities. SIGCSE 2012: 487-492

Jan Vahrenhold: Preface. ACM Journal of Experimental Algorithmics 16 (2011)

Christian Scheffer, Jan Vahrenhold: Approximating Geodesic Distances on 2-Manifolds in R3. CCCG 2011

Henrik Blunck, Jan Vahrenhold: In-Place Algorithms for Computing (Layers of) Maxima. Algorithmica 57(1): 1-21 (2010)

Fabian Gieseke, Joachim Gudmundsson, Jan Vahrenhold: Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies. J. Discrete Algorithms 8(3): 259-272 (2010)

Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold: Resilient K-d Trees: K-Means in Space Revisited. ICDM 2010: 815-820

Fabian Gieseke, Kai Lars Polsterer, Andreas Thom, Peter Zinn, Dominik Bomanns, Ralf-Jurgen Dettmar, Oliver Kramer, Jan Vahrenhold: Detecting Quasars in Large-Scale Astronomical Surveys. ICMLA 2010: 352-357

Chris Stephenson, Judith Gal-Ezer, Margot Phillipps, Jan Vahrenhold: Professional associations in K-12 computer science. ITiCSE 2010: 329-330

Arno Pasternak, Jan Vahrenhold: Braided teaching in secondary CS education: contexts, continuity, and the role of programming. SIGCSE 2010: 204-208

Juraj Hromkovic, Richard Královic, Jan Vahrenhold (Eds.): Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives, ISSEP 2010, Zurich, Switzerland, January 13-15, 2010. Proceedings. Lecture Notes in Computer Science 5941, Springer 2010, isbn 978-3-642-11375-8

Nicola Beume, Carlos M. Fonseca, Manuel López-Ibáñez, Luís Paquete, Jan Vahrenhold: On the Complexity of Computing the Hypervolume Indicator. IEEE Trans. Evolutionary Computation 13(5): 1075-1082 (2009)

Arno Pasternak, Jan Vahrenhold: Rote Fäden und Kontextorientierung im Informatikunterricht. INFOS 2009: 280

Jan Vahrenhold (Ed.): Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings. Lecture Notes in Computer Science 5526, Springer 2009, isbn 978-3-642-02010-0

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)

Ludger Becker, Hannes Partzsch, Jan Vahrenhold: Query Responsive Index Structures. GIScience 2008: 1-19

Jan Vahrenhold: B-trees. Encyclopedia of Algorithms 2008

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)

Jan Vahrenhold: Line-segment intersection made in-place. Comput. Geom. 38(3): 213-230 (2007)

Jan Vahrenhold: An in-place algorithm for Klee's measure problem in two dimensions. Inf. Process. Lett. 102(4): 169-174 (2007)

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

Henrik Blunck, Jan Vahrenhold: In-Place Randomized Slope Selection. CIAC 2006: 30-41

Henrik Blunck, Jan Vahrenhold: In-Place Randomized Slope-Selection. Data Structures 2006

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

Henrik Blunck, Jan Vahrenhold: In-Place Algorithms for Computing (Layers of) Maxima. SWAT 2006: 363-374

Jan Vahrenhold: Line-Segment Intersection Made In-Place. WADS 2005: 146-157

Lars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location. Comput. Geom. 29(2): 147-162 (2004)

Joachim Gudmundsson, Jan Vahrenhold: A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. Cache-Oblivious and Cache-Aware Algorithms 2004

Ludger Becker, Henrik Blunck, Klaus Hinrichs, Jan Vahrenhold: A Framework for Representing Moving Objects. DEXA 2004: 854-863

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

Joachim Gudmundsson, Jan Vahrenhold: I/O-Efficiently Pruning Dense Spanners. JCDCG 2004: 106-116

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

Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33(1): 104-128 (2002)

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)

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)

Anil Maheshwari, Jan Vahrenhold, Norbert Zeh: On reverse nearest neighbor queries. CCCG 2002: 128-132

Christian Breimann, Jan Vahrenhold: External Memory Computational Geometry Revisited. Algorithms for Memory Hierarchies 2002: 110-148

Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold: Time Responsive External Data Structures for Moving Points. WADS 2001: 50-61

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

Lars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location (extended abstract). Symposium on Computational Geometry 2000: 191-200

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

Jan Vahrenhold, Klaus Hinrichs: Planar Point Location for Large Data Sets: To Seek or Not to Seek. Algorithm Engineering 2000: 183-194

Jan Vahrenhold: External memory algorithms for geographic information systems. Universität Münster 1999, pp. I-IX, 1-165

Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999: 328-348

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