Jan Vahrenhold

According to our database1, Jan Vahrenhold authored at least 74 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Notional Machines and Programming Language Semantics in Education (Dagstuhl Seminar 19281).
Dagstuhl Reports, 2019

Editorial.
Computer Science Education, 2019

Inferring Semantically Enriched Representative Trajectories.
Proceedings of the 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data, 2019

2018
An instrument to assess self-efficacy in introductory algorithms courses.
Inroads, 2018

The CECE Report: Creating a Map of Informatics in European Schools.
Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Self-Efficacy, Cognitive Load, and Emotional Reactions in Collaborative Algorithms Labs - A Case Study.
Proceedings of the 2018 ACM Conference on International Computing Education Research, 2018

CS Unplugged - How Is It Used, and Does It Work?
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017
Deviation maps for robust and informed indoor positioning services.
SIGSPATIAL Special, 2017

A Filter-and-Refinement-Algorithm for Range Queries Based on the Fréchet Distance (GIS Cup).
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Bulk-Loading an Index for Temporally Overlaying Spatio-Textual Trajectories.
Proceedings of the 6th ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data, 2017

Kompetenzbasierte Gestaltungsempfehlungen für Informatik-Tutorenschulungen.
Proceedings of the 47. Jahrestagung der Gesellschaft für Informatik, 2017

Undergraduate teaching assistants in computer science: Teaching-related beliefs, tasks, and competences.
Proceedings of the 2017 IEEE Global Engineering Education Conference, 2017

2016
Polygon Triangulation.
Encyclopedia of Algorithms, 2016

B-trees.
Encyclopedia of Algorithms, 2016

Assessing Learning In Introductory Computer Science (Dagstuhl Seminar 16072).
Dagstuhl Reports, 2016

Stay on These Roads: Potential Factors Indicating Students' Performance in a CS2 Course.
Proceedings of the 47th ACM Technical Symposium on Computing Science Education, Memphis, TN, USA, March 02, 2016

Back to School: Computer Science Unplugged in the Wild.
Proceedings of the 2016 ACM Conference on Innovation and Technology in Computer Science Education, 2016

Approximate Shortest Distances Among Smooth Obstacles in 3D.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Deviation maps: enhancing robustness and predictability of indoor positioning systems.
Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems, 2016

2015
Subquadratic medial-axis approximation in $\mathbb{R}^3$.
JoCG, 2015

Computer Science Education in North-Rhine Westphalia, Germany - A Case Study.
TOCE, 2015

The CS Concept Inventory Quiz Show.
Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

Making Sense of Trajectory Data in Indoor Spaces.
Proceedings of the 16th IEEE International Conference on Mobile Data Management, 2015

2014
Developing and validating test items for first-year computer science courses.
Computer Science Education, 2014

Approximating geodesic distances on 2-manifolds in R3: The weighted case.
Comput. Geom., 2014

Approximating geodesic distances on 2-manifolds in R3.
Comput. Geom., 2014

2013
Addressing the Full Range of Students: Challenges in K-12 Computer Science Education.
IEEE Computer, 2013

On plugging "unplugged" into CS classes.
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Hunting high and low: instruments to detect misconceptions related to algorithms and data structures.
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Diagnose und individuelle Förderung (im InformatikUnterricht).
Proceedings of the Informatik erweitert Horizonte, 2013

Research-Based Learning Revisited: On Using a Delphi Process in Informatics Teacher Education.
Proceedings of the Informatics in Schools. Sustainable Informatics Education for Pupils of all Ages, 2013

2012
Resilient k-d trees: k-means in space revisited.
Frontiers Comput. Sci., 2012

On the importance of being earnest: challenges in computer science education.
Proceedings of the Workshop in Primary and Secondary Computing Education, 2012

Reflections on outreach programs in CS classes: learning objectives for "unplugged" activities.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Design and evaluation of a braided teaching course in sixth grade computer science education.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Detecting and understanding students' misconceptions related to algorithms and data structures.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Of motifs and goals: mining trajectory data.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

On the Space Efficiency of the "Ultimate Planar Convex Hull Algorithm".
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Preface.
ACM Journal of Experimental Algorithmics, 2011

Approximating Geodesic Distances on 2-Manifolds in R3.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies.
J. Discrete Algorithms, 2010

In-Place Algorithms for Computing (Layers of) Maxima.
Algorithmica, 2010

Braided teaching in secondary CS education: contexts, continuity, and the role of programming.
Proceedings of the 41st ACM technical symposium on Computer science education, 2010

Professional associations in K-12 computer science.
Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2010

Detecting Quasars in Large-Scale Astronomical Surveys.
Proceedings of the Ninth International Conference on Machine Learning and Applications, 2010

Resilient K-d Trees: K-Means in Space Revisited.
Proceedings of the ICDM 2010, 2010

2009
On the Complexity of Computing the Hypervolume Indicator.
IEEE Trans. Evolutionary Computation, 2009

Rote Fäden und Kontextorientierung im Informatikunterricht.
Proceedings of the Zukunft braucht Herkunft: 25 Jahre "INFOS, 2009

2008
B-trees.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Terracost: Computing least-cost-path surfaces for massive grid terrains.
ACM Journal of Experimental Algorithmics, 2008

Query Responsive Index Structures.
Proceedings of the Geographic Information Science, 5th International Conference, 2008

2007
An in-place algorithm for Klee's measure problem in two dimensions.
Inf. Process. Lett., 2007

Line-segment intersection made in-place.
Comput. Geom., 2007

Space-efficient geometric divide-and-conquer algorithms.
Comput. Geom., 2007

Generating optimized marker-based rigid bodies for optical tracking systems.
Proceedings of the VISAPP 2007: Proceedings of the Second International Conference on Computer Vision Theory and Applications, Barcelona, Spain, March 8-11, 2007, 2007

2006
TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

In-Place Randomized Slope-Selection.
Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

2004
I/O-efficient dynamic planar point location.
Comput. Geom., 2004

Ein Rahmenwerk zur Repräsentation von sich bewegenden Objekten.
Proceedings of the Beitragsband zum Workshop "Grundlagen und Anwendungen mobiler Informationstechnologie" des GI-Arbeitskreises Mobile Datenbanken und Informationssysteme, 2004

I/O-Efficiently Pruning Dense Spanners.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

An XML- and Log-Based Infrastructure For Evaluating And Teaching Spatio-Temporal Indexing Schemes.
Proceedings of the 15th International Workshop on Database and Expert Systems Applications (DEXA 2004), with CD-ROM, 30 August, 2004

A Framework for Representing Moving Objects.
Proceedings of the Database and Expert Systems Applications, 15th International Conference, 2004

A Simple Algorithm for I/O-efficiently Pruning Dense Spanners.
Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004

2002
Planar Point Location For Large Data Sets: To Seek Or Not To Seek.
ACM Journal of Experimental Algorithmics, 2002

Reporting intersecting pairs of convex polytopes in two and three dimensions.
Comput. Geom., 2002

Efficient Bulk Operations on Dynamic R-Trees.
Algorithmica, 2002

External Memory Computational Geometry Revisited.
Proceedings of the Algorithms for Memory Hierarchies, 2002

On reverse nearest neighbor queries.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Time Responsive External Data Structures for Moving Points.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

2000
A Unified Approach for Indexed and Non-Indexed Spatial Joins.
Proceedings of the Advances in Database Technology, 2000

I/O-efficient dynamic planar point location (extended abstract).
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets.
Proceedings of the Advances in Spatial Databases, 1999

External memory algorithms for geographic information systems.
PhD thesis, 1999


  Loading...