Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Bose, P., Toussaint, G.: Growing a tree from its branches. Journal of Algorithms 19, 86–103 (1995)
2. Hoffmann, M., T???oth, C.S.: Segment endpoint visibility graphs are Hamiltonian. In: Proc. 13th Canadian Conference on Computational Geometry (CCCG 2001), Waterloo (ON), Canada, pp. 109???112 (2001);
3. To appear in Computational Geometry: Theory and Applications (2003)
4. Hosono, K.: On an estimate of the size of the maximum matching for a disjoint family of compact convex sets in the plane. Discrete Appl. Math. 113, 291–298 (2001)
5. Hosono, K., Matsuda, K.: On the perfect matching of disjoint convex sets by line segments. Discrete Appl. Math. 118, 223–238 (2002)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献