Hans Rohnert Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys1996
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert: Maintaining a Topological Order Under Edge Insertions. Inf. Process. Lett. 59(1): 53-58 (1996)
1994
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert: On-line Graph Algorithms for Incremental Compilation. WG 1993: 70-86
1992
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRudolf 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
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans Rohnert: Moving a Disc Between Polygons. Algorithmica 6(2): 182-191 (1991)
1988
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans Rohnert: Moving Discs Between Polygons. ICALP 1988: 502-515
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert: Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans Rohnert: Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. Inf. Process. Lett. 27(4): 175-179 (1988)
1986
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans Rohnert: Shortest Paths in the Plane with Convex Polygonal Obstacles. Inf. Process. Lett. 23(2): 71-76 (1986)
1985
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans Rohnert: A Dynamization of the All Pairs Least Cost Path Problem. STACS 1985: 279-286
1982
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)

Coauthor Index

1Michael Becker [1]
2W. Degenhardt [1]
3Martin Dietzfelbinger [5] [7] [11]
4Jürgen Doenhardt [1]
5Rudolf Fleischer [9]
6Otfried Fries [9]
7Friedhelm Meyer auf der Heide [5] [7] [11]
8Stefan Hertel [1]
9Gerd Kaninke [1]
10Anna R. Karlin [7] [11]
11W. Kerber [1]
12Alberto Marchetti-Spaccamela [10] [12]
13Kurt Mehlhorn [1] [5] [7] [9] [11]
14Stefan Meiser [9]
15Stefan Näher [1] [9]
16Umberto Nanni [10] [12]
17Stefan Schirra [9]
18Klaus Simon [9]
19Robert Endre Tarjan [7] [11]
20Athanasios K. Tsakalidis [9]
21Christian Uhrig [9]
22Thomas Winter [1]

Copyright © Fri Nov 13 21:28:18 2009 by Michael Ley (ley@uni-trier.de)