Author:
Biedl Therese,Chan Timothy M.,Derka Martin,Jain Kshitij,Lubiw Anna
Publisher
Springer International Publishing
Reference13 articles.
1. Aichholzer, O., Hackl, T., Scheucher, M.: Planar L-shaped point set embeddings of trees. In: European Workshop on Computational Geometry (EuroCG) (2016). http://www.eurocg2016.usi.ch/
2. Bárány, I., Buchin, K., Hoffmann, M., Liebenau, A.: An improved bound for orthogeodesic point set embeddings of trees. In: European Workshop on Computational Geometry (EuroCG) (2016). http://www.eurocg2016.usi.ch/
3. Bose, P.: On embedding an outer-planar graph in a point set. Comput. Geom. 23(3), 303–312 (2002)
4. Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. J. Graph Algorithms Appl. 1(2), 1–15 (1997)
5. 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)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献