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
- Betreuer
- Professor Dr. Klaus Hinrichs
- Promotionsfach
- Informatik
- Abschlussgrad
- Dr. rer. nat.
- Verleihender Fachbereich
- Fachbereich 10 – Mathematik und Informatik
Vita
Akademische Ausbildung
- Habilitationsvorhaben im Fach Informatik (WWU Münster)
- Promotionsstudium im Fach Informatik (WWU Münster)
- Studium der Mathematik, Informatik, Klassischen Philologie und Erziehungswissenschaften (WWU Münster)
Beruflicher Werdegang
- Professur (W3) für Praktische Informatik / Effiziente Algorithmen und Algorithm Engineering (Universität Münster, bis 10/2023: WWU Münster)
- Professur (W2) für Grundlagen und Vermittlung der Informatik (TU Dortmund)
- Wissenschaftlicher Assistent (C1) am Institut für Informatik der WWU Münster
- Lehrstuhlvertretung (Universität Siegen)
- Lehrstuhlvertretung (UMIT Innsbruck)
- Wissenschaftlicher Mitarbeiter (BAT IIa) am Institut für Informatik der WWU Münster
Mitgliedschaften und Aktivitäten in Gremien
- Informatics Europe (Board of Directors, Mitglied)
- Gesellschaft für Informatik e.V. (Präsidium, Mitglied)
- Gesellschaft für Informatik e.V. (Fachbereich "Informatik und Ausbildung / Didaktik der Informatik", Sprecher)
- Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (Dagstuhl-Seminar 24251 "Teaching Support Systems for Formal Foundations of Computer Science", Mitorganisator)
- TeachAI.org (Wissenschaftlicher Beirat, Mitglied)
- MINT-Vernetzungsstelle, Stifterverband der deutschen Wirtschaft (Wissenschaftlicher Beirat, Mitglied)
- TrainDL (Wissenschaftlicher Beirat, Mitglied)
- Gesellschaft für Informatik e.V. (Fachbereich "Informatik und Ausbildung / Didaktik der Informatik", Stv. Sprecher)
- 18th ACM International Computing Education Research Conference (ICER 2022) (Programmkomitee, Co-Chair)
- 17th ACM International Computing Education Research Conference (ICER 2021) (Programmkomitee, Co-Chair)
- Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (Dagstuhl Seminar 19281 “Notional Machines and Programming Language Semantics in Education”, Mitorganisator)
- Association for Computing Machinery (ACM Intel International Science and Engineering Fair Award, Jury Chair)
- ACM SIGCSE Doctoral Consortium
- ACM Inroads
- Computer Science Education
- ACM SIGCSE Doctoral Consortium
- Informatics Europe (Infomatics Europe Best Practice in Education Award, Jury Chair)
- 11th Workshop in Primary and Secondary Computing Education (WiPSCE 2016) (Programmkomitee, Co-Chair und Konferenzleitung)
- Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (Dagstuhl-Seminar 16072 “Assessing Learning in Introductory Computer Science”, Mitorganisator)
- 10th Workshop in Primary and Secondary Computing Education (WiPCSE 2015) (Programmkomitee, Co-Chair)
- 8th Conference on Informatics in Secondary Schools (ISSEP 2015) (Programmkomitee, Co-Chair)
- 26th European Workshop on Computational Geometry (EuroCG 2010) (Programmkomitee, Chair und Konferenzleitung)
- 4th Conference on Informatics in Secondary Schools (ISSEP 2010) (Programmkomitee, Co-Chair)
- 8th Symposium on Experimental Algorithms (SEA 2009) (Programmkomitee, Chair und Konferenzleitung)
- Journal of Computational Geometry
- 1st Workshop on Massive Geometric Data Sets (MASSIVE 2005) (Programmkomitee, Co-Chair)
Publikationen
- . . „Das systematische Vorgehen im Fokus.“ In Wirksamer Informatikunterricht. Unterrichtsqualität: Perspektiven von Expertinnen und Experten, herausgegeben von , 198–206. Baltmannsweiler: Schneider Verlag Hohengehren.
- . . ‘"In the Beginning, I Couldn't Necessarily Do Anything With It": Links Between Compiler Error Messages and Sense of Belonging.’ In Proceedings of the 2024 ACM Conference on International Computing Education Research (ICER 2024), edited by , 14–26. New York, NY: ACM Press. doi: 10.1145/3632620.3671105.
- . . ‘Regulation, Self-Efficacy, and Participation in CS1 Group Work.’ In Proceedings of the 2024 ACM Conference on International Computing Education Research (ICER 2024), edited by , 359–373. New York, NY: ACM Press. doi: 10.1145/3632620.3671115.
- . . ‘Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues.’ In Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 2024), edited by . Wadern: Dagstuhl Publishing. doi: 10.4230/LIPIcs.ISAAC.2024.36. [accepted / in Press (not yet published)]
- . . ‘Adaptive Approximation of Persistent Homology.’ Journal of Applied and Computational Topology . doi: 10.1007/s41468-024-00192-7. [accepted / in Press (not yet published)]
- . . ‘Recognizing Patterns in Productive Failure.’ In Proceedings of the 55th ACM Technical Symposium on Computer Science Education V. 1, edited by , 1293–1299. New York, NY: ACM Press. doi: 10.1145/3626252.3630915.
- . . ‘Exploring Barriers in Productive Failure.’ In Proceedings of the 19th ACM Conference on International Computing Education Research (ICER 2023), Vol. I, edited by , 284–297. New York, NY: ACM Press. doi: 10.1145/3568813.3600111.
- . . ‘How Do Computing Education Researchers Talk About Threats and Limitations?’ In Proceedings of the 19th ACM Conference on International Computing Education Research (ICER 2023), Vol. I, edited by , 381. New York, NY: ACM Press. doi: 10.1145/3568813.3600114.
- . . ‘Toward CS1 Content Subscales: A Mixed-Methods Analysis of an Introductory Computing Assessment.’ In Proceedings of the 23rd Koli Calling International Conference on Computing Education Research (Koli Calling 2023), edited by , 1–13. New York, NY: ACM Press. doi: 10.1145/3631802.3631828.
- . . ‘Arguments for and Approaches to Computing Education in Undergraduate Computer Science Programmes.’ In Proceedings of the 2023 Working Group Reports on Innovation and Technology in Computer Science Education (ITiCSE-WGR 2023), edited by , 160–195. New York, NY: ACM Press. doi: 10.1145/3623762.3633494.
- . . ‘Klee’s Measure Problem Made Oblivious.’ In LATIN 2022: Theoretical Informatics, 15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings, edited by , 121–138. Heidelberg: Springer. doi: 10.1007/978-3-031-20624-5_8.
- . . ‘A smartphone app for the prevention and early intervention of body dysmorphic disorder: Development and evaluation of the content, usability, and aesthetics. .’ Internet Interventions 28, Nr. 100521. doi: 10.1016/j.invent.2022.100521.
- . . ‘Piecing Together the Next 15 Years of Computing Education Research Workshop Report.’ In Proceedings of the 53rd ACM Technical Symposium on Computer Science Education, edited by , 1051–1052. New York, NY: ACM Press. doi: 10.1145/3478432.3499037.
- . . „Unterschiede im Leseverhalten von Algorithmen und Programmen.“ In Eye-Tracking als Methode in der Mathematik- und Naturwissenschaftsdidaktik: Forschung und Praxis, herausgegeben von , 245–260. Heidelberg: Springer Spektrum. doi: 10.1007/978-3-662-63214-7_15.
- . . ‘Through (Tracking) Their Eyes: Abstraction and Complexity in Program Comprehension.’ ACM Transactions on Computing Education 22, Nr. 2: 17.1–17.33. doi: 10.1145/3480171.
- 10.1145/3501385. (Eds.): . ICER 2022: ACM Conference on International Computing Education Research, Lugano and Virtual Event, Switzerland, August 7 - 11, 2022, Volume 1. New York, NY: ACM Press. doi:
- 10.1145/3501709. (Eds.): . ICER 2022: ACM Conference on International Computing Education Research, Lugano and Virtual Event, Switzerland, August 7 - 11, 2022, Volume 2. New York, NY: ACM Press. doi:
- 10.1145/3446871. (Eds.): . ICER 2021: Proceedings of the 17th ACM Conference on International Computing Education Research. New York, NY: ACM Press. doi:
- . . ‘K-Means for Semantically Enriched Trajectories.’ In Proceedings of the 1st ACM SIGSPATIAL International Workshop on Animal Movement Ecology and Human Mobility (HANIMOB'21), edited by , 38–47. New York, NY: ACM Press. doi: 10.1145/3486637.3489495.
- . . ‘Exploring Algorithm Comprehension: Linking Proof and Program Code.’ In Proceedings of the 21st Koli Calling International Conference on Computing Education Research (Koli Calling 2021), edited by , 28:1–28:10. doi: 10.1145/3488042.3488061.
- . . ‘Oblivious Median Slope Selection.’ In Proceedings of the 33rd Canadian Conference on Computational Geometry, edited by , 320–331.
- . . ‘Is Algorithm Comprehension Different from Program Comprehension?’ In Proceedings of the 2021 IEEE/ACM 29th International Conference on Program Comprehension (ICPC), edited by , 455–466. New York City: Wiley-IEEE Computer Society Press. doi: 10.1109/ICPC52881.2021.00053.
- . . ‘The Cambridge Handbook of Computing Education Research Summarized in 75 Minutes.’ In Proceedings of the 51st ACM Technical Symposium on Computer Science Education, edited by , 323–324. New York, NY: ACM Press. doi: 10.1145/3328778.3366988.
- . . ‘Critical Incidents in K-12 Computer Science Classrooms - Towards Vignettes for Computer Science Teacher Training.’ In Proceedings of the 51st ACM Technical Symposium on Computer Science Education, edited by , 978–984. New York, NY: ACM Press. doi: 10.1145/3328778.3366926.
- . . „Kompetenzen im Bereich ‚Computational Thinking‘ von Schülerinnen und Schülern im internationalen Vergleich.“ In ICILS 2018 #NRW. Vertiefende Analysen und Befunde für Nordrhein-Westfalen im internationalen Vergleich, herausgegeben von , 201–214. Münster: Waxmann.
- . . „Der Informatikunterricht aus Sicht schulischer Akteurinnen und Akteure - Analysen und Perspektiven.“ In ICILS 2018 #NRW. Vertiefende Analysen und Befunde für Nordrhein-Westfalen im internationalen Vergleich, herausgegeben von , 137–154. Münster: Waxmann.
- . . ‘Revisiting Self-Efficacy in Introductory Programming.’ In ICER '20: Proceedings of the 2020 ACM Conference on International Computing Education Research, edited by , 158–169. New York, NY: ACM Press. doi: 10.1145/3372782.3406281.
- . . ‘Mapping the Landscape of Peer Review in Computing Education Research.’ In ITiCSE-WGR '20: Proceedings of the Working Group Reports on Innovation and Technology in Computer Science Education, edited by , 173–209. New York, NY: ACM Press. doi: 10.1145/3437800.3439207.
- . . Notional Machines and Programming Language Semantics in Education (Dagstuhl Seminar 19281) Dagstuhl Reports, Nr. 9(7), . doi: 10.4230/DagRep.9.7.1.
- . . „Der Kompetenzbereich ‚Computational Thinking‘: erste Ergebnisse des Zusatzmoduls für Deutschland im internationalen Vergleich.“ In ICILS 2018 #Deutschland – Computer- und informationsbezogene Kompetenzen von Schülerinnen und Schülern im zweiten internationalen Vergleich und Kompetenzen im Bereich Computational Thinking, herausgegeben von , 367–398. Münster: Waxmann.
- . . „Das Konstrukt der computer- und informationsbezogenen Kompetenzen und das Konstrukt der Kompetenzen im Bereich ‚Computational Thinking‘ in ICILS 2018.“ In ICILS 2018 #Deutschland – Computer- und informationsbezogene Kompetenzen von Schülerinnen und Schülern im zweiten internationalen Vergleich und Kompetenzen im Bereich Computational Thinking, herausgegeben von , 79–111. Münster: Waxmann.
- (Hrsg.): . ICILS 2018 #Deutschland – Computer- und informationsbezogene Kompetenzen von Schülerinnen und Schülern im zweiten internationalen Vergleich und Kompetenzen im Bereich Computational Thinking. Münster: Waxmann.
- . . ‘Inferring Semantically Enriched Representative Trajectories.’ Contributed to the 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data (MOVE++ 2019), Chicago, IL, USA. doi: 10.1145/3356392.3365220.
- . . ‘Approximate Shortest Distances Among Smooth Obstacles in 3D.’ Journal of Computational Geometry 10, Nr. 1: 390–422. doi: 10.20382/jocg.v10i1a13.
- . . ‘Student Knowledge and Misconceptions.’ In The Cambridge Handbook of Computing Education Research, edited by , 773–800. Cambridge: Cambridge University Press. doi: 10.1017/9781108654555.028.
- . . ‘Schools (K-12).’ In The Cambridge Handbook of Computing Education Research, edited by , 547–583. Cambridge: Cambridge University Press. doi: 10.1017/9781108654555.019.
- . . ‘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 , 916–917. New York, NY: ACM Press. doi: 10.1145/3159450.3159633.
- . . ‘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 , 1–10. New York, NY: ACM Press. doi: 10.1145/3230977.3230980.
- . . ‘Reprint: An Instrument to Assess Self-Efficacy in Introductory Algorithms Courses.’ ACM Inroads 9, Nr. 1: 56–65. doi: 10.1145/3105726.3106171.
- . . ‘CS Unplugged—How Is It Used, and Does It Work?’ In Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, edited by , 497–521. Düsseldorf: Springer VDI Verlag. doi: 10.1007/978-3-319-98355-4_29.
- . . ‘Undergraduate Teaching Assistants in Computer Science: Teaching-Related Beliefs, Tasks, and Competences.’ In Proceedings of the IEEE Global Engineering Education Conference (EDUCON), edited by , 718–725. New York City: Wiley-IEEE Press. doi: 10.1109/EDUCON.2017.7942927.
- . . ‘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 , 1–10. New York, NY: ACM Press. doi: 10.1145/3150919.3150922.
- (Hrsg.): . 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.
- . . „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 , 205–230. Münster: Waxmann.
- . . ‘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, NY: ACM Press. doi: 10.1145/3139958.3140063.
- . . Informatics Education in Europe: Are We All In The Same Boat? , . doi: 10.1145/3106077.
- . . ‘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 , 217–225. New York, NY: ACM Press. doi: 10.1145/3105726.3106171.
- . . „Kompetenzbasierte Gestaltungsempfehlungen für Informatik-Tutorenschulungen.“ In INFORMATIK 2017, herausgegeben von , 241–254. Bonn: Gesellschaft für Informatik. doi: 10.18420/in2017_18.
- . . ‘Deviation Maps for Robust and Informed Indoor Positioning Services.’ SIGSPATIAL Special 9, Nr. 1: 27–34. doi: 10.1145/3124104.3124110.
- . . Assessing Learning In Introductory Computer Science (Dagstuhl Seminar 16072) Dagstuhl Reports, Nr. 6(2), . doi: 10.4230/DagRep.6.2.78.
- . . ‘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 , 12–17. New York, NY: ACM Press. doi: 10.1145/2839509.2844591.
- . . ‘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 , 88–91. New York, NY: ACM Press. doi: 10.1145/3004725.3004727.
- 10.1145/2978249. (Eds.): . Proceedings of the 11th Workshop in Primary and Secondary Computing Education, WiPSCE 2016, Münster, Germany, October 13-15, 2016. New York, NY: ACM Press. doi:
- . . ‘Approximate Shortest Distances Among Smooth Obstacles in 3D.’ In Proceedings of the 27th International Symposium on Algorithms and Computation, edited by , 60:1–60:13. Wadern: Dagstuhl Publishing. doi: 10.4230/LIPIcs.ISAAC.2016.60.
- . . ‘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 , 118–123. New York, NY: ACM Press. doi: 10.1145/2899415.2899442.
- . . ‘B-Trees.’ In Encyclopedia of Algorithms, edited by , 1–8. 2. Aufl. Luxemburg: Springer Science+Business Media. doi: 10.1007/978-3-642-27848-8_57-2.
- 10.1145/2818314. (Eds.): . Proceedings of the Workshop in Primary and Secondary Computing Education, WiPSCE 2015, London, United Kingdom, November 9-11, 2015. New York, NY: ACM Press. doi:
- 10.1007/978-3-319-25396-1. (Eds.): . Informatics in Schools. Curricula, Competences, and Competitions. Düsseldorf: Springer VDI Verlag. doi:
- . . ‘Subquadratic Medial-Axis Approximation in R^3.’ Journal of Computational Geometry 6, Nr. 1: 249–287. doi: 10.20382/jocg.v6i1a11.
- . . ‘Polygon Triangulation.’ In Encyclopedia of Algorithms, edited by , 1–5. 2. Aufl. Luxemburg: Springer Science+Business Media. doi: 10.1007/978-3-642-27848-8_506-1.
- . . ‘Making Sense of Trajectory Data in Indoor Spaces .’ In Proceedings of the 16th IEEE International Conference on Mobile Data Management, edited by , 116–121. New York City: Wiley-IEEE Press. doi: 10.1109/MDM.2015.44.
- . . ‘The CS Concept Inventory Quiz Show.’ In Proceedings of the 46th SIGCSE Technical Symposium on Computer Science Education (SICGSE 2015), edited by , 669–670. New York, NY: ACM Press. doi: 10.1145/2676723.2677315.
- . . ‘Computer Science Education in North-Rhine Westphalia, Germany – A Case Study.’ ACM Transactions on Computing Education 15, Nr. 2. doi: 10.1145/2716313.
- . . ‘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.
- . . ‘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.
- . . ‘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.
- . . Informatics education: Europe cannot afford to miss the boat , .
- . . „Diagnose und individuelle Förderung (im Informatik-Unterricht).“ In Informatik erweitert Horizonte: 15. GI-Fachtagung Informatik und Schule, herausgegeben von , 23. Bonn: Köllen.
- . . ‘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.
- . . „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 , 101–114. Münster: Waxmann.
- . . „Diagnose und individuelle Förderung erlernen.“ In Diagnose und individuelle Förderung in der MINT-Lehrerbildung: Das Projekt dortMINT, herausgegeben von , 97–100. Münster: Waxmann.
- . . ‘Approximating Weighted Geodesic Distances in R^3.’ In Proceedings of the 29th European Workshop on Computational Geometry, edited by , 107–110.
- . . ‘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 , 196–208. Heidelberg: Springer. doi: 10.1007/978-3-642-36617-8_17.
- . . ‘On Plugging "Unplugged" into CS Classes.’ In Proceedings of the 44th SIGCSE Technical Symposium on Computer Science Education (SICGSE 2013), edited by , 365–370. New York, NY: ACM Press. doi: 10.1145/2445196.2445303.
- . . ‘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 , 29–34. New York, NY: ACM Press. doi: 10.1145/2445196.2445212.
- . . ‘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 , 3–4. New York, NY: ACM Press. doi: 10.1145/2481449.2481452.
- . . ‘Revisiting the Construction of SSPDs in the Presence of Memory Hierarchies.’ In 28th European Workshop on Computational Geometry, Booklet of Abstracts, edited by , 57–60.
- . . ‘Simplified Medial-Axis Approximation with Guarantees.’ In 28th European Workshop on Computational Geometry, Booklet of Abstracts, edited by , 161–164.
- . . ‘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.
- . . ‘On the Space-Efficiency of the "Ultimate Planar Convex Hull Algorithm".’ In 24th Canadian Conference on Computational Geometry, edited by , 139–144.
- . . ‘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 , 487–492. New York, NY: ACM Press. doi: 10.1145/2157136.2157281.
- . . ‘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 , 45–50. New York, NY: ACM Press. doi: 10.1145/2157136.2157154.
- . . ‘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 , 129–138. doi: 10.1145/2424321.2424339.
- . . ‘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 , 21–26. New York, NY: ACM Press. doi: 10.1145/2157136.2157148.
- . . ‘Learning a 2-Manifold with a Boundary in R^3.’ In Abstracts from EuroCG 2011, 27th European Workshop on Computational Geometry, edited by , 213–216.
- . . ‘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 .
- . . ‘Approximating Geodesic Distances on 2-Manifolds in R^3.’ In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), edited by , 325–330.
- 10.1007/978-3-642-11376-5. (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. Düsseldorf: Springer VDI Verlag. doi:
- (Eds.): . 26th European Workshop on Computational Geometry (EuroCG 2010). Proceedings. N/A: Selbstverlag / Eigenverlag.
- . . ‘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 , 329–330. New York, NY: ACM Press. doi: 10.1145/1822090.1822207.
- . . ‘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. New York City: Wiley-IEEE Computer Society Press. doi: 10.1109/FIE.2010.5673370.
- . . ‘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.
- . . ‘In-Place Algorithms for Computing (Layers of) Maxima.’ Algorithmica 57, Nr. 1: 1–21. doi: 10.1007/s00453-008-9193-z.
- . . ‘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 , 204–208. New York, NY: ACM Press. doi: 10.1145/1734263.1734336.
- . . ‘Resilient K-d Trees: K-Means in Space Revisited.’ In Proceedings of the 10th IEEE International Conference on Data Mining (ICDM 2010), 815–820. New York City: Wiley-IEEE Computer Society Press. doi: 10.1109/ICDM.2010.94.
- . . ‘Detecting Quasars in Large-Scale Astronomical Surveys.’ In Proceedings of the Ninth International Conference on Machine Learning and Applications (ICMLA 2010), 352–357. New York City: Wiley-IEEE Computer Society Press. doi: 10.1109/ICMLA.2010.59.
- 10.1109/TEVC.2009.2015575. . ‘On the Complexity of Computing the Hypervolume Indicator.’ IEEE Transactions on Evolutionary Computation 13, Nr. 5: 1075–1082. doi:
- . . ‘Cache-Oblivious Construction of a Well-Separated Pair Decomposition.’ In Proceedings of the 25th European Workshop on Computational Geometry, edited by , 341–344.
- 10.1007/978-3-642-02011-7. (Eds.): . Experimental Algorithms. 8th International Symposium, SEA 2009. Dortmund, Germany, June 2009. Proceedings. Düsseldorf: Springer VDI Verlag. doi:
- . . „Rote Fäden zur Kontextorientierung im Informatikunterricht.“ In Informatische Bildung in Theorie und Praxis, 13. GI-Fachtagung - Informatik und Schule (INFOS 2009), herausgegeben von , 45–56. Berlin: LOG IN Verlag.
- . . ‘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/1227161.1370600.
- . . ‘Query Responsive Index Structures.’ In Proceedings of the Fifth International Conference on Geographic Information Science (GIScience 2008), edited by , 1–19. Heidelberg: Springer. doi: 10.1007/978-3-540-87473-7_1.
- . . ‘B-Trees.’ In Encyclopedia of Algorithms, edited by , 108–112. Düsseldorf: Springer VDI Verlag. doi: 10.1007/978-0-387-30162-4_57.
- . . ‘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 , 387–395. Lissabon: INSTICC.
- . . ‘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 , 28–33. Düren: Shaker Verlag.
- . . ‘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.
- . . ‘Line-Segment Intersection Made In-Place.’ Computational Geometry: Theory & Applications 38, Nr. 3: 213–230. doi: 10.1016/j.comgeo.2006.09.001.
- . . ‘Space-Efficient Geometric Divide-and-Conquer Algorithms.’ Computational Geometry: Theory & Applications 37, Nr. 3: 209–227. doi: 10.1016/j.comgeo.2006.03.006.
- . . ‘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 , 333–340. Berlin: Akademische Verlagsgesellschaft.
- . . ‘Modeling and Engineering Algorithms for Mobile Data.’ In Progress in Spatial Data Handling, 12th International Symposium on Spatial Data Handling, 61–77. Heidelberg: Springer. doi: 10.1007/3-540-35589-8_5.
- . . ‘In-Place Randomized Slope Selection.’ In 22nd European Conference on Computational Geometry, edited by , 177–180.
- . . ‘In-Place Algorithms for Computing (Layers of) Maxima.’ In 22nd European Conference on Computational Geometry, edited by , 181–184.
- . . ‘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, NY: ACM Press. doi: 10.1145/1141277.1141290.
- . . ‘In-Place Randomized Slope Selection.’ In Proceedings of the 6th Conference on Algorithms and Complexity (CIAC 2006), edited by , 31–40. Heidelberg: Springer. doi: 10.1007/11758471_6.
- . . ‘In-Place Algorithms for Computing (Layers of) Maxima.’ In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), edited by , 363–374. Heidelberg: Springer. doi: 10.1007/11785293_34.
- (Eds.): . Proceedings of the Workshop on Massive Geometric Data Sets (Massive2005). N/A: Selbstverlag / Eigenverlag.
- . . ‘Line-Segment Intersection Made In-Place.’ In Proceedings of the Ninth International Workshop on Algorithms and Data Structures (WADS 2005), edited by , 146–157. Heidelberg: Springer. doi: 10.1007/11534273_14.
- . . ‘I/O-Efficiently Pruning Dense Spanners.’ In Revised Selected Papers of the Japanese Conference on Discrete and Computational Geometry (JCDCG 2004), edited by , 106–116. Heidelberg: Springer. doi: 10.1007/11589440_11.
- . . ‘A Framework for Representing Moving Objects.’ In Proceedings of the 15th International Conference on Database and Expert Systems Applications (DEXA 2004), edited by , 854–863. Heidelberg: Springer. doi: 10.1007/978-3-540-30075-5_82.
- . . ‘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 , 35–36.
- . . ‘Space-Efficient Geometric Divide-and-Conquer Algorithms.’ In 20th European Workshop on Computational Geometry, Abstracts, edited by , 65–68.
- . . „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 , 3–12.
- . . ‘I/O-Efficient Dynamic Planar Point Location.’ Computational Geometry: Theory & Applications 29, Nr. 2: 147–162. doi: 10.1016/j.comgeo.2003.04.001.
- . . „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 , 29–41.
- . . ‘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. New York City: Wiley-IEEE Press. doi: 10.1109/DEXA.2004.1333583.
- . . Large-Scale Algorithms and Data Structures for Dynamic and Time-Variant Geometric Problems Habilitationsschrift, Westfälische Wilhelms-Universität Münster.
- . . ‘External Memory Computational Geometry Revisited.’ In Algorithms for Memory Hierarchies, edited by , 110–148. Düsseldorf: Springer VDI Verlag. doi: 10.1007/3-540-36574-5_6.
- . . ‘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.
- . . ‘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.
- . . ‘Efficient Bulk Operations on Dynamic R-trees.’ Algorithmica 33, Nr. 1: 104–128. doi: 10.1007/s00453-001-0107-6.
- . . ‘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.
- . . ‘On Reverse Nearest Neighbor Queries (Extended Abstract).’ In Proceedings of the 14th Canadian Conference on Computational Geometry, edited by , 128–132.
- . . ‘Time-Responsive External Data Structures for Moving Points.’ In Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001), edited by , 50–61. Heidelberg: Springer. doi: 10.1007/3-540-44634-6_6.
- . . ‘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 , 122–134. Heidelberg: Springer. doi: 10.1007/3-540-44634-6_12.
- . . ‘Planar Point Location for Large Data Sets: To Seek or Not to Seek.’ In Algorithm Engineering, 4th International Workshop, WAE 2000, edited by , 183–194. Heidelberg: Springer. doi: 10.1007/3-540-44691-5_16.
- . . ‘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 , 413–429. Heidelberg: Springer. doi: 10.1007/3-540-46439-5_29.
- . . ‘A Unified Approach For Indexed and Non-Indexed Spatial Joins.’ In Advances in Database Technology - Proceedings of the 7th International Conference on Extending Databases Technology (EDBT '00), edited by , 413–429. Heidelberg: Springer. doi: 10.1007/3-540-46439-5_29.
- . . ‘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, NY: ACM Press. doi: 10.1145/336154.336205.
- . . External Memory Algorithms for Geographic Information Systems Dissertationsschrift, Westfälische Wilhelms-Universität Münster.
- . . ‘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 , 270–285. Heidelberg: Springer. doi: 10.1007/3-540-48482-5_17.
- . . ‘Efficient Bulk Operations on Dynamic R-trees (extended abstract).’ In Algorithm Engineering and Experimentation, International Workshop ALENEX '99, edited by , 328–347. Heidelberg: Springer. doi: 10.1007/3-540-48518-X_20.
Betreute Promotionen
Seep, Jana Analyse semantisch annotierter Trajektorien Kather, Philipp Towards Algorithm Comprehension Scheffer, Christian Approximation Algorithms for Geometrical Distance Problems that are not Solvable Exactly Pasternak, Arno Fach- und bildungswissenschaftliche Grundlagen für den Informatikunterricht in der Sekundarstufe I Blunck, Henrik Modelle und Algorithmen für mobile Datenobjekte und Umgebungen
Prof. Dr. Jan Vahrenhold
Professur für Praktische Informatik (Prof. Vahrenhold)
Professor