{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:09Z","timestamp":1725560769548},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145520"},{"type":"electronic","value":"9783642145537"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14553-7_14","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T03:59:21Z","timestamp":1280116761000},"page":"124-135","source":"Crossref","is-referenced-by-count":0,"title":["Solving General Lattice Puzzles"],"prefix":"10.1007","author":[{"given":"Gill","family":"Barequet","sequence":"first","affiliation":[]},{"given":"Shahar","family":"Tal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"De Bruijn, N.G.: Programmeren van de pentomino puzzle. Euclides\u00a047, 90\u2013104 (1971\u20131972)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00373-007-0713-4","volume":"23","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graphs and Combinatorics\u00a023(suppl.), 195\u2013208 (2007)","journal-title":"Graphs and Combinatorics"},{"key":"14_CR3","unstructured":"Dudeney, H.E.: 74.\u2014The broken chessboard. In: The Canterbury Puzzles, 90\u201392 (1908)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1145\/365628.365654","volume":"8","author":"J.G. Fletcher","year":"1965","unstructured":"Fletcher, J.G.: A program to solve the pentomino problem by the recursive use of macros. Comm. of the ACM\u00a08, 621\u2013623 (1965)","journal-title":"Comm. of the ACM"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1038\/scientificamerican1257-126","volume":"197","author":"M. Gardner","year":"1957","unstructured":"Gardner, M.: Mathematical games: More about complex dominoes, plus the answers to last month;s puzzles. Scientific American\u00a0197, 126\u2013140 (1957)","journal-title":"Scientific American"},{"key":"14_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"675","DOI":"10.2307\/2307321","volume":"61","author":"S.W. Golomb","year":"1954","unstructured":"Golomb, S.W.: Checkerboards and polyominoes. American Mathematical Monthly\u00a061, 675\u2013682 (1954)","journal-title":"American Mathematical Monthly"},{"key":"14_CR8","unstructured":"Golomb, S.W.: Polyominoes, Scribners, New York (1965); 2nd edn. Princeton University Press, Princeton (1994)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1145\/321296.321300","volume":"12","author":"S.W. Golomb","year":"1965","unstructured":"Golomb, S.W., Baumart, L.D.: Backtrack programming, J. J. of the ACM\u00a012, 516\u2013524 (1965)","journal-title":"J. of the ACM"},{"key":"14_CR10","first-page":"16","volume":"23","author":"C.B. Haselgrove","year":"1960","unstructured":"Haselgrove, C.B., Haselgrove, J.: A computer program for pentominoes. Eureka\u00a023, 16\u201318 (1960)","journal-title":"Eureka"},{"key":"14_CR11","first-page":"229","volume":"7","author":"J. Haselgrove","year":"1974","unstructured":"Haselgrove, J.: Packing a square with Y-pentominoes. J. of Recreational Mathematics\u00a07, 229 (1974)","journal-title":"J. of Recreational Mathematics"},{"key":"14_CR12","first-page":"187","volume-title":"Millennial Perspectives in Computer Science","author":"D.E. Knuth","year":"2000","unstructured":"Knuth, D.E.: Dancing links. In: Davies, J., Roscoe, B., Woodcock, J. (eds.) Millennial Perspectives in Computer Science, pp. 187\u2013214. Palgrave Macmillan, England (2000), \n                  \n                    http:\/\/arxiv.org\/abs\/cs\/0011047"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Lewis, H.R.: Complexity of solvable cases of the decision problem for the predicate calculus. In: 19th Ann. Symp. on Foundations of Computer Science, Ann Arbor, MI, pp. 35\u201347 (1978)","DOI":"10.1109\/SFCS.1978.9"},{"key":"14_CR14","first-page":"215","volume":"6","author":"J. Meeus","year":"1973","unstructured":"Meeus, J.: Some polyomino and polyamond problems. J. of Recreational Mathematics\u00a06, 215\u2013220 (1973)","journal-title":"J. of Recreational Mathematics"},{"key":"14_CR15","unstructured":"Scott, D.S.: Programming a combinatorial puzzle, Technical Report\u00a01, Dept. of Electrical Engineering, Princeton University (June 1958)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14553-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T06:24:41Z","timestamp":1552803881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14553-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145520","9783642145537"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14553-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}