1. S. Bhatt and S. Cosmadakis. The Complexity of Minimizing Wire Lengths in VLSI Layouts. Information Processing Letters, 25, 1987, pp. 263–267.
2. P. Bose, W. Lenhart, and G. Liotta. Characterizing Proximity Trees. Algorithmica, Special Issue on Graph Drawing (to appear).
3. P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity Constraints and Representable Trees. Graph Drawing, Proc. of the DIMACS International Workshop GD94, New Jersey, USA, October 1994, LNCS 894, R. Tamassia and I.G. Tollis eds., Springer-Verlag, 1995, pp. 340–351.
4. G. Di Battista, W. Lenhart, and G. Liotta. Proximity Drawability: a Survey. Graph Drawing, Proc. of the DIMACS International Workshop GD94, New Jersey, USA, October 1994, LNCS 894, R. Tamassia and I.G. Tollis eds., Springer-Verlag, 1995, pp. 328–339.
5. G. Di Battista, R. Tamassia, and I. G. Tollis. Area Requirement and Symmetry Display of Planar Upward Drawings. Discr. and Comp. Geometry, 7, 1992, pp. 381–401.