Enumeration of convex directed polyominoes
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Algorithms for polyominoes based on the discrete Green theorem
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Generating functions for inscribed polyominoes
Discrete Applied Mathematics
Exhaustive generation of gominoes
Theoretical Computer Science
Hi-index | 0.05 |
We develop a number of formulas and generating functions for the enumeration of general polyominoes inscribed in a rectangle of given size according to their area. These formulae are then used for the enumeration of lattice trees inscribed in a rectangle with minimum area plus one.