{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:18:17Z","timestamp":1725891497268},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303463"},{"type":"electronic","value":"9783642303470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30347-0_21","type":"book-chapter","created":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T02:27:55Z","timestamp":1338431275000},"page":"198-209","source":"Crossref","is-referenced-by-count":0,"title":["M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns"],"prefix":"10.1007","author":[{"given":"Ellen","family":"Gethner","sequence":"first","affiliation":[]},{"given":"David G.","family":"Kirkpatrick","sequence":"additional","affiliation":[]},{"given":"Nicholas J.","family":"Pippenger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","first-page":"72","volume":"66","author":"R. Berger","year":"1966","unstructured":"Berger, R.: The undecidability of the domino problem. Mem. Amer. Math. Soc. No.\u00a066, 72 (1966)","journal-title":"Mem. Amer. Math. Soc. No."},{"key":"21_CR2","series-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci.","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/dimacs\/004\/10","volume-title":"Applied Geometry and Discrete Mathematics","author":"E. Cohen","year":"1991","unstructured":"Cohen, E., Megiddo, N.: Recognizing properties of periodic graphs. In: Applied Geometry and Discrete Mathematics. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol.\u00a04, pp. 135\u2013146. Amer. Math. Soc., Providence (1991)"},{"key":"21_CR3","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A course in computational algebraic number theory","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A course in computational algebraic number theory. Graduate Texts in Mathematics, vol.\u00a0138. Springer, Berlin (1993)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Davis, D.: On a tiling scheme from M. C. Escher. Electron. J. Combin., 4(2): Research Paper 23, approx. 11 (electronic) (1997); The Wilf Festschrift (Philadelphia, PA, 1996)","DOI":"10.37236\/1338"},{"key":"21_CR5","first-page":"9","volume-title":"M.C. Escher: Art and Science","author":"G. Escher","year":"1986","unstructured":"Escher, G.: Potato printing: a game for winter evenings. In: Coxeter, H.S.M., Emmer, M., Penrose, R., Teuber, M. (eds.) M.C. Escher: Art and Science, pp. 9\u201311. North Holland, Amsterdam (1986)"},{"issue":"1","key":"21_CR6","first-page":"1","volume":"10","author":"J. Joseph Fowler","year":"2006","unstructured":"Joseph Fowler, J., Gethner, E.: Counting Escher\u2019s m\u00d7m ribbon patterns. J. Geom. Graph.\u00a010(1), 1\u201313 (2006)","journal-title":"J. Geom. Graph."},{"key":"21_CR7","unstructured":"Gardner, M.: Penrose tiles to trapdoor ciphers. MAA Spectrum. Mathematical Association of America, Washington, DC. \u2026and the return of Dr. Matrix, Revised reprint of the 1989 original (1997)"},{"key":"21_CR8","unstructured":"Gethner, E.: On a generalization of a combinatorial problem posed by M. C. Escher. In: Proceedings of the Thirty-second Southeastern International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, vol.\u00a0153, pp. 77\u201396 (2001)"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ejc.2006.01.015","volume":"28","author":"E. Gethner","year":"2007","unstructured":"Gethner, E., Schattschneider, D., Passiouras, S., Joseph Fowler, J.: Combinatorial enumeration of 2\u00d72 ribbon patterns. European J. Combin.\u00a028(4), 1276\u20131311 (2007)","journal-title":"European J. Combin."},{"key":"21_CR10","first-page":"38","volume":"5","author":"R. Mabry","year":"1996","unstructured":"Mabry, R., Wagon, S., Schattschneider, D.: Automating Escher\u2019s combinatorial patterns. Mathematica in Education and Research\u00a05, 38\u201352 (1996)","journal-title":"Mathematica in Education and Research"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Osborne, H.: The Oxford companion to art. Clarendon P. (1970)","DOI":"10.2307\/1572211"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.2307\/27642932","volume":"79","author":"T. Pisanski","year":"2006","unstructured":"Pisanski, T., Schattschneider, D., Servatius, B.: Applying Burnside\u2019s lemma to a one-dimensional Escher problem. Math. Mag.\u00a079(3), 167\u2013180 (2006)","journal-title":"Math. Mag."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"R.M. Robinson","year":"1971","unstructured":"Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Invent. Math.\u00a012, 177\u2013209 (1971)","journal-title":"Invent. Math."},{"key":"21_CR14","unstructured":"Schattschneider, D., Escher, M.C.: M.C. Escher: visions of symmetry. Harry N. Abrams, Inc. (2004)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Schattschneider, D.: Escher\u2019s combinatorial patterns. Electron. J. Combin. 4(2): Research Paper 17, approx. 31 (electronic) (1997); The Wilf Festschrift (Philadelphia, PA, 1996)","DOI":"10.37236\/1332"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/net.3230090203","volume":"9","author":"M.M. Sys\u0142o","year":"1979","unstructured":"Sys\u0142o, M.M.: On cycle bases of a graph. Networks\u00a09(2), 123\u2013132 (1979)","journal-title":"Networks"},{"key":"21_CR17","series-title":"Lecture Notes in Pure and Appl. Math.","first-page":"331","volume-title":"Complexity, Logic, and Recursion Theory","author":"P. Emde Boas van","year":"1997","unstructured":"van Emde Boas, P.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. Lecture Notes in Pure and Appl. Math., vol.\u00a0187, pp. 331\u2013363. Dekker, New York (1997)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Wang, H.: Notes on a class of tiling problems. VIII, Fundamenta Mathematicae, 82:295305, 1974\/5. Collection of articles dedicated to Andrzej Mostowski on his sixtieth birthday","DOI":"10.4064\/fm-82-4-295-305"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30347-0_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T13:44:58Z","timestamp":1642340698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30347-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303463","9783642303470"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30347-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}