1. The complexity of minimizing wire lengths in VLSI layouts;Bhatt;Inform. Process. Lett.,1987
2. P. Bose, G. Di Battista, W. Lenhart and G. Liotta, Proximity constraints and representable trees, in: Graph Drawing, Lecture Notes in Computer Science, Vol. 894 (Springer, Berlin) 328–339.
3. Nice drawings of graphs and trees are computationally hard;Brandenburg,1988
4. Algorithms for drawing graphs: an annotated bibliography;Di Battista,1994
5. G. Di Battista, W. Lenhart and G. Liotta, Proximity drawability: a survey, in: Graph Drawing, Lecture Notes in Computer Science, Vol. 894 (Springer, Berlin) 340–351.