1. H. de Fraysseix, J. Pach, and R. Pollack, “How to draw a planar graph on a grid,” Combinatorica, 10, No. 1, 41–51 (1990).
2. W. Schnyder, “Embedding planar graphs on the grid,” in: 1st ACM-SIAM Sympos. Discrete Algorithms (1990), pp. 138–148.
3. R. Kramer and J. van Leeuwen, “The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits,” in: F. P. Preparata (ed.), Advances in Computing Research, 2, JAI Press (1984), pp. 129–146.
4. M. Formann and F. Wagner, “The VLSI layout problem in various embedding models,” in: R. H. Moehring (ed.), Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, 484, Springer, Berlin, Heidelberg (1990).
5. J. Storer, “On minimal node cost planar embeddings,” Networks, 14, 181–212 (1984).