A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Sergio Cabello. "Planar embeddability of the vertices of a graph using a fixed point set is NP-hard." Journal of Graph Algorithms and Applications (2006) 353-363