Point Location in Arrangements. - Stefan Meiser (Workshop on Computational Geometry, 1988)

On the Construction of Abstract Voronoi Diagrams, II. - Rolf Klein; Kurt Mehlhorn; Stefan Meiser (SIGAL International Symposium on Algorithms, 1990)

Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation. - Olivier Devillers; Stefan Meiser; Monique Teillaud (WADS, 1991)

On the Construction of Abstract Voronoi Diagrams. - Kurt Mehlhorn; Stefan Meiser; Colm Ó'Dúnlaing (Discret. Comput. Geom., 1991)

Randomized Incremental Construction of Abstract Voronoi Diagrams. - Rolf Klein; Kurt Mehlhorn; Stefan Meiser (Informatik, 1992)

Selected Topics from Computational Geometry, Data Structures and Motion Planning. - Rudolf Fleischer; Otfried Fries; Kurt Mehlhorn; Stefan Meiser; Stefan Näher; Hans Rohnert; Stefan Schirra; Klaus Simon; Athanasios K. Tsakalidis; Christian Uhrig (Data Structures and Efficient Algorithms, 1992)

Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation. - Olivier Devillers; Stefan Meiser; Monique Teillaud (Comput. Geom., 1992)

Randomized Incremental Construction of Abstract Voronoi Diagrams. - Rolf Klein; Kurt Mehlhorn; Stefan Meiser (Comput. Geom., 1993)

Zur Konstruktion abstrakter Voronoidiagramme. - Stefan Meiser (1993)

Point Location in Arrangements of Hyperplanes - Stefan Meiser (Inf. Comput., 1993)

Furthest Site Abstract Voronoi Diagrams. - Kurt Mehlhorn; Stefan Meiser; Ronald Rasch (Int. J. Comput. Geom. Appl., 2001)