Cabello, Sergio. “Planar Embeddability of the Vertices of a Graph Using a Fixed Point Set Is NP-Hard”. Journal of Graph Algorithms and Applications, vol. 10, no. 2, Jan. 2006, pp. 353-6, doi:10.7155/jgaa.00132.