A Dynamical System Approach to Polyominoes Generation*
From MaRDI portal
Publication:5164875
DOI10.3233/FI-2021-2040OpenAlexW3175349341MaRDI QIDQ5164875
Publication date: 15 November 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2040
Uses Software
Cites Work
- On the exhaustive generation of \(k\)-convex polyominoes
- On the generation of 2-polyominoes
- Directed animals, forests and permutations
- A pattern theorem for lattice clusters
- Algebraic languages and polyominoes enumeration
- From Tetris to polyominoes generation
- On the generation and enumeration of some classes of convex polyominoes
- A method for the enumeration of various classes of column-convex polygons
- On the generation of convex polyominoes
- Hole-free partially directed animals
- The number of Z-convex polyominoes
- Reconstruction of L-convex Polyominoes
- Statistics of lattice animals (polyominoes) and polygons
- From Linear Partitions to Parallelogram Polyominoes
- An Efficient Algorithm for the Generation of Z-Convex Polyominoes
- Cell Growth Problems
- Checker Boards and Polyominoes
- Improved upper bounds on the growth constants of polyominoes and polycubes
- Enumerations of lattice animals and trees
This page was built for publication: A Dynamical System Approach to Polyominoes Generation*
