@article{Pak2013TheCO,
title={The complexity of generalized domino tilings},
author={Igor Pak and Jed Yang},
journal={Electr. J. Comb.},
year={2013},
volume={20},
pages={P12}
}

Tiling planar regions with dominoes is a classical problem, where the decision and counting problems are polynomial. We prove a variety of hardness results (both NPand #P-completeness) for different generalizations of dominoes in three and higher dimensions.

Rémila , Tiling a polygon with two kinds of rectangles

É. Rém

Discrete Comput . Geom .

2013

Matching theory

L. Lovász, M. D. Plummer

AMS, Providence, RI

2009

1 Excerpt

Tilère, The dimer model in statistical mechanics, Lecture notes at Swiss Doctoral Program in Mathematics and the EPFL doctoral school, University of Neuchâtel