The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Vahrenhold: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
    Efficient Bulk Operations on Dynamic R-trees. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:328-348 [Conf]
  2. Anil Maheshwari, Jan Vahrenhold, Norbert Zeh
    On reverse nearest neighbor queries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:128-132 [Conf]
  3. Henrik Blunck, Jan Vahrenhold
    In-Place Randomized Slope Selection. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:30-41 [Conf]
  4. Lars Arge, Jan Vahrenhold
    I/O-efficient dynamic planar point location (extended abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:191-200 [Conf]
  5. Christian Breimann, Jan Vahrenhold
    External Memory Computational Geometry Revisited. [Citation Graph (0, 0)][DBLP]
    Algorithms for Memory Hierarchies, 2002, pp:110-148 [Conf]
  6. Ludger Becker, Henrik Blunck, Klaus Hinrichs, Jan Vahrenhold
    A Framework for Representing Moving Objects. [Citation Graph (0, 0)][DBLP]
    DEXA, 2004, pp:854-863 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    DEXA Workshops, 2004, pp:851-855 [Conf]
  8. Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter
    A Unified Approach for Indexed and Non-Indexed Spatial Joins. [Citation Graph (0, 29)][DBLP]
    EDBT, 2000, pp:413-429 [Conf]
  9. Joachim Gudmundsson, Jan Vahrenhold
    I/O-Efficiently Pruning Dense Spanners. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:106-116 [Conf]
  10. Ludger Becker, Henrik Blunck, Klaus Hinrichs, Jan Vahrenhold
    Ein Rahmenwerk zur Repräsentation von sich bewegenden Objekten. [Citation Graph (0, 0)][DBLP]
    Grundlagen und Anwendungen mobiler Informationstechnologie, 2004, pp:3-12 [Conf]
  11. Tom Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe
    TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains. [Citation Graph (0, 0)][DBLP]
    SAC, 2006, pp:52-57 [Conf]
  12. Ludger Becker, André Giesen, Klaus Hinrichs, Jan Vahrenhold
    Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets. [Citation Graph (0, 0)][DBLP]
    SSD, 1999, pp:270-285 [Conf]
  13. Henrik Blunck, Jan Vahrenhold
    In-Place Algorithms for Computing (Layers of) Maxima. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:363-374 [Conf]
  14. Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold
    Time Responsive External Data Structures for Moving Points. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:50-61 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:122-134 [Conf]
  16. Jan Vahrenhold
    Line-Segment Intersection Made In-Place. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:146-157 [Conf]
  17. Jan Vahrenhold, Klaus Hinrichs
    Planar Point Location for Large Data Sets: To Seek or Not to Seek. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:183-194 [Conf]
  18. Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
    Efficient Bulk Operations on Dynamic R-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:1, pp:104-128 [Journal]
  19. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:195-207 [Journal]
  20. Lars Arge, Jan Vahrenhold
    I/O-efficient dynamic planar point location. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:2, pp:147-162 [Journal]
  21. Jan Vahrenhold
    An in-place algorithm for Klee's measure problem in two dimensions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:4, pp:169-174 [Journal]
  22. Jan Vahrenhold, Klaus Hinrichs
    Planar Point Location For Large Data Sets: To Seek Or Not To Seek. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:8- [Journal]
  23. Frank Steinicke, Christian P. Jansen, Klaus Hinrichs, Jan Vahrenhold, Bernd Schwald
    Generating optimized marker-based rigid bodies for optical tracking systems. [Citation Graph (0, 0)][DBLP]
    VISAPP (2), 2007, pp:387-395 [Conf]
  24. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
    Space-efficient geometric divide-and-conquer algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:209-227 [Journal]
  25. Jan Vahrenhold
    Line-segment intersection made in-place. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:213-230 [Journal]

  26. In-Place Randomized Slope-Selection. [Citation Graph (, )][DBLP]


  27. A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. [Citation Graph (, )][DBLP]


  28. Query Responsive Index Structures. [Citation Graph (, )][DBLP]


  29. Rote Fäden und Kontextorientierung im Informatikunterricht. [Citation Graph (, )][DBLP]


  30. Braided teaching in secondary CS education: contexts, continuity, and the role of programming. [Citation Graph (, )][DBLP]


  31. Professional associations in K-12 computer science. [Citation Graph (, )][DBLP]


  32. In-Place Algorithms for Computing (Layers of) Maxima. [Citation Graph (, )][DBLP]


Search in 3.033secs, Finished in 3.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002