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 extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of ...
International audienceThe Domino Problem on Z² asks if it is possible to tile the plane with a given...
AbstractWe prove that Thurston's linear-time tiling algorithm can be extended to all planar graphs t...
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...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (dom...
AbstractWe consider the problem of tiling with dominoes pictures of the plane, in theoretical and al...
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
AbstractWe prove that the word problem for the group of dominoes is equivalent to the existence of a...
AbstractIn this paper we study the problem of reconstructing a bicolored domino tiling of a rectangu...
International audienceThe Domino Problem on Z² asks if it is possible to tile the plane with a given...
Tilings over the plane are analysed in this work, making a special focus on the Aztec Diamond Theore...
We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of ...
International audienceThe Domino Problem on Z² asks if it is possible to tile the plane with a given...
AbstractWe prove that Thurston's linear-time tiling algorithm can be extended to all planar graphs t...
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...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (dom...
AbstractWe consider the problem of tiling with dominoes pictures of the plane, in theoretical and al...
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
AbstractWe prove that the word problem for the group of dominoes is equivalent to the existence of a...
AbstractIn this paper we study the problem of reconstructing a bicolored domino tiling of a rectangu...
International audienceThe Domino Problem on Z² asks if it is possible to tile the plane with a given...
Tilings over the plane are analysed in this work, making a special focus on the Aztec Diamond Theore...
We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of ...
International audienceThe Domino Problem on Z² asks if it is possible to tile the plane with a given...
AbstractWe prove that Thurston's linear-time tiling algorithm can be extended to all planar graphs t...
DOI
Add to ORKG