The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ulrich Fößmeier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ulrich Fößmeier, Michael Kaufmann
    Nice Drawings for Planar Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:122-134 [Conf]
  2. Ulrich Fößmeier, Michael Kaufmann
    On Exact Solutions for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:436-438 [Conf]
  3. Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
    Approaching the 5/4-Approximation for Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:60-71 [Conf]
  4. Ulrich Fößmeier, Michael Kaufmann
    Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:171-185 [Conf]
  5. Ulrich Fößmeier
    Interactive Orthogonal Graph Drawing: Algorithms and Bounds. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:111-123 [Conf]
  6. Ulrich Fößmeier, Carsten Heß, Michael Kaufmann
    On Improving Orthogonal Drawings: The 4M-Algorithm. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:125-137 [Conf]
  7. Ulrich Fößmeier, Michael Kaufmann
    On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:52-63 [Conf]
  8. Ulrich Fößmeier, Michael Kaufmann
    Drawing High Degree Graphs with Low Bend Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:254-266 [Conf]
  9. Ulrich Fößmeier, Michael Kaufmann
    Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:134-145 [Conf]
  10. Ulrich Fößmeier, Goos Kant, Michael Kaufmann
    2-Visibility Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:155-168 [Conf]
  11. Björn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel
    Visualization of Parallel Execution Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:403-412 [Conf]
  12. Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
    Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:533-542 [Conf]
  13. Markus Eiglsperger, Ulrich Fößmeier, Michael Kaufmann
    Orthogonal graph drawing with constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:3-11 [Conf]
  14. Ulrich Fößmeier, Michael Kaufmann
    On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:68-99 [Journal]
  15. Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
    Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:1, pp:93-109 [Journal]

Search in 0.706secs, Finished in 0.707secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002