Hans Rohnert

According to our database1, Hans Rohnert authored at least 12 papers between 1982 and 1996.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1996
Maintaining a Topological Order Under Edge Insertions.
Inf. Process. Lett., 1996

1994
Dynamic Perfect Hashing: Upper and Lower Bounds.
SIAM J. Comput., 1994

1993
On-line Graph Algorithms for Incremental Compilation.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
Moving a Disc Between Polygons.
Algorithmica, 1991

1989
Bewegungsplanung in der Ebene.
PhD thesis, 1989

1988
Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons.
Inf. Process. Lett., 1988

Upper and Lower Bounds for the Dictionary Problem (Abstract).
Proceedings of the SWAT 88, 1988

Moving Discs Between Polygons.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1986
Shortest Paths in the Plane with Convex Polygonal Obstacles.
Inf. Process. Lett., 1986

1985
A Dynamization of the All Pairs Least Cost Path Problem.
Proceedings of the STACS 85, 1985

1982
A Probabilistic Algorithm for Vertex Connectivity of Graphs.
Inf. Process. Lett., 1982


  Loading...