1. Demaine, E.D., Demaine, M.L.: Jigsaw Puzzles, Edge Matching, and Polyonymo Packing: Connections and Complexity. Graphs and Combinatorics 23, 195–208 (2007)
2. Berger, R.: The Undecidability of the Domino Problem. Memoirs of the American Mathematical Society 66 (1966)
3. Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: Computers and Intractability: A Guide to the Theory of NP-completeness, p. 257. W.H. Freeman & Co., New York (1979)
4. Savelsberg, M.P.W., van Emde Boas, P.: BOUNDED TILING, an Alternative to SATISFIABILITY? In: Proceedings 2nd Frege Conference, vol. 20, pp. 354–363. Akademie Verlag, Schwerin (1984)
5. Chlebus, B.S.: Domino-Tiling Games. Journal of Computer and System Sciences 32, 374–392 (1986)