Cabello S. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. JGAA [Internet]. 2006 Jan. 1 [cited 2024 Jul. 6];10(2):353-6. Available from: http://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper132