1. Cui S. F. and Liu Y. P., Efficient algorithms for rectilinear extensions of standard graphs.Acta Math. Appl. Sinica (in Chinese), to appear.
2. Hu T. C. and Kuh, S. E., Theory and concepts of circuit layout in VLSI circuit design: Theory and Design,IEEE Press, 1985, 3–18.
3. Jaumard, B., Marchioro, P., Morgana, A., Petreschi, R., and Simeone, B., On-line 2-satisfiability.Ann. Math. Artificial Intel., 1 (1990), 155–165.
4. Lipton, R. J. and Tarjan, R. E., A separator theorem for planar graphs,SIAM J. Appl. Math.,36 (1979), 177–189.
5. Liu, Y. P., Marchioro, P., and Petreschi, P., At most single-bend embeddings of cubic graphs. Reserch Report 002, Inst., Appl. Math. Academia Sinica, 1992, and SI 92/01. Dept. Comp. Sa., University “La Saprenza” of Rome, 1992.