DOIAbstract
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us design a CAT (Constant Amortized Time) algorithm for generating all convex polyominoes of size n using O(n) space
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us design a CAT (Constant Amortized Time) algorithm for generating all convex polyominoes of size n using O(n) space
We show a decomposition that allows to compute the number of convex polyominoes of area n and degree...
AbstractWe give a new recursion formula for the number of convex polyominoes with fixed perimeter. F...
A convex polyomino P is L-convex if any two cells of P can be joined by a monotone path inside P wit...
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us des...
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors....
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of...
In this paper we present a simple algorithm for computing the degree of convexity of a convex polyom...
In this paper we present an algorithm which has as input a convex polyomino P and computes its degre...
We describe a method which exploits discrete dynamical systems to generate suitable classes of polyo...
The class of 2-polyominoes contains all polyominoes P such that for any integer i, the first i colum...
We show a decomposition that allows to compute the number of convex polyominoes of area n and degree...
AbstractWe give a new recursion formula for the number of convex polyominoes with fixed perimeter. F...
A convex polyomino P is L-convex if any two cells of P can be joined by a monotone path inside P wit...
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us des...
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors....
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of...
In this paper we present a simple algorithm for computing the degree of convexity of a convex polyom...
In this paper we present an algorithm which has as input a convex polyomino P and computes its degre...
We describe a method which exploits discrete dynamical systems to generate suitable classes of polyo...
The class of 2-polyominoes contains all polyominoes P such that for any integer i, the first i colum...
We show a decomposition that allows to compute the number of convex polyominoes of area n and degree...
AbstractWe give a new recursion formula for the number of convex polyominoes with fixed perimeter. F...
A convex polyomino P is L-convex if any two cells of P can be joined by a monotone path inside P wit...
Add to ORKG