Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Aichholzer, O.: The path of a triangulation. In: Proc.15th Ann. ACM Symp. on Computational Geometry, pp. 14–23. ACM Press, New York (1999)
2. Aichholzer, O., Hackl, T., Krasser, H., Huemer, C., Hurtado, F., Vogtenhuber, B.: On the number of plane graphs. In: Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 504–513. ACM Press, New York (2006)
3. Ajtai, M., Chvátal, V., Newborn, M.M., Szemerédi, E.: Crossing-free subgraphs. Annals Discrete Math. 12, 9–12 (1982)
4. Anclin, E.E.: An upper bound for the number of planar lattice triangulations. J.Combinat.Theory,Ser.A 103, 383–386 (2003)
5. Avisand, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21–46 (1996)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献