1996 |
12 | EE | Alberto Marchetti-Spaccamela,
Umberto Nanni,
Hans Rohnert:
Maintaining a Topological Order Under Edge Insertions.
Inf. Process. Lett. 59(1): 53-58 (1996) |
1994 |
11 | | Martin Dietzfelbinger,
Anna R. Karlin,
Kurt Mehlhorn,
Friedhelm Meyer auf der Heide,
Hans Rohnert,
Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds.
SIAM J. Comput. 23(4): 738-761 (1994) |
1993 |
10 | | Alberto Marchetti-Spaccamela,
Umberto Nanni,
Hans Rohnert:
On-line Graph Algorithms for Incremental Compilation.
WG 1993: 70-86 |
1992 |
9 | | Rudolf Fleischer,
Otfried Fries,
Kurt Mehlhorn,
Stefan Meiser,
Stefan Näher,
Hans Rohnert,
Stefan Schirra,
Klaus Simon,
Athanasios K. Tsakalidis,
Christian Uhrig:
Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Data Structures and Efficient Algorithms 1992: 25-43 |
1991 |
8 | | Hans Rohnert:
Moving a Disc Between Polygons.
Algorithmica 6(2): 182-191 (1991) |
1988 |
7 | | Martin Dietzfelbinger,
Anna R. Karlin,
Kurt Mehlhorn,
Friedhelm Meyer auf der Heide,
Hans Rohnert,
Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds
FOCS 1988: 524-531 |
6 | | Hans Rohnert:
Moving Discs Between Polygons.
ICALP 1988: 502-515 |
5 | | Martin Dietzfelbinger,
Kurt Mehlhorn,
Friedhelm Meyer auf der Heide,
Hans Rohnert:
Upper and Lower Bounds for the Dictionary Problem (Abstract).
SWAT 1988: 214-215 |
4 | | Hans Rohnert:
Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons.
Inf. Process. Lett. 27(4): 175-179 (1988) |
1986 |
3 | | Hans Rohnert:
Shortest Paths in the Plane with Convex Polygonal Obstacles.
Inf. Process. Lett. 23(2): 71-76 (1986) |
1985 |
2 | | Hans Rohnert:
A Dynamization of the All Pairs Least Cost Path Problem.
STACS 1985: 279-286 |
1982 |
1 | | Michael Becker,
W. Degenhardt,
Jürgen Doenhardt,
Stefan Hertel,
Gerd Kaninke,
W. Kerber,
Kurt Mehlhorn,
Stefan Näher,
Hans Rohnert,
Thomas Winter:
A Probabilistic Algorithm for Vertex Connectivity of Graphs.
Inf. Process. Lett. 15(3): 135-136 (1982) |