Cabello, S. Planar Embeddability of the Vertices of a Graph Using a Fixed Point Set Is NP-Hard. JGAA 2006, 10, 353-363.