Author:
Buchin Kevin,Knauer Christian,Kriegel Klaus,Schulz André,Seidel Raimund
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Alt, H., Fuchs, U., Kriegel, K.: On the number of simple cycles in planar graphs. Combinatorics, Probability & Computing 8(5), 397–405 (1999)
2. Sharir, M., Welzl, E.: On the number of crossing-free matchings (cycles, and partitions). In: Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pp. 860–869. ACM Press, New York (2006)
3. Sharir, M., Welzl, E.: Random triangulations of planar point sets. In: 22nd Annu. ACM Sympos. Comput. Geom., pp. 273–281. ACM Press, New York (2006)
4. Barequet, G., Moffie, M.: The complexity of Jensen’s algorithm for counting polyominoes. In: Proc. 1st Workshop on Analytic Algorithmics and Combinatorics, pp. 161–169 (2004)
5. Conway, A., Guttmann, A.: On two-dimensional percolation. J. Phys. A: Math. Gen. 28(4), 891–904 (1995)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Monotone Paths in Geometric Triangulations;Theory of Computing Systems;2018-02-28
2. Convex Polygons in Geometric Triangulations;Combinatorics, Probability and Computing;2017-05-30
3. Monotone Paths in Geometric Triangulations;Lecture Notes in Computer Science;2016
4. Counting Carambolas;Graphs and Combinatorics;2015-09-02
5. Convex Polygons in Geometric Triangulations;Lecture Notes in Computer Science;2015