Author:
Bridgeman Stina S.,Fanto Jody,Garg Ashim,Tamassia Roberto,Vismara Luca
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. T. C. Biedl and M. Kaufmann. Area-efficient static and incremental graph darwings. In R. Burkard and G. Woeginger, editors, Algorithms (Proc. ESA '97), volume 1284 of Lecture Notes Comput. Sci., pages 37–52. Springer-Verlag, 1997.
2. R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput., 24(5):970–1001, 1995.
3. P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24–33, 1991.
4. W. He and K. Marriott. Constrained graph layout. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 217–232. Springer-Verlag, 1997.
5. K. Mehlhorn and S. Näher. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38:96–102, 1995.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Approach to Automatic Layout of Eclipse Papyrus Class Diagrams;2019 27th Telecommunications Forum (TELFOR);2019-11
2. Incremental diagram layout for automated model migration;Proceedings of the ACM/IEEE 19th International Conference on Model Driven Engineering Languages and Systems;2016-10-02
3. Graph Drawing;Computing Handbook, Third Edition;2014-05-08
4. Graph Compact Orthogonal Layout Algorithm;Lecture Notes in Computer Science;2014
5. Dunnart: A Constraint-Based Network Diagram Authoring Tool;Graph Drawing;2009