Publication date
January 2022
DOIAbstract
We show a decomposition that allows to compute the number of convex polyominoes of area n and degree of convexity at most 2 (the so-called Z-convex polyominoes) in polynomial time
We show a decomposition that allows to compute the number of convex polyominoes of area n and degree of convexity at most 2 (the so-called Z-convex polyominoes) in polynomial time
A permutomino of size n is a polyomino determined by particular pairs of permutations of n. Here we...
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us des...
A permutomino of size n is a polyomino determined by particular pairs (1, 2) of permutations of n. H...
We show a decomposition that allows to compute the number of convex polyominoes of area n and degree...
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors....
In this paper we consider a restricted class of polyominoes that we call Z-convex polyominoes. Z-con...
In this paper we present a simple algorithm for computing the degree of convexity of a convex polyom...
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 an algorithm which has as input a convex polyomino P and computes its degre...
A convex polyomino P is L-convex if any two cells of P can be joined by a monotone path inside P wit...
A permutomino of size n is a polyomino determined by particular pairs of permutations of n. Here we...
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us des...
A permutomino of size n is a polyomino determined by particular pairs (1, 2) of permutations of n. H...
We show a decomposition that allows to compute the number of convex polyominoes of area n and degree...
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors....
In this paper we consider a restricted class of polyominoes that we call Z-convex polyominoes. Z-con...
In this paper we present a simple algorithm for computing the degree of convexity of a convex polyom...
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 an algorithm which has as input a convex polyomino P and computes its degre...
A convex polyomino P is L-convex if any two cells of P can be joined by a monotone path inside P wit...
A permutomino of size n is a polyomino determined by particular pairs of permutations of n. Here we...
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us des...
A permutomino of size n is a polyomino determined by particular pairs (1, 2) of permutations of n. H...
Add to ORKG