Cabello, Sergio. 2006. “Planar Embeddability of the Vertices of a Graph Using a Fixed Point Set Is NP-Hard”. Journal of Graph Algorithms and Applications 10 (2):353-63. https://doi.org/10.7155/jgaa.00132.