| 2000 | SODA | Orthogonal graph drawing with constraints. | Markus Eiglsperger, Ulrich Fmeier, Michael Kaufmann |
| 1998 | GD | On Improving Orthogonal Drawings: The 4M-Algorithm. | Ulrich Fmeier, Carsten He, Michael Kaufmann |
| 1998 | GD | Visualization of Parallel Execution Graphs. | Bjrn Steckelbach, Till Bubeck, Ulrich Fmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel |
| 1997 | CIAC | Nice Drawings for Planar Bipartite Graphs. | Ulrich Fmeier, Michael Kaufmann |
| 1997 | ESA | Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. | Ulrich Fmeier, Michael Kaufmann |
| 1997 | GD | Interactive Orthogonal Graph Drawing: Algorithms and Bounds. | Ulrich Fmeier |
| 1997 | GD | Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. | Ulrich Fmeier, Michael Kaufmann |
| 1996 | GD | 2-Visibility Drawings of Planar Graphs. | Ulrich Fmeier, Goos Kant, Michael Kaufmann |
| 1995 | GD | Drawing High Degree Graphs with Low Bend Numbers. | Ulrich Fmeier, Michael Kaufmann |
| 1994 | ESA | Approaching the 5/4-Approximation for Rectilinear Steiner Trees. | Piotr Berman, Ulrich Fmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky |
| 1994 | GD | On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. | Ulrich Fmeier, Michael Kaufmann |
| 1993 | ISAAC | Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. | Ulrich Fmeier, Michael Kaufmann, Alexander Zelikovsky |