default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Fößmeier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j2]Ulrich Fößmeier, Michael Kaufmann:
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results. Algorithmica 26(1): 68-99 (2000)- [c13]Markus Eiglsperger, Ulrich Fößmeier, Michael Kaufmann:
Orthogonal graph drawing with constraints. SODA 2000: 3-11
1990 – 1999
- 1998
- [c12]Ulrich Fößmeier, Carsten Heß, Michael Kaufmann:
On Improving Orthogonal Drawings: The 4M-Algorithm. GD 1998: 125-137 - [c11]Björn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt
, Wolfgang Rosenstiel:
Visualization of Parallel Execution Graphs. GD 1998: 403-412 - 1997
- [b1]Ulrich Fößmeier:
Orthogonale Visualisierungstechniken für Graphen. Eberhard Karls University of Tübingen, 1997, pp. 1-201 - [j1]Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky:
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. Discret. Comput. Geom. 18(1): 93-109 (1997) - [c10]Ulrich Fößmeier, Michael Kaufmann:
Nice Drawings for Planar Bipartite Graphs. CIAC 1997: 122-134 - [c9]Ulrich Fößmeier, Michael Kaufmann:
On Exact Solutions for the Rectilinear Steiner Tree Problem. SCG 1997: 436-438 - [c8]Ulrich Fößmeier, Michael Kaufmann:
Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. ESA 1997: 171-185 - [c7]Ulrich Fößmeier:
Interactive Orthogonal Graph Drawing: Algorithms and Bounds. GD 1997: 111-123 - [c6]Ulrich Fößmeier, Michael Kaufmann:
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. GD 1997: 134-145 - 1996
- [c5]Ulrich Fößmeier, Goos Kant, Michael Kaufmann:
2-Visibility Drawings of Planar Graphs. GD 1996: 155-168 - 1995
- [c4]Ulrich Fößmeier, Michael Kaufmann:
Drawing High Degree Graphs with Low Bend Numbers. GD 1995: 254-266 - 1994
- [c3]Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky:
Approaching the 5/4-Approximation for Rectilinear Steiner Trees. ESA 1994: 60-71 - [c2]Ulrich Fößmeier, Michael Kaufmann:
On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. GD 1994: 52-63 - 1993
- [c1]Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky:
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. ISAAC 1993: 533-542
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-04-25 05:59 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:
