UNIFORM PLANAR EMBEDDING IS NP-COMPLETE*

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Jaroslav Opatrny,et al.  Total Ordering Problem , 1979, SIAM J. Comput..

[3]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[4]  Malgorzata Marek-Sadowska,et al.  Single-Layer Routing for VLSI: Analysis and Algorithms , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Walter Unger,et al.  On the k-Colouring of Circle-Graphs , 1988, STACS.

[6]  Thomas Lengauer,et al.  Hierarchical Planary Testing Algorithms , 1986, ICALP.