Funder
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference22 articles.
1. Aleksandrowicz G, Barequet G (2009) Counting
$$d$$
d
-dimensional polycubes and nonrectangular planar polyominoes. Int J Comput Geom Appl 19:215–229
2. Barequet G, Rote G, Shalah M (unpublished) An improved upper bound on the growth constant of polyiamonds. In: Preliminary version: proceedings of the 32nd European workshop on computational geometry, Lugano, Switzerland, pp 67–70
3. Barequet G, Rote G, Shalah M (2016)
$$\lambda >4$$
λ
>
4
: an improved lower bound on the growth constant of polyominoes. Commun ACM 59:88–95
4. Barequet G, Shalah M, Zheng Y (2017) An improved lower bound on the growth constant of polyiamonds. In: Lecture notes in computer science 10392, 23rd annual international computing and combinatorics conference, Hong Kong, China, pp 50–61
5. Broadbent SR, Hammersley JM (1957) Percolation processes: I. Crystals and mazes. Proc Camb Philos Soc 53:629–641
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献