Hans Rohnert

13 papers A* 2A 1B 1Journal 6Unranked 2
YearRankTypeTitle / Venue / Authors
1996 J jnl
Maintaining a Topological Order Under Edge Insertions.
Inf. Process. Lett.
Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
1994 J jnl
Dynamic Perfect Hashing: Upper and Lower Bounds.
SIAM J. Comput.
Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
1993 B conf
On-line Graph Algorithms for Incremental Compilation.
WG
Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
1992 — conf
Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Data Structures and Efficient Algorithms
Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig
1991 J jnl
Moving a Disc Between Polygons.
Algorithmica
Hans Rohnert
1989 — —
Bewegungsplanung in der Ebene.
Hans Rohnert
1988 A* conf
Dynamic Perfect Hashing: Upper and Lower Bounds
FOCS
Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
1988 A* conf
Moving Discs Between Polygons.
ICALP
Hans Rohnert
1988 J jnl
Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons.
Inf. Process. Lett.
Hans Rohnert
1988 — conf
Upper and Lower Bounds for the Dictionary Problem (Abstract).
SWAT
Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert
1986 J jnl
Shortest Paths in the Plane with Convex Polygonal Obstacles.
Inf. Process. Lett.
Hans Rohnert
1985 A conf
A Dynamization of the All Pairs Least Cost Path Problem.
STACS
Hans Rohnert
1982 J jnl
A Probabilistic Algorithm for Vertex Connectivity of Graphs.
Inf. Process. Lett.
Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter