Author:
Föβmeier Ulrich,Kaufmann Michael
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Bertolazzi, P., G. Di Battista, W. Didimo, Computing Orthogonal Drawings with the Minimum Number of Bends, Proc. of WADS'97, to appear.
2. Biedl, T.C., Orthogonal Graph Drawing, Algorithms and Lower Bounds, Diplomarbeit TU Berlin, 1995.
3. Biedl, T.C., M. Kaufmann, Area-Efficient Static and Incremental Drawings of High-Degree Graphs. to appear in ESA 1997.
4. Di Battista, G., P. Eades, R. Tamassia, I.G.Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory & Applications, 235–282,1994.
5. Di Battista, G., A. Garg, G. Liotta, R. Tamassia, E. Tassinari, F. Vargiu, An Experimental Comparison of Three Graph Drawing Algorithms, Computational Geometry: Theory & Applications, 1996.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献