Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference16 articles.
1. Ajtai, M., Chvátal, V., Newborn, M.M., Szemerédi, E.: Crossing-free subgraphs. In: Turgeon, J., Rosa, A., Sabidussi, G. (eds.) Theory and Practice of Combinatorics. North-Holland Mathematical Studies, vol. 60, pp. 9–12. North-Holland, Amsterdam (1982)
2. Alvarez, V., Seidel, R.: A simple aggregative algorithm for counting triangulations of planar point sets and related problems. In: Computational Geometry (SoCG’13), pp. 1–8. ACM, New York (2013)
3. Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)
4. Frati, F., Gudmundsson, J., Welzl, E.: On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. 544, 32–59 (2014)
5. Górska, K., Karol, A.: Multidimensional Catalan and related numbers as Hausdorff moments. Probab. Math. Stat. 33(2), 265–274 (2013)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献