Exhaustive generation of gominoes
From MaRDI portal
Publication:391401
DOI10.1016/j.tcs.2012.02.032zbMath1301.05064OpenAlexW2010156088WikidataQ60692287 ScholiaQ60692287MaRDI QIDQ391401
Alain Goupil, Jérôme Fortier, Jérôme Tremblay, Jonathan Lortie
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.032
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of polyominoes inscribed in a rectangle
- Tilings by translation: enumeration by a rational language approach
- Counting polyominoes: yet another attack
- On translating one polyomino to tile the plane
- Coding the convex polyominoes and equations for the enumeration according to the area
- New enumerative results on two-dimensional directed animals
- The site-perimeter of bargraphs
- 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
- A method for the enumeration of various classes of column-convex polygons
- Polyominoes with minimum site-perimeter and full set achievement games
- On the number of certain lattice polygons
- Statistics of lattice animals (polyominoes) and polygons
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Checker Boards and Polyominoes
- Enumerations of lattice animals and trees