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 (Jan. 2006), 353–363. DOI:https://doi.org/10.7155/jgaa.00132.