From Tetris to polyominoes generation
type: Item
instance of: scholarly article
title: From Tetris to polyominoes generation
zbMATH Open document ID: 1427.05049
author: Enrico Formenti
author: P. Massazza
publication date: 2018-01-04T00:00:00Z
Mathematics Subject Classification ID: 05B50
zbMATH DE Number: 6821886
zbMATH Keywords: polyomino
zbMATH Keywords: exhaustive generation
zbMATH Keywords: CAT algorithm
MaRDI profile type: Publication
full work available at URL: j.endm.2017.05.007
OpenAlex ID: W2623559693
cites work: A method for the enumeration of various classes of column-convex polygons
cites work: On the exhaustive generation of \(k\)-convex polyominoes
cites work: An Efficient Algorithm for the Generation of Z-Convex Polyominoes
cites work: Reconstruction of L-convex Polyominoes
cites work: On the generation and enumeration of some classes of convex polyominoes
cites work: Algebraic languages and polyominoes enumeration
cites work: The number of Z-convex polyominoes
cites work: Checker Boards and Polyominoes
cites work: Enumerations of lattice animals and trees
cites work: Statistics of lattice animals (polyominoes) and polygons
cites work: From Linear Partitions to Parallelogram Polyominoes
cites work: On the generation of convex polyominoes
DOI: 10.1016/J.ENDM.2017.05.007
description: scientific article; zbMATH DE number 6821886