1. J. Bhasker and S. Sahni, A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Networks 17, 1987, pp. 307–317.
2. J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica 3, 1988, pp. 247–278.
3. N. Chiba, T. Yamanouchi, and T. Nishizeki, Linear algorithms for convex drawings of planar graphs, in Progress in Graph Theory, 1982, pp. 153–173.
4. M. Chrobak and T. H. Payne, A linear time algorithm for drawing planar graphs on a grid, TR. UCR-CS-90-2, Dept. of Math. and CS., Univ. of Calif. at Riverside.
5. P. Eades and R. Tamassia, Algorithms for automatic graph drawing: an annotated bibliography, TR., Dept. of Comp. Sci., Brown Univ., 1993.