{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:28Z","timestamp":1750307248580,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,3]],"date-time":"2012-07-03T00:00:00Z","timestamp":1341273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,7,3]]},"DOI":"10.1145\/2325296.2325312","type":"proceedings-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T16:41:12Z","timestamp":1341938472000},"page":"52-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Digging for algorithmic nuggets in the land of polyominoes"],"prefix":"10.1145","author":[{"given":"Anany","family":"Levitin","sequence":"first","affiliation":[{"name":"Villanova University, Villanova, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7,3]]},"reference":[{"issue":"1","key":"e_1_3_2_1_1_1","first-page":"41","volume":"14","author":"Breukelaar R.","unstructured":"Breukelaar , R. Tetris is hard, even to approximate. International Journal of Computational Geometry and Applications , 14 ( 1 ), 41 -- 68 . Breukelaar, R. et al. Tetris is hard, even to approximate. International Journal of Computational Geometry and Applications, 14 (1), 41--68.","journal-title":"Tetris is hard, even to approximate. International Journal of Computational Geometry and Applications"},{"volume-title":"Can You Win in Tetris? Thesis","author":"Brzustowski J.","unstructured":"Brzustowski , J. 1992. Can You Win in Tetris? Thesis . University of British Columbia . Brzustowski, J. 1992. Can You Win in Tetris? Thesis. University of British Columbia.","key":"e_1_3_2_1_2_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/31726.31770"},{"key":"e_1_3_2_1_4_1","volume-title":"The Canterbury Puzzles","author":"Dudeney H. E.","year":"2002","unstructured":"Dudeney , H. E. The Canterbury Puzzles . Dover Publishing , 2002 . Dudeney, H. E. The Canterbury Puzzles. Dover Publishing, 2002."},{"key":"e_1_3_2_1_5_1","volume-title":"Martin Gardner's Mathematical Games (CD-ROM)","author":"Gardner M.","year":"2005","unstructured":"Gardner , M. Martin Gardner's Mathematical Games (CD-ROM) . Mathematical Association of America , 2005 . Gardner, M. Martin Gardner's Mathematical Games (CD-ROM). Mathematical Association of America, 2005."},{"key":"e_1_3_2_1_6_1","volume-title":"Patterns, Problems, and Packings","author":"Golomb S. W.","year":"1994","unstructured":"Golomb , S. W. Polyominoes: Puzzles , Patterns, Problems, and Packings . 2 nd edition. Princeton University Press , 1994 . Golomb, S. W. Polyominoes: Puzzles, Patterns, Problems, and Packings. 2nd edition. Princeton University Press, 1994.","edition":"2"},{"key":"e_1_3_2_1_7_1","volume-title":"Easier Fibonacci Puzzles page","author":"Knott R.","year":"2007","unstructured":"Knott , R. Easier Fibonacci Puzzles page , 2007 . http:\/\/www.mcs.surrey.ac.uk\/Personal\/R.Knott\/Fibonacci\/fibpuzzles.html (retrieved January 3, 2012) Knott, R. Easier Fibonacci Puzzles page, 2007. http:\/\/www.mcs.surrey.ac.uk\/Personal\/R.Knott\/Fibonacci\/fibpuzzles.html (retrieved January 3, 2012)"},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to the Design and Analysis of Algorithms","author":"Levitin A.","year":"2012","unstructured":"Levitin , A. Introduction to the Design and Analysis of Algorithms , 3 rd edition. Pearson , 2012 . Levitin, A. Introduction to the Design and Analysis of Algorithms, 3rd edition. Pearson, 2012.","edition":"3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199740444.001.0001","volume-title":"Algorithmic Puzzles","author":"Levitin A.","year":"2011","unstructured":"Levitin , A. , and Levitin M . Algorithmic Puzzles . Oxford University Press , 2011 . Levitin, A., and Levitin M. Algorithmic Puzzles. Oxford University Press, 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1090\/spec\/015","volume-title":"Polyominoes: A Guide to Puzzles and Problems in Tiling","author":"Martin G. E.","year":"1996","unstructured":"Martin , G. E. Polyominoes: A Guide to Puzzles and Problems in Tiling . The Mathematical Association of America , 1996 . Martin, G. E. Polyominoes: A Guide to Puzzles and Problems in Tiling. The Mathematical Association of America, 1996."},{"key":"e_1_3_2_1_11_1","volume-title":"Games of No Chance. MSRI","author":"Orman H. K.","year":"1994","unstructured":"Orman , H. K. Pentominoes : a first player win. In Nowakowski, R. J., ed . Games of No Chance. MSRI , 1994 . 339--344. Orman, H. K. Pentominoes: a first player win. In Nowakowski, R. J., ed. Games of No Chance. MSRI, 1994. 339--344."},{"key":"e_1_3_2_1_12_1","volume-title":"Discrete Mathematics and Its Applications","author":"Rosen K. H.","year":"2011","unstructured":"Rosen , K. H. Discrete Mathematics and Its Applications , 7 th edition. McGraw-Hill , 2011 . Rosen, K. H. Discrete Mathematics and Its Applications, 7th edition. McGraw-Hill, 2011.","edition":"7"}],"event":{"sponsor":["Bilkent University Bilkent University","SIGCSE ACM Special Interest Group on Computer Science Education"],"acronym":"ITiCSE '12","name":"ITiCSE '12: Annual Conference on Innovation and Technology in Computer Science Education","location":"Haifa Israel"},"container-title":["Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2325296.2325312","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2325296.2325312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:10Z","timestamp":1750243930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2325296.2325312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,3]]},"references-count":12,"alternative-id":["10.1145\/2325296.2325312","10.1145\/2325296"],"URL":"https:\/\/doi.org\/10.1145\/2325296.2325312","relation":{},"subject":[],"published":{"date-parts":[[2012,7,3]]},"assertion":[{"value":"2012-07-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}