Author:
Felsner Stefan,Liotta Giuseppe,Wismath Stephen
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. T. Calamoneri and A. Sterbini. Drawing 2-, 3-, and 4-colorable graphs in o(n 2) volume. In S. North, editor, Graph Drawing (Proc. GD’ 96), volume 1190 of Lecture Notes Comput. Sci., pages 53–62. Springer-Verlag, 1997.
2. T.M. Chan. A near-linear area bound for drawing binary trees. In Proc. 10th Annu. ACM-SIAM Sympos. on Discrete Algorithms., pages 161–168, 1999.
3. M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl., 7(3):211–223, 1997.
4. Marek Chrobak, Michael T. Goodrich, and Roberto Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 319–328, 1996.
5. Marek Chrobak and Shin ichi Nakano. Minimum-width grid drawings of plane graphs. Comput. Geom. Theory Appl., 11:29–54, 1998.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献