In geometry, a domino tiling of a region in the Euclidean plane is a tessellation of the region by dominos, shapes formed by the union of two unitâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2005

2005

- Therese C. Biedl
- CCCG
- 2005

In this paper, we study the problem of how to tile a layout with dominoes. For non-coloured dominoes, this can be determinedâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Kurt Johansson
- 2002

We investigate certain measures induced by families of non-intersecting paths in domino tilings of the Aztec diamond, rhombusâ€¦Â (More)

Is this relevant?

2001

2001

- Christophe Picouleau
- Theor. Comput. Sci.
- 2001

We are interested in the reconstruction of a domino tiling of a rectangle from its two orthogonal projections. We give polynomialâ€¦Â (More)

Is this relevant?

1999

1999

- James Gary Propp, Richard P. Stanley
- J. Comb. Theory, Ser. A
- 1999

In this paper, we continue the study of domino-tilings of Aztec diamonds. In particular, we look at certain ways of placingâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

1.1. Description of results. A domino is a 1Ã—2 (or 2Ã—1) rectangle, and a tiling of a region by dominos is a way of covering thatâ€¦Â (More)

Is this relevant?

1997

1997

- Michel Latteux, David Simplot-Ryl
- Theor. Comput. Sci.
- 1997

In [2], Giammarresi and Restivo define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over C Uâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Henry Cohn
- 1996

We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond according to theâ€¦Â (More)

Is this relevant?

1996

1996

- Thomas Chaboud
- Theor. Comput. Sci.
- 1996

We prove that Thurstonâ€™s linear-time tiling algorithm can be extended to all planar graphs that have a regular bipartite dualâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

Let G be a finite graph or an infinite graph on which ZZ acts with finite fundamental domain. If G is finite, let T be a randomâ€¦Â (More)

Is this relevant?

1986

1986

- Bogdan S. Chlebus
- J. Comput. Syst. Sci.
- 1986

Games in which players build domino tilings are considered. The computational complexity of problems of existence of winningâ€¦Â (More)

Is this relevant?