AbstractThis paper considers the possibility of tiling surfaces using dominoes. Orientable surfaces consisting of unit squares are studied. It presents more generalized discussions than the necessary and sufficient condition given for the multiply connected surfaces on the author's previous paper (Ito, 1996,J. Combin. Theory Ser. A75, No. 2, 173–186)
We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles)....
International audienceWe prove that the boundary of a polycube (finite union of integer unit cubes) ...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
AbstractThis paper considers the possibility of tiling surfaces using dominoes. Orientable surfaces ...
AbstractThis paper considers the possibility of tiling regions using dominoes. Multiply-connected pl...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generali...
AbstractWe prove that the word problem for the group of dominoes is equivalent to the existence of a...
In this paper a way of representing an ordinary partition as a tiling with dominoes and squares is i...
Abstract. This paper reports a work in progress whose aim is to develop a computational framework to...
We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles)....
International audienceWe prove that the boundary of a polycube (finite union of integer unit cubes) ...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
AbstractThis paper considers the possibility of tiling surfaces using dominoes. Orientable surfaces ...
AbstractThis paper considers the possibility of tiling regions using dominoes. Multiply-connected pl...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generali...
AbstractWe prove that the word problem for the group of dominoes is equivalent to the existence of a...
In this paper a way of representing an ordinary partition as a tiling with dominoes and squares is i...
Abstract. This paper reports a work in progress whose aim is to develop a computational framework to...
We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles)....
International audienceWe prove that the boundary of a polycube (finite union of integer unit cubes) ...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
DOI
Add to ORKG