{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:50:56Z","timestamp":1778817056459,"version":"3.51.4"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1007\/bf01228510","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T19:18:45Z","timestamp":1109359125000},"page":"382-397","source":"Crossref","is-referenced-by-count":36,"title":["Tiling a polygon with parallelograms"],"prefix":"10.1007","volume":"9","author":[{"given":"Richard","family":"Kenyon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Memoirs of the American Mathematical Society, No. 66","author":"R. Berger","year":"1966","unstructured":"R. Berger.The Undecidability of the Domino Problem. Memoirs of the American Mathematical Society, No. 66. AMS, Providence, RI, 1966."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"B. Chazelle. Triangulating a simple polygon in linear time.Proceedings of the 31st Annual Symposium on the Foundations of Computer Science, 1990, pp. 220?230.","DOI":"10.1109\/FSCS.1990.89541"},{"key":"CR3","unstructured":"M. S. Garey, D. S. Johnson, and C. H. Papadimitriou, unpublished results, 1977."},{"key":"CR4","unstructured":"S. Kannan and D. Soroker. Tiling polygons with parallelograms. Preprint, IBM."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems, inComplexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.). Plenum, New York, 1972, pp. 85?103."},{"key":"CR6","unstructured":"R. Kenyon. Self-Similar Tilings. Thesis, Princeton University, 1990."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"J. Robinson","year":"1971","unstructured":"J. Robinson. Undecidability and non-periodicity of tilings in the plane.Invent. Math.,12 (1971), 177?209.","journal-title":"Invent. Math."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"W. P. Thurston. Conway's tiling groups.Amer. Math. Monthly, October 1990, pp. 757?773.","DOI":"10.1080\/00029890.1990.11995660"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01228510.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01228510\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01228510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:01:00Z","timestamp":1556625660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01228510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["BF01228510"],"URL":"https:\/\/doi.org\/10.1007\/bf01228510","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}