1. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Algorithms for Automatic Graph Drawing: An Annotated Bibliography, to appear in Comp. Geom.: Theory and Applications, Preliminary version also available via anonymous ftp from wilma.cs.brown.edu (128.148.33.66), files /pub/gdbiblio.tex.Z and /pub/gdbiblio.ps.Z.
2. G. Di Battista, G. Liotta, and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, In: Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, Springer-Verlag, 1993, pp. 151–162.
3. N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, J. of Computer and System Sciences 30 (1985), pp. 54–76.
4. P.F. Dietz, and D.D. Sleator, Two algorithms for maintaining order in a list, in: Proc. 19th Annual ACM Symp. Theory of Computing, 1987, pp. 365–372.
5. S. Even, and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Manuscript, Faculty of Comp. Science, the Technion, Haifa (Israel), 1993.