Author:
Garg Ashim,Tamassia Roberto
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. How to draw a series-parallel digraph. Proc. 3rd Scand. Workshop Algorithm Theory, vol. 621 of Lecture Notes in Computer Science, pp. 272–283. Springer-Verlag, 1992.
2. R. P. Brent and H. T. Kung. On the area of binary tree layouts. Inform. Process. Lett., 11:521–534, 1980.
3. P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Comp. Geom. Theory Appl., 2:187–200, 1992.
4. H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary embeddings of planar graphs. Proc. 20th ACM Sympos. Theory Comput., pp. 426–433, 1988.
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Preprint, Dept. Comput. Sci., Brown Univ., Providence, RI, November 1993. To appear in Comput. Geom. Theory Appl. Preliminary version available via anonymous ftp from wilma.cs.brown.edu, gdbiblio. tex.Z and gdbiblio.ps.Z in /pub/papers/compgeo.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献