Professor Dr. Jan Vahrenhold

Kontakt

Portrait
Professur für Praktische Informatik (Prof. Vahrenhold)
Einsteinstraße 62
Raum 714
48149 Münster
Sprechzeiten: Im Sommersemester 2018 finden die Sprechstunden regelmäßig dienstags, 16:00-17:00 Uhr statt. Ausnahmen werden an dieser Stelle bekannt gegeben.

An den folgenden Tagen fällt die Sprechstunde aus:
  • Dienstag, 19. Juni 2018 [Ersatztermin: Donnerstag, 21. Juni 2018, 10:00-11:00 Uhr]
  • Dienstag, 03. Juli 2018 [Ersatztermin: Donnerstag, 05. Juli 2018, 10:00-11:00 Uhr]

Bitte lesen Sie auch meine Seite mit häufig gestellten Fragen zur Studienberatung.

Forschungsschwerpunkte

  • Algorithmen und Datenstrukturen für geometrische Fragestellungen
  • Algorithm Engineering mit Schwerpunkt auf Ressourceneffizienz
  • Didaktik der Informatik

Promotion

External Memory Algorithms for Geographic Information Systems

BetreuerInnen
  • Professor Dr. Klaus Hinrichs
  • Wirtz, Guido

Vita

Akademische Ausbildung

01/2000 - 01/2004Habilitationsvorhaben im Fach Informatik (WWU Münster)
05/1996 - 12/1999Promotionsstudium im Fach Informatik (WWU Münster)
10/1992 - 04/1996Studium der Mathematik, Informatik, Klassischen Philologie und Erziehungswissenschaften (WWU Münster)

Beruflicher Werdegang

seit 03/2012Professur (W3) für Praktische Informatik / Effiziente Algorithmen und Algorithm Engineering (WWU Münster)
09/2006 - 02/2012Professur (W2) für Grundlagen und Vermittlung der Informatik (TU Dortmund)
03/2000 - 08/2006Wissenschaftlicher Assistent (C1) am Institut für Informatik der WWU Münster
10/2002 - 09/2003Lehrstuhlvertretung (Universität Siegen)
10/2001 - 03/2002Lehrstuhlvertretung (UMIT Innsbruck)
05/1996 - 02/2000Wissenschaftlicher Mitarbeiter (BAT IIa) am Institut für Informatik der WWU Münster

Mitgliedschaften und Aktivitäten in Gremien

seit 05/2018Mitglied des Herausgebergremiums (Associate Editor) der Zeitschrift "ACM Inroads"
seit 01/2018Herausgeber (Editor-in-Chief) der Zeitschrift "Computer Science Education"
seit 06/2009Mitglied des Herausgebergremiums (Associate Editor) der Zeitschrift "Journal of Computational Geometry"

Publikationen

  • Danielsiek H, Toma L, Vahrenhold J. 2018. ‘Reprint: An Instrument to Assess Self-Efficacy in Introductory Algorithms Courses.’ ACM Inroads 9, Nr. 1: 56-65. doi: 10.1145/3105726.3106171.
  • Caspersen ME, Gal-Ezer J, Nardelli E, Vahrenhold J, Westermeier M. 2018. ‘The CECE Report: Creating a Map of Informatics in European Schools.’ In Proceedings of the 49th ACM Technical Symposium on Computer Science Education, edited by Barnes T, Garcia D, 916-917. New York, NY: ACM. doi: 10.1145/3159450.3159633.
  • Toma L, Vahrenhold J. 2018. ‘Self-Efficacy, Cognitive Load, and Emotional Reactions in Collaborative Algorithms Labs - A Case Study.’ In Proceedings of the 14th International Computing Education Research Conference (ICER 2018), edited by Malmi L, McCartney R. New York: ACM Press. [Akzeptiert]
  • Vahrenhold J, Lorenz R, Eickelmann B. 2017. „Vermittlung informatischer Grundbildung im Unterricht der Sekundarstufe I im Bundesländervergleich.“ In Schule digital - der Länderindikator 2017. Schulische Medienbildung in der Sekundarstufe I mit besonderem Fokus auf MINT-Fächer im Bundesländervergleich und Trends von 2015 bis 2017, herausgegeben von Lorenz R, Bos W, Endberg M, Eickelmann B, Grafe S, Vahrenhold J, 205-230. Münster: Waxmann.
  • Lorenz R, Bos W, Endberg M, Eickelmann B, Grafe S, Vahrenhold J, Hrsg. 2017. Schule digital – der Länderindikator 2017. Schulische Medienbildung in der Sekundarstufe I mit besonderem Fokus auf MINT-Fächer im Bundesländervergleich und Trends von 2015 bis 2017. Münster: Waxmann.
  • Danielsiek H, Hubwieser P, Krugel J, Magenheim J, Ohrndorf L, Ossenschmidt D, Schaper N, Vahrenhold J. 2017. ‘Undergraduate Teaching Assistants in Computer Science: Teaching-Related Beliefs, Tasks, and Competences.’ In Proceedings of the IEEE Global Engineering Education Conference (EDUCON), edited by Douligeris C, Auer ME, Sgouropoulou C, Stracke C, Xenos M, 718-725.: IEEE. doi: 10.1109/EDUCON.2017.7942927.
  • Danielsiek H, Toma L, Vahrenhold J. 2017. ‘An Instrument to Assess Self-Efficacy in Introductory Algorithms Courses.’ In Proceedings of the thirteenth annual ACM International Computing Education Research (ICER) conference, edited by Tenenberg J, Chinn D, Malmi L, Korhonen A, Sheard J, 217-225. New York, NY: ACM Press. doi: 10.1145/3105726.3106171.
  • Danielsiek H, Hubwieser P, Krugel J, Magenheim J, Ohrndorf L, Ossenschmidt D, Schaper N, Vahrenhold J. 2017. „Kompetenzbasierte Gestaltungsempfehlungen für Informatik-Tutorenschulungen.“ In INFORMATIK 2017, herausgegeben von Eibl M, Gaedke M, 241-254. Bonn: Gesellschaft für Informatik. doi: 10.18420/in2017_18.
  • Vahrenhold J, Nardelli E, Pereira C, Berry G, Caspersen ME, Gal-Ezer J, Kölling M, McGettrick A, Westermeier M. 2017. Informatics Education in Europe: Are We All In The Same Boat? , 2017. doi: 10.1145/3106077.
  • Dütsch F, Vahrenhold J. 2017. ‘A Filter-and-Refinement-Algorithm for Range Queries Based on the Fréchet Distance (GIS Cup).’ In Proceedings of the 25th ACM SIGSPATIAL International Conference in Geographic Information Systems (SIGSPATIAL 2017), 100.1-100.4. New York: ACM. doi: 10.1145/3139958.3140063.
  • Beckemeyer M, Vahrenhold J. 2017. ‘Bulk-Loading an Index for Temporally Overlaying Spatio-Textual Trajectories.’ In Proceedings of the 6th ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data (BigSpatial 2017), edited by Chandola V, Vatsavai RR, 1-10. New York, NY: ACM. doi: 10.1145/3150919.3150922.
  • Blunck H, Prentow TS, Temme S, Thom A, Vahrenhold J. 2017. ‘Deviation Maps for Robust and Informed Indoor Positioning Services.’ SIGSPATIAL Special 9, Nr. 1: 27-34. doi: 10.1145/3124104.3124110.
  • Scheffer C, Vahrenhold J. 2016. ‘Approximate Shortest Distances Among Smooth Obstacles in 3D.’ In Proceedings of the 27th International Symposium on Algorithms and Computation, edited by Hong S-H, 60:1-60:13.: Dagstuhl Publishing. doi: 10.4230/LIPIcs.ISAAC.2016.60.
  • Caspersen ME, Fisler K, Vahrenhold J. 2016. Assessing Learning In Introductory Computer Science (Dagstuhl Seminar 16072) , Nr. 6(2), 2016. doi: 10.4230/DagRep.6.2.78.
  • Danielsiek H, Vahrenhold J. 2016. ‘Stay on These Roads: Potential Factors Indicating Students' Performance in a CS2 Course.’ In Proceedings of the 47th ACM Technical Symposium on Computer Science Education (SIGCSE 2016), edited by Alphonce C, Tims J, Caspersen ME, Edwards S, 12-17. New York: ACM Press. doi: 10.1145/2839509.2844591.
  • Thies R, Vahrenhold J. 2016. ‘Back to School: Computer Science Unplugged in the Wild.’ In Proceedings of the 21th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2016), edited by Clear A, Cuadros E, Carter J, Tupac Y, 118-123. New York, NY: ACM. doi: 10.1145/2899415.2899442.
  • Vahrenhold J, Barendsen E, Ed. 2016. Proceedings of the 11th Workshop in Primary and Secondary Computing Education. New York: ACM Press. doi: 10.1145/2978249.
  • Blunck H, Temme S, Vahrenhold J. 2016. ‘Deviation Maps - Enhancing Robustness and Predictability of Indoor Positioning Systems.’ In Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems (MobiGIS 2016), edited by Shekar S, Damiani ML, Chow C-Y, Nourjou R, 88-91. New York: ACM. doi: 10.1145/3004725.3004727.
  • Knobelsdorf M, Magenheim J, Brinda T, Engbring D, Humbert L, Pasternak A, Schroeder U, Thomas M, Vahrenhold J. 2015. ‘Computer Science Education in North-Rhine Westphalia, Germany – A Case Study.’ ACM Transactions on Computing Education 15, Nr. 2. doi: 10.1145/2716313.
  • Prentow T, Thom A, Blunck H, Vahrenhold J. 2015. ‘Making Sense of Trajectory Data in Indoor Spaces.’ In Proceedings of the 16th IEEE International Conference on Mobile Data Management, edited by Madria S, Pitoura E, Zheng B, 116-121.: IEEE Press. doi: 10.1109/MDM.2015.44.
  • Vahrenhold J. 2015. ‘Polygon Triangulation.’ In Encyclopedia of Algorithms, edited by Kao M-Y, 1-5. 2. Aufl. New York: Springer Science + Media. doi: 10.1007/978-3-642-27848-8_506-1.
  • Scheffer C, Vahrenhold J. 2015. ‘Subquadratic Medial-Axis Approximation in R^3.’ Journal of Computational Geometry 6, Nr. 1: 249-287. doi: 10.20382/jocg.v6i1a11.
  • Brodnik A, Vahrenhold J, Ed. 2015. Informatics in Schools. Curricula, Competences, and Competitions. Berlin: Springer. doi: 10.1007/978-3-319-25396-1.
  • Gal-Ezer J, Sentance S, Vahrenhold J, Ed. 2015. Proceedings of the 10th Workshop in Primary and Secondary Computing Education. doi: 10.1145/2818314.
  • Vahrenhold J. 2015. ‘B-Trees.’ In Encyclopedia of Algorithms, edited by Kao M-Y, 1-8. 2. Aufl. New York: Springer Science + Media. doi: 10.1007/978-3-642-27848-8_57-2.
  • Dewji N, Wolfman SA, Herman GL, Porter L, Taylor C, Vahrenhold J. 2015. ‘The CS Concept Inventory Quiz Show.’ In Proceedings of the 46th SIGCSE Technical Symposium on Computer Science Education (SICGSE 2015), edited by Decker A, Eiselt K, Alphonce C, Tims J, 669-670.: ACM. doi: 10.1145/2676723.2677315.
  • Scheffer C, Vahrenhold J. 2014. ‘Approximating Geodesic Distances on 2-Manifolds in R^3: The Weighted Case.’ Computational Geometry: Theory & Applications 47, Nr. 8: 789-808. doi: 10.1016/j.comgeo.2014.04.003.
  • Vahrenhold J, Paul W. 2014. ‘Developing and Validating Test Items for First-Year Computer Science Courses.’ Computer Science Education 24, Nr. 4: 304-333. doi: 10.1080/08993408.2014.970782.
  • Scheffer C, Vahrenhold J. 2014. ‘Approximating Geodesic Distances on 2-Manifolds in R^3.’ Computational Geometry: Theory & Applications 47, Nr. 2: 125-140. doi: 10.1016/j.comgeo.2012.05.001.
  • Scheffer C, Vahrenhold J. 2013. ‘Approximating Weighted Geodesic Distances in R^3.’ In Proceedings of the 29th European Workshop on Computational Geometry, edited by Fekete, S, 107-110.
  • Danielsiek H, Humbert L, Vahrenhold J. 2013. ‘Research-Based Learning Revisited: On Using a Delphi Process in Informatics Teacher Education.’ In Proceedings of the 6th Conference on Informatics in Schools: Situation, Evolution and Perspectives (ISSEP 2013), edited by Diethelm I, Mittermeir R, 196-208. Berlin: Springer. doi: 10.1007/978-3-642-36617-8_17.
  • Paul W, Vahrenhold J. 2013. ‘Hunting High and Low: Instruments to Detect Misconceptions Related to Algorithms and Data Structures.’ In Proceedings of the 44th SIGCSE Technical Symposium on Computer Science Education (SICGSE 2013), edited by Camp T, Tymann PT, Dougherty JD, Nagel K, 29-34.: ACM Press. doi: 10.1145/2445196.2445212.
  • Danielsiek Holger, Paul Wolfgang, Vahrenhold Jan. 2013. „Entwurf eines Diagnosekonzepts für die Sekundarstufe I am Beispiel des Fachs Informatik.“ In Diagnose und individuelle Förderung in der MINT-Lehrerbildung: Das Projekt dortMINT, herausgegeben von Hußmann Stephan, Selter Christoph, 101-114. Münster: Waxmann.
  • Anus Sandra, Danielsiek Holger, Fischer Sandra, Girulat Annika, Graf Dittmar, Jelemenská Patrícia, Melle Insa, Nührenbörger Marcus, Paul Wolfgang, Vahrenhold Jan. 2013. „Diagnose und individuelle Förderung erlernen.“ In Diagnose und individuelle Förderung in der MINT-Lehrerbildung: Das Projekt dortMINT, herausgegeben von Hußmann Stephan, Selter Christoph, 97-100. Münster: Waxmann.
  • Vahrenhold J. 2013. „Diagnose und individuelle Förderung (im Informatik-Unterricht).“ In Informatik erweitert Horizonte: 15. GI-Fachtagung Informatik und Schule, herausgegeben von Breier N, Stechert P, Wilke Th, 23. Bonn: Köllen.
  • Knobelsdorf M, Vahrenhold J. 2013. ‘Addressing the Full Range of Students: Challenges in K-12 Computer Science Education.’ IEEE Computer 46, Nr. 9: 32-37. doi: 10.1109/MC.2013.263.
  • Gander W, Petit A, Berry G, Demo B, Vahrenhold J, McGettrick A, Boyle R, Drechsler M, Mendelson A, Stephenson C, Ghezzi C, Meyer B. 2013. Informatics education: Europe cannot afford to miss the boat , 2013.
  • Thies R, Vahrenhold J. 2013. ‘On Plugging "Unplugged" into CS Classes.’ In Proceedings of the 44th SIGCSE Technical Symposium on Computer Science Education (SICGSE 2013), edited by Camp T, Tymann PT, Dougherty JD, Nagel K, 365-370.: ACM Press. doi: 10.1145/2445196.2445303.
  • Vahrenhold J. 2012. ‘On the Importance of Being Earnest: Challenges in Computer Science Education.’ In Proceedings of the 7th Workshop in Primary and Secondary Computing Education, edited by Knobelsdorf M, Romeike R, 3-4. New York, NY, USA: ACM. doi: 10.1145/2481449.2481452.
  • Thies R, Vahrenhold J. 2012. ‘Reflections on outreach programs in CS classes: learning objectives for ''Unplugged'' activities.’ In Proceedings of the 43rd SIGCSE Technical Symposium on Computer Science Education (SICGSE 2012), edited by King LAS, Musicant DR, Camp T, Tymann PT, 487-492.: ACM Press. doi: 10.1145/2157136.2157281.
  • Pasternak A, Vahrenhold J. 2012. ‘Design and Evaluation of a Braided Teaching Course in Sixth Grade Computer Science Education.’ In Proceedings of the 43rd SIGCSE Technical Symposium on Computer Science Education (SICGSE 2012), edited by King LAS, Musicant DR, Camp T, Tymann PT, 45-50.: ACM Press. doi: 10.1145/2157136.2157154.
  • Gudmundsson J, Thom A, Vahrenhold J. 2012. ‘Of Motifs and Goals: Mining Trajectory Data.’ In Proceedings of the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2012), edited by Tanin E, Kröger P, Widmayer P, 129-138. doi: 10.1145/2424321.2424339.
  • Danielsiek H, Paul W, Vahrenhold J. 2012. ‘Detecting and Understanding Students' Misconceptions Related to Algorithms and Data Structures.’ In Proceedings of the 43rd SIGCSE Technical Symposium on Computer Science Education (SICGSE 2012), edited by King LAS, Musicant DR, Camp T, Tymann PT, 21-26.: ACM Press. doi: 10.1145/2157136.2157148.
  • Gieseke F, Moruz G, Vahrenhold J. 2012. ‘Resilient K-d Trees: K-Means in Space Revisited.’ Frontiers of Computer Science 6, Nr. 2: 166-178. doi: 10.1007/s11704-012-2870-8.
  • Temme S, Vahrenhold J. 2012. ‘Revisiting the Construction of SSPDs in the Presence of Memory Hierarchies.’ In 28th European Workshop on Computational Geometry, Booklet of Abstracts, edited by Didimo W, Liotta G, 57-60.
  • Scheffer C, Vahrenhold J. 2012. ‘Simplified Medial-Axis Approximation with Guarantees.’ In 28th European Workshop on Computational Geometry, Booklet of Abstracts, edited by Didimo W, Liotta G, 161-164.
  • Vahrenhold J. 2012. ‘On the Space-Efficiency of the "Ultimate Planar Convex Hull Algorithm".’ In 24th Canadian Conference on Computational Geometry, edited by Aloupis G, Bremner D, 139-144.
  • Scheffer C, Vahrenhold J. 2011. ‘Learning a 2-Manifold with a Boundary in R^3.’ In Abstracts from EuroCG 2011, 27th European Workshop on Computational Geometry, edited by Hoffmann M, 213-216.
  • Scheffer C, Vahrenhold J. 2011. ‘Approximating Geodesic Distances on 2-Manifolds in R^3.’ In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), edited by Aloupis G, Bremner D, 325-330.
  • Vahrenhold J. 2011. ‘On Misconceptions and Implementing 'A Class Defines a Data Type'.’ In Proceedings of Selected Papers of the 5th International Conference on Informatics in Schools: Situation, Evolution and Perspectives (ISSEP 2011), edited by Bezáková D, Kalaš I.
  • Blunck H, Vahrenhold J. 2010. ‘In-Place Algorithms for Computing (Layers of) Maxima.’ Algorithmica 57, Nr. 1: 1-21. doi: 10.1007/s00453-008-9193-z.
  • Hromkovič J, Královič R, Vahrenhold J, Ed. 2010. 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. Berlin: Springer. doi: 10.1007/978-3-642-11376-5.
  • Pasternak A, Vahrenhold J. 2010. ‘Braided Teaching in Secondary CS Education: Contexts, Continuity, and the Role of Programming.’ In Proceedings of the 41st SIGCSE Technical Symposium on Computer Science Education (SICGSE 2010), edited by Cortina T, Walker E, 204-208.: ACM Press. doi: 10.1145/1734263.1734336.
  • Vahrenhold J, Ed. 2010. 26th European Workshop on Computational Geometry (EuroCG 2010). Proceedings. Dortmund.
  • Gieseke F, Polsterer KL, Thom A, Zinn P, Bomans D, Dettmar R, Kramer O, Vahrenhold J. 2010. ‘Detecting Quasars in Large-Scale Astronomical Surveys.’ In Proceedings of the Ninth International Conference on Machine Learning and Applications (ICMLA 2010), 352-357.: IEEE Computer Society. doi: 10.1109/ICMLA.2010.59.
  • Stephenson C, Gal-Ezer J, Philipps M, Vahrenhold J. 2010. ‘Professional Associations in K-12 Computer Science.’ In Proceedings of the 15th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2010), edited by Ayfer R, Impagliazzo J, Laxer C, 329-330. New York City: ACM. doi: 10.1145/1822090.1822207.
  • Gieseke F, Gudmundsson J, Vahrenhold J. 2010. ‘Pruning Spanners and Constructing Well-Separated Pair Decompositions in the Presence of Memory Hierarchies.’ Journal of Discrete Algorithms 8, Nr. 2: 259-272. doi: 10.1016/j.jda.2010.03.001.
  • Bell T, Pasternak A, Stephenson C, Tucker AB, Vahrenhold J. 2010. ‘Implementing CS Curricula in Secondary Education: An International Perspective.’ In Proceedings of the 40th Annual Frontiers in Education Conference (FIE 2010), T2B-1-T2B-3.: IEEE Computer Society. doi: 10.1109/FIE.2010.5673370.
  • Gieseke F, Moruz G, Vahrenhold J. 2010. ‘Resilient K-d Trees: K-Means in Space Revisited.’ In Proceedings of the 10th IEEE International Conference on Data Mining (ICDM 2010), 815-820.: IEEE Computer Society. doi: 10.1109/ICDM.2010.94.
  • Beume N, Fonseca CM, López-Ibánez M, Paquete L, Vahrenhold J. 2009. ‘On the Complexity of Computing the Hypervolume Indicator.’ IEEE Transactions on Evolutionary Computation 13, Nr. 5: 1075-1082. doi: 10.1109/TEVC.2009.2015575.
  • Gieseke F, Vahrenhold J. 2009. ‘Cache-Oblivious Construction of a Well-Separated Pair Decomposition.’ In Proceedings of the 25th European Workshop on Computational Geometry, edited by Langerman S, 341-344.
  • Vahrenhold J, Ed. 2009. Experimental Algorithms. 8th International Symposium, SEA 2009. Dortmund, Germany, June 2009. Proceedings. Berlin: Springer. doi: 10.1007/978-3-642-02011-7.
  • Pasternak A, Vahrenhold J. 2009. „Rote Fäden zur Kontextorientierung im Informatikunterricht.“ In Informatische Bildung in Theorie und Praxis, 13. GI-Fachtagung - Informatik und Schule (INFOS 2009), herausgegeben von Peters I, 45-56.: Log In.
  • Becker L, Partzsch H, Vahrenhold J. 2008. ‘Query Responsive Index Structures.’ In Proceedings of the Fifth International Conference on Geographic Information Science (GIScience 2008), edited by Cova TJ, Miller HJ, Beard K, Frank AU, Goodchild MF, 1-19. Berlin: Springer. doi: 10.1007/978-3-540-87473-7_1.
  • Hazel T, Toma L, Vahrenhold J, Wickremesinghe R. 2008. ‘TerraCost: A Versatile and Scalable Approach to Computing Least-Cost-Path Surfaces for Massive Grid-Based Terrains.’ ACM Journal of Experimental Algorithmics 12. doi: 10.1145/1370596.1370600.
  • Vahrenhold J. 2007. ‘An In-Place Algorithm for Klee's Measure Problem in Two Dimensions.’ Information Processing Letters 102, Nr. 4: 169-174. doi: 10.1016/j.ipl.2006.12.004.
  • Bose P, Maheshwari A, Morin P, Morrison J, Smid M, Vahrenhold J. 2007. ‘Space-Efficient Geometric Divide-and-Conquer Algorithms.’ Computational Geometry: Theory & Applications. 37, Nr. 3: 209-227. doi: 10.1016/j.comgeo.2006.03.006.
  • Vahrenhold J. 2007. ‘Line-Segment Intersection Made In-Place.’ Computational Geometry: Theory & Applications 38, Nr. 3: 213-230. doi: 10.1016/j.comgeo.2006.09.001.
  • Jansen C, Steinicke F, Hinrichs KH, Vahrenhold J, Schwald B. 2007. ‘Performance Improvement for Optical Tracking by Adapting Marker Arrangements.’ In Proceedings of the VR Workshop on Trends and Issues in Tracking for Virtual Environments, edited by Zachmann G, 28-33.: Shaker-Verlag.
  • Jansen C, Steinicke F, Hinrichs KH, Vahrenhold J, Schwald B. 2007. ‘Generating Optimized Marker-based Rigid Bodies for Optical Tracking.’ In Proceedings of the Second International Conference on Computer Vision Theory and Applications (VISAPP 2007), edited by Ranchordas A, Araújo H, Vitrià J, 387-395.: INSTICC Press.
  • Blunck H, Hinrichs KH, Sondern J, Vahrenhold J. 2006. ‘Modeling and Engineering Algorithms for Mobile Data.’ In Progress in Spatial Data Handling, 12th International Symposium on Spatial Data Handling, 61-77. Berlin: Springer. doi: 10.1007/3-540-35589-8_5.
  • Meyer-Spradow J, Ropinski T, Vahrenhold J, Hinrichs KH. 2006. ‘Illustrating Dynamics of Time-Varying Volume Datasets in Static Images.’ In Proceedings of the 11th International Fall Workshop on Vision, Modeling, and Visualization (VMV 2006), edited by Kobbelt L, Kuhlen T, Aach T, Westermann R, 333-340. Berlin: Akademische Verlagsanstalt AKA.
  • Blunck H, Vahrenhold J. 2006. ‘In-Place Randomized Slope Selection.’ In 22nd European Conference on Computational Geometry, edited by Emiris I, Karavelas M, Palios L, 177-180.
  • Blunck H, Vahrenhold J. 2006. ‘In-Place Algorithms for Computing (Layers of) Maxima.’ In 22nd European Conference on Computational Geometry, edited by Emiris I, Karavelas M, Palios L, 181-184.
  • Blunck H, Vahrenhold J. 2006. ‘In-Place Randomized Slope Selection.’ In Proceedings of the 6th Conference on Algorithms and Complexity (CIAC 2006), edited by Calamoneri T, Finocchi I, Italiano GF, 31-40. Berlin: Springer. doi: 10.1007/11758471_6.
  • Blunck H, Vahrenhold J. 2006. ‘In-Place Algorithms for Computing (Layers of) Maxima.’ In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), edited by Arge LA, Freivalds R, 363-374. Berlin: Springer. doi: 10.1007/11785293_34.
  • Hazel T, Toma L, Vahrenhold J, Wickremesinghe R. 2006. ‘TerraCost: A Versatile and Scalable Approach to Computing Least-Cost-Path Surfaces for Massive Grid-Based Terrains.’ In Proceedings of the 21th Annual ACM Symposium on Applied Computing (SAC '06), 52-57. New York: ACM Press. doi: 10.1145/1141277.1141290.
  • Gudmundsson J, Vahrenhold J. 2005. ‘I/O-Efficiently Pruning Dense Spanners.’ In Revised Selected Papers of the Japanese Conference on Discrete and Computational Geometry (JCDCG 2004), edited by Akiyama J, Kano M, Tan X, 106-116. Berlin: Springer. doi: 10.1007/11589440_11.
  • Arge LA, de Berg M, Vahrenhold J, Eds. 2005. Proceedings of the Workshop on Massive Geometric Data Sets (Massive2005).
  • Vahrenhold J. 2005. ‘Line-Segment Intersection Made In-Place.’ In Proceedings of the Ninth International Workshop on Algorithms and Data Structures (WADS 2005), edited by López-Ortiz A, Dehne F, Sack J, 146-157. Berlin: Springer. doi: 10.1007/11534273_14.
  • Becker L, Blunck H, Hinrichs KH, Vahrenhold J. 2004. „Ein Rahmenwerk zur Repräsentation von sich bewegenden Objekten.“ In Beitragsband zum Workshop "Grundlagen und Anwendungen mobiler Informationstechnologie" des GI-Arbeitskreises Mobile Datenbanken und Informationssysteme, herausgegeben von Höpfner H, Saake G, 3-12.
  • Bose P, Maheshwari A, Morin P, Morrison J, Smid M, Vahrenhold J. 2004. ‘Space-Efficient Geometric Divide-and-Conquer Algorithms.’ In 20th European Workshop on Computational Geometry, Abstracts, edited by Díaz-Báñez JM, Márquez A, Portillo JR, 65-68.
  • Blunck H, Hinrichs KH, Puke I, Vahrenhold J. 2004. „Verarbeitung von Trajektorien mobiler Objekte.“ In Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung. Beiträge zu den Münsteraner GI-Tagen 2004, herausgegeben von Raubal M, Sliwinski A, Kuhn W, 29-41.
  • Gudmundsson J, Vahrenhold J. 2004. ‘I/O-Efficiently Pruning Dense Spanners.’ In Japan Conference on Discrete and Computational Geometry, JCDCG 2004, A Conference in Honor of János Pach on his 50th Year, edited by Akiyama J, Kano M, 35-36.
  • Arge LA, Vahrenhold J. 2004. ‘I/O-Efficient Dynamic Planar Point Location.’ Computational Geometry: Theory & Applications 29, Nr. 2: 147-162. doi: 10.1016/j.comgeo.2003.04.001.
  • Becker L, Gerke T, Hinrichs KH, Strauf nee Hausmann T, Vahrenhold J. 2004. ‘An XML- and Log-Based Infrastructure For Evaluating And Teaching Spatio-Temporal Indexing Schemes.’ In Database and Expert Systems Applications, 2004. Proceedings. 15th International Workshop on, 851-855.: {IEEE} Press. doi: 10.1109/DEXA.2004.1333583.
  • Becker L, Blunck H, Hinrichs KH, Vahrenhold J. 2004. ‘A Framework for Representing Moving Objects.’ In Proceedings of the 15th International Conference on Database and Expert Systems Applications (DEXA 2004), edited by Galino F, Takizawa M, Traunmüller R, 854-863. Berlin: Springer. doi: 10.1007/978-3-540-30075-5_82.
  • Vahrenhold J. 2003. Large-Scale Algorithms and Data Structures for Dynamic and Time-Variant Geometric Problems Habilitation, Westfälische Wilhelms-Universität Münster.
  • Vahrenhold J, Hinrichs KH. 2002. ‘Planar Point Location for Large Data Sets: To Seek or Not To Seek.’ ACM Journal of Experimental Algorithmics 7, Article 8. doi: 10.1145/944618.944626.
  • Arge LA, Hinrichs KH, Vahrenhold J, Vitter JS. 2002. ‘Efficient Bulk Operations on Dynamic R-trees.’ Algorithmica 33, Nr. 1: 104-128. doi: 10.1007/s00453-001-0107-6.
  • Köhling R, Reinel J, Vahrenhold J, Hinrichs KH, Speckmann E. 2002. ‘Spatio-Temporal Patterns of Neuronal Activity: Analysis of Optical Imaging Data Using Geometric Shape Matching.’ Journal of Neuroscience Methods 114, Nr. 1: 17-23. doi: 10.1016/S0165-0270(01)00504-0.
  • Maheswari A, Vahrenhold J, Zeh N. 2002. ‘On Reverse Nearest Neighbor Queries (Extended Abstract).’ In Proceedings of the 14th Canadian Conference on Computational Geometry, edited by Wismath S, 128-132.
  • Agarwal PK, de Berg M, Har-Peled S, Overmars MH, Sharir M, Vahrenhold J. 2002. ‘Reporting Intersecting Pairs of Convex Polytopes in Two and Three Dimensions.’ Computational Geometry: Theory & Applications 23, Nr. 2: 195-207. doi: 10.1016/S0925-7721(02)00049-4.
  • Agarwal PK, Arge LA, Vahrenhold J. 2001. ‘Time-Responsive External Data Structures for Moving Points.’ In Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001), edited by Dehne F, Sack J, Tamassia R, 50-61. Berlin: Springer. doi: 10.1007/3-540-44634-6_6.
  • Agarwal PK, de Berg M, Har-Peled S, Overmars MH, Sharir M, Vahrenhold J. 2001. ‘Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.’ In Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001), edited by Dehne F, Sack J, Tamassia R, 122-134. Berlin: Springer. doi: 10.1007/3-540-44634-6_12.
  • Vahrenhold J, Hinrichs KH. 2000. ‘Planar Point Location for Large Data Sets: To Seek or Not to Seek..’ In Algorithm Engineering, 4th International Workshop, WAE 2000, edited by Näher S, Wagner D, 183-194. Berlin: Springer. doi: 10.1007/3-540-44691-5_16.
  • Arge L, Procopiuc O, Ramaswamy S, Suel T, Vahrenhold J, Vitter JS. 2000. ‘A Unified Approach for Indexed and Non-Indexed Spatial Joins.’ In Advances in Database Technology - EDBT 2000, 7th International Conference on Extending Database Technology, edited by Zaniolo C, Lockemann PC, Scholl MH, Grust T, 413-429. Berlin: Springer. doi: 10.1007/3-540-46439-5_29.
  • Arge LA, Vahrenhold J. 2000. ‘I/O-Efficient Dynamic Planar Point Location (Extended Abstract).’ In SCG '00: Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 191-200. New York: ACM Press. doi: 10.1145/336154.336205.
  • Arge LA, Hinrichs KH, Vahrenhold J, Vitter JS. 1999. ‘Efficient Bulk Operations on Dynamic R-trees (extended abstract).’ In Algorithm Engineering and Experimentation, International Workshop ALENEX '99, edited by Goodrich MT, McGeoch CC, 328-347. Berlin: Springer. doi: 10.1007/3-540-48518-X_20.
  • Becker L, Giesen A, Hinrichs KH, Vahrenhold J. 1999. ‘Algorithms for Performing Map Overlay and Spatial Join for Massive Data Sets.’ In Advances in Spatial Databases - Proceedings of the Sixth International Symposium on Spatial Databases (SSD '99), edited by Güting RH, Papadias D, Lochovsky F, 270-285. Berlin: Springer. doi: 10.1007/3-540-48482-5_17.
  • Vahrenhold J. 1999. External Memory Algorithms for Geographic Information Systems Dissertation, Westfälische Wilhelms-Universität Münster.

Dissertationen

Scheffer, ChristianApproximation Algorithms for Geometrical Distance Problems that are not Solvable Exactly2014
Pasternak, ArnoFach- und bildungswissenschaftliche Grundlagen für den Informatikunterricht in der Sekundarstufe I2008 - 2013
Blunck, HenrikModelle und Algorithmen für mobile Datenobjekte und Umgebungen2002 - 2006


Impressum | Datenschutzhinweis | © 2018 Institut
Institut
Beispielstr. 1
· 48155 Münster
Tel: +49 251 83-22223 · Fax: 0251 - 83 22 22 4
E-Mail: