A Probabilistic Algorithm for Vertex Connectivity of Graphs. - Michael Becker 009; W. Degenhardt; Jürgen Doenhardt; Stefan Hertel; Gerd Kaninke; W. Kerber; Kurt Mehlhorn; Stefan Näher; Hans Rohnert; Thomas Winter (Inf. Process. Lett., 1982)

A Dynamization of the All Pairs Least Cost Path Problem. - Hans Rohnert (STACS, 1985)

Shortest Paths in the Plane with Convex Polygonal Obstacles. - Hans Rohnert (Inf. Process. Lett., 1986)

Moving Discs Between Polygons. - Hans Rohnert (ICALP, 1988)

Upper and Lower Bounds for the Dictionary Problem (Abstract). - Martin Dietzfelbinger; Kurt Mehlhorn; Friedhelm Meyer auf der Heide; Hans Rohnert (SWAT, 1988)

Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. - Hans Rohnert (Inf. Process. Lett., 1988)

Bewegungsplanung in der Ebene. - Hans Rohnert (1989)

Moving a Disc Between Polygons. - Hans Rohnert (Algorithmica, 1991)

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)

On-line Graph Algorithms for Incremental Compilation. - Alberto Marchetti-Spaccamela; Umberto Nanni; Hans Rohnert (WG, 1993)

Dynamic Perfect Hashing: Upper and Lower Bounds. - Martin Dietzfelbinger; Anna R. Karlin; Kurt Mehlhorn; Friedhelm Meyer auf der Heide; Hans Rohnert; Robert Endre Tarjan (SIAM J. Comput., 1994)

Maintaining a Topological Order Under Edge Insertions. - Alberto Marchetti-Spaccamela; Umberto Nanni; Hans Rohnert (Inf. Process. Lett., 1996)