Cabello, Sergio. “Planar Embeddability of the Vertices of a Graph Using a Fixed Point Set Is NP-Hard”. Journal of Graph Algorithms and Applications 10, no. 2 (January 1, 2006): 353–363. Accessed June 30, 2024. https://jgaa.info/index.php/jgaa/article/view/paper132.