Author:
Durocher Stephane,Mondal Debajyoti
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Benton, A., O’Rourke, J.: Unfolding polyhedra via cut-tree truncation. In: Proc. of CCCG, pp. 77–80 (2007)
2. Lecture Notes in Computer Science;S. Biswas,2010
3. Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane graphs. Algorithmica 47(4), 399–420 (2007)
4. Bose, P.: On embedding an outer-planar graph in a point set. Comput. Geom.: Theory & Appl. 23(3), 303–312 (2002)
5. Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. J. of Graph Algo. & Appl. 10(2), 353–363 (2006)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献