TY  - JOUR
AU  - Sergio Cabello
TI  - Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
JO  - Journal of Graph Algorithms and Applications
PY  - 2006
SP  - 353
EP  - 363
VL  - 10
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00132/
DO  - 10.7155/jgaa.00132
LA  - en
ID  - JGAA_2006_10_2_a12
ER  -