Sergio Cabello. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. J. Graph Algorithms Appl., 10(2):353-363, 2006. [doi]
@article{Cabello06:0,
title = {Planar embeddability of the vertices of a graph using a fixed point set is NP-hard},
author = {Sergio Cabello},
year = {2006},
url = {http://jgaa.info/accepted/2006/Cabello2006.10.2.pdf},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Cabello06%3A0},
cites = {0},
citedby = {0},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {353-363},
}