S. Cabello, “Planar embeddability of the vertices of a graph using a fixed point set is NP-hard”, JGAA, vol. 10, no. 2, pp. 353–363, Jan. 2006.