Author:
Aichholzer Oswin,Hackl Thomas,Hoffmann Michael,Pilz Alexander,Rote Günter,Speckmann Bettina,Vogtenhuber Birgit
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Vogtenhuber, B.: Large bichromatic point sets admit empty monochromatic 4-gons (submitted) (2008)
2. Aichholzer, O., Krasser, H.: The point set order type data base: A collection of applications and results. In: Proc. 13th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, pp. 17–20 (2001)
3. Bose, P.: On embedding an outer-planar graph in a point set. Computational Geometry: Theory and Applications 23(3), 303–312 (2002)
4. Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications 1(2), 1–15 (1997)
5. Colbourn, C., Booth, K.: Linear time automorphism algorithms for trees, interval graphs, and planar graphs. SIAM Journal on Computing 10(1), 203–225 (1981)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献