Cabello, S. (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), pp. 353–363. doi: 10.7155/jgaa.00132.