The degree of convexity of a convex polyomino P is the smallest integer k such that any two
cells of P can be joined by a monotone path inside P with at most k changes of direction. In …

We consider the class of hole-free partially directed animals. This is the class of all
polyominoes P such that every cell of P can be reached from any cell in the first column of P …

We describe a method which exploits discrete dynamical systems to generate suitable
classes of polyominoes. We apply the method to design an algorithm that uses O (n) space …

We address the problem of the exhaustive generation of a particular class of polyominoes,
corresponding to partially directed animals with a bounded number of holes. We apply an …