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