%0 Journal Article
%A Sergio Cabello
%T Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
%J Journal of Graph Algorithms and Applications
%D 2006
%P 353-363
%V 10
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00132/
%R 10.7155/jgaa.00132
%G en
%F JGAA_2006_10_2_a12