Among the very many research interests of Maurice Nivat, a special role, according to the
produced literature, was played by the study of the algorithmic and combinatorial aspects of …

LNCS 8466 - An Efficient Algorithm for the Generation of Z-Convex Polyominoes Page 1 An
Efficient Algorithm for the Generation of Z-Convex Polyominoes ⋆ Giusi Castiglione1 and Paolo …

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 …

Finding the maximum common subgraph of a pair of given graphs is a well-known task in
theoretical computer science and with considerable practical applications, for example, in …

In this paper we present an algorithm which has as input a convex polyomino $ P $ and
computes its degree of convexity, defined as the smallest integer $ k $ such that any two …

The notion of a pattern within a binary picture (polyomino) has been introduced and studied
in [3], and resembles the notion of pattern containment within permutations. The main goal of …

A polyomino is said to be L-convex if any two of its cells are connected by a 4-connected
inner path that changes direction at most once. The 2-dimensional language representing …

Several papers in the available literature tackled problems concerning convex polyominoes
in discrete tomography. An interesting subclass consists of L-convex polyominoes, since the …