Approaching the 5/4-Approximation for Rectilinear Steiner Trees. - Piotr Berman; Ulrich Fößmeier; Marek Karpinski; Michael Kaufmann 001; Alexander Zelikovsky (ESA, 1994)

On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. - Ulrich Fößmeier; Michael Kaufmann 001 (GD, 1994)

Drawing High Degree Graphs with Low Bend Numbers. - Ulrich Fößmeier; Michael Kaufmann 001 (GD, 1995)

2-Visibility Drawings of Planar Graphs. - Ulrich Fößmeier; Goos Kant; Michael Kaufmann 001 (GD, 1996)

Nice Drawings for Planar Bipartite Graphs. - Ulrich Fößmeier; Michael Kaufmann 001 (CIAC, 1997)

On Exact Solutions for the Rectilinear Steiner Tree Problem. - Ulrich Fößmeier; Michael Kaufmann 001 (SCG, 1997)

Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. - Ulrich Fößmeier; Michael Kaufmann 001 (ESA, 1997)

Interactive Orthogonal Graph Drawing: Algorithms and Bounds. - Ulrich Fößmeier (GD, 1997)

Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. - Ulrich Fößmeier; Michael Kaufmann 001 (GD, 1997)

Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. - Ulrich Fößmeier; Michael Kaufmann 001; Alexander Zelikovsky (Discret. Comput. Geom., 1997)

Orthogonale Visualisierungstechniken für Graphen. - Ulrich Fößmeier (1997)

On Improving Orthogonal Drawings: The 4M-Algorithm. - Ulrich Fößmeier; Carsten Heß; Michael Kaufmann 001 (GD, 1998)

Visualization of Parallel Execution Graphs. - Björn Steckelbach; Till Bubeck; Ulrich Fößmeier; Michael Kaufmann 001; Marcus Ritt; Wolfgang Rosenstiel (GD, 1998)

Orthogonal graph drawing with constraints. - Markus Eiglsperger; Ulrich Fößmeier; Michael Kaufmann 001 (SODA, 2000)

On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results. - Ulrich Fößmeier; Michael Kaufmann 001 (Algorithmica, 2000)