Ulrich Fößmeier

According to our database1, Ulrich Fößmeier authored at least 15 papers between 1994 and 2000.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results.
Algorithmica, 2000

Orthogonal graph drawing with constraints.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1998
Visualization of Parallel Execution Graphs.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

On Improving Orthogonal Drawings: The 4M-Algorithm.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997
Orthogonale Visualisierungstechniken für Graphen.
PhD thesis, 1997

Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
Discret. Comput. Geom., 1997

Algorithms and Area Bounds for Nonplanar Orthogonal Drawings.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Interactive Orthogonal Graph Drawing: Algorithms and Bounds.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice.
Proceedings of the Algorithms, 1997

On Exact Solutions for the Rectilinear Steiner Tree Problem.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Nice Drawings for Planar Bipartite Graphs.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
2-Visibility Drawings of Planar Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995
Drawing High Degree Graphs with Low Bend Numbers.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994
On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
Proceedings of the Algorithms, 1994


  Loading...