default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Rohnert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
[j6]Alberto Marchetti-Spaccamela
, Umberto Nanni, Hans Rohnert:
Maintaining a Topological Order Under Edge Insertions. Inf. Process. Lett. 59(1): 53-58 (1996)- 1994
- [j5]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
- [c6]Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert:
On-line Graph Algorithms for Incremental Compilation. WG 1993: 70-86 - 1992
- [c5]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
- [j4]Hans Rohnert:
Moving a Disc Between Polygons. Algorithmica 6(2): 182-191 (1991)
1980 – 1989
- 1989
- [b1]Hans Rohnert:
Bewegungsplanung in der Ebene. Saarland University, Saarbrücken, Germany, 1989, pp. 1-84 - 1988
- [j3]Hans Rohnert:
Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. Inf. Process. Lett. 27(4): 175-179 (1988) - [c4]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 - [c3]Hans Rohnert:
Moving Discs Between Polygons. ICALP 1988: 502-515 - [c2]Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert:
Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215 - 1986
- [j2]Hans Rohnert:
Shortest Paths in the Plane with Convex Polygonal Obstacles. Inf. Process. Lett. 23(2): 71-76 (1986) - 1985
- [c1]Hans Rohnert:
A Dynamization of the All Pairs Least Cost Path Problem. STACS 1985: 279-286 - 1982
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
