Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Lecture Notes in Computer Science;A.A. Benczúr,1999
2. Bespamyatnikh, S.: Computing homotopic shortest paths in the plane. In: Proc. 14th ACM-SIAM Symp. Discrete Algorithms, Baltimore, MD, pp. 609–617 (2003)
3. Demaine, E.D., O’Rourke, J.: Open Problems from CCCG 1999. In: Proc. 11th Canadian Conf. on Comput. Geom., Vancouver, BC (1999)
4. Dilworth, R.: A decomposition theorem for partially ordered sets. Ann. of Maths. 51, 161–166 (1950)
5. Dumitrescu, A., Tóth, G.: Ramsey-type results for unions of comparability graphs. Graphs and Combinatorics 18, 245–251 (2002)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pointed Binary Encompassing Trees;Algorithm Theory - SWAT 2004;2004