Author:
Katz Bastian,Krug Marcus,Rutter Ignaz,Wolff Alexander
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Cabello, S.: 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)
2. Demaine, E.: Simple polygonizations (2007),
http://erikdemaine.org/polygonization/
(Accessed May 30, 2009)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
4. Goaoc, X., Kratochvíl, J., Okamoto, Y., Shin, C.-S., Spillner, A., Wolff, A.: Untangling a planar graph. Discrete Comput. Geom (2009),
http://dx.doi.org/10.1007/s00454-008-9130-6
5. Hurtado, F.: Personal communication (2006)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献