Author:
Kornaropoulos Evgenios M.,Tollis Ioannis G.
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers 49(8), 826–840 (2000)
2. Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications 9(3), 159–180 (1998)
3. Biedl, T.C., Madden, B.P., Tollis, I.G.: The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. Int. J. Comput. Geometry Appl. 10(6), 553–580 (2000)
4. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of graphs. Prentice - Hall, New Jersey (1998)
5. Di Battista, G., Tamassia, R., Tollis, I.G.: Area Requirement and Symmetry Display of Planar Upward Drawings. Discrete and Comput. Geom. 7(4), 381–401 (1992)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Planar L-Drawings of Directed Graphs;Lecture Notes in Computer Science;2018
2. HD-GDD: high dimensional graph dominance drawing approach for reachability query;World Wide Web;2016-09-03
3. L-Drawings of Directed Graphs;Lecture Notes in Computer Science;2016
4. Rook-Drawing for Plane Graphs;Lecture Notes in Computer Science;2015
5. Graph Drawing;Computing Handbook, Third Edition;2014-05-08