L. Adleman, J. Kari, L. Kari, and D. Reishus, On the decidability of self-assembly of infinite ribbons, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.530-537, 2002.
DOI : 10.1109/SFCS.2002.1181977

B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.
DOI : 10.1016/0020-0190(79)90002-4

D. Beauquier, M. Nivat, E. Rémila, and M. Robson, Tiling figures of the plane with two bars, Computational Geometry, vol.5, issue.1, pp.1-25, 1995.
DOI : 10.1016/0925-7721(94)00015-N

R. Berger, The undecidability of the domino problem. Memoirs Amer, Math. Soc, vol.66, 1966.

T. Biedl, The complexity of domino tiling, Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pp.187-190, 2005.

T. Biedl and G. Kant, A better heuristic for orthogonal graph drawings, Computational Geometry, vol.9, issue.3, pp.159-180, 1998.
DOI : 10.1016/S0925-7721(97)00026-6

M. F. Cohen, J. Shade, S. Hiller, and O. Deussen, Wang Tiles for image and texture generation, ACM Transactions on Graphics, vol.22, issue.3, pp.287-294, 2003.
DOI : 10.1145/882262.882265
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.9049

G. Csizmadia, J. Czyzowicz, L. Gasieniec, F. Kranakis, and J. Urrutia, Domino tilings of orthogonal polygons, Canadian Conference on Computational Geometry (CCCG'99), pp.154-157, 1999.

K. Culik, An aperiodic set of 13 Wang tiles, Discrete Mathematics, vol.160, issue.1-3, pp.245-251, 1996.
DOI : 10.1016/S0012-365X(96)00118-5

J. Czyzowicz, E. Kranakis, and J. Urrutia, Domino tilings and two-by-two squares, Canadian Conference on Computational Geometry (CCCG'97, 1997.

S. Hiller, O. Deussen, and A. Keller, Tiled blue noise samples, VMV '01: Proceedings of the Vision Modeling and Visualization Conference, pp.265-272, 2001.

K. Jansen and H. Müller, The minimum broadcast time problem for several processor networks, Theoretical Computer Science, vol.147, issue.1-2, pp.69-85, 1995.
DOI : 10.1016/0304-3975(94)00230-G

J. Kari, Infinite Snake Tiling Problems, Developments in Language Theory, 6th International Conference, pp.67-77, 2002.
DOI : 10.1007/3-540-45005-X_6

C. Kenyon and R. Kenyon, Tiling a polygon with rectangles, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.610-619, 1992.
DOI : 10.1109/SFCS.1992.267790

D. Lichtenstein, Planar Formulae and Their Uses, SIAM Journal on Computing, vol.11, issue.2, pp.329-343, 1982.
DOI : 10.1137/0211025

M. L. Elkies, G. Kuperberg, and J. Propp, Alternating sign matrices and domino tilings, part 1, Journal of Algebraic Combinatorics, vol.1, issue.2, pp.111-132, 1992.
DOI : 10.1023/A:1022420103267

M. L. Elkies, G. Kuperberg, and J. Propp, Alternating sign matrices and domino tilings, part 2, Journal of Algebraic Combinatorics, vol.1, issue.3, pp.219-234, 1992.
DOI : 10.1023/A:1022483817303

J. Propp, A reciprocity theorem for domino tilings, The Electronic Journal of Combinatorics, vol.8, 2001.

W. Thurston, Conway's Tiling Groups, The American Mathematical Monthly, vol.97, issue.8, pp.757-773, 1990.
DOI : 10.2307/2324578

H. Wang, Proving Theorems by Pattern Recognition - II, Bell System Technical Journal, vol.40, issue.1, pp.1-41, 1961.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

C. Worman and M. Watson, Tiling layouts with dominoes, Proceedings of the 16th Canadian Conference on Computational Geometry, pp.86-90, 2004.

C. Worman and B. Yang, On the computation and chromatic number of colored domino tilings, Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pp.188-191, 2005.

C. Worman and B. Yang, On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons, ISAAC, pp.859-868, 2005.
DOI : 10.1007/11602613_86