{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:21:14Z","timestamp":1761805274961},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,13]],"date-time":"2009-11-13T00:00:00Z","timestamp":1258070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10489-009-0200-0","type":"journal-article","created":{"date-parts":[[2009,11,12]],"date-time":"2009-11-12T20:54:47Z","timestamp":1258059287000},"page":"18-31","source":"Crossref","is-referenced-by-count":12,"title":["An efficient algorithm for solving nonograms"],"prefix":"10.1007","volume":"35","author":[{"given":"Chiung-Hsueh","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui-Lung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling-Hwei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,13]]},"reference":[{"key":"200_CR1","unstructured":"Ueda N, Nagao T (1996) NP-completeness results for NONOGRAM via parsimonious reductions. Technical report TR96-0008, Department of Computer Science, Tokyo Institute of Technology, May 1996"},{"key":"200_CR2","unstructured":"McPhail BP (2005) Light up is NP-complete. Feb 2005. http:\/\/www.reed.edu\/~mcphailb\/lightup.pdf"},{"key":"200_CR3","unstructured":"Batenburg KJ (2003) An evolutionary algorithm for discrete tomography. Master thesis in computer science, University of Leiden, The Netherlands"},{"key":"200_CR4","unstructured":"Batenburg KJ, Kosters WA (2004) A discrete tomography approach to Japanese puzzles. Proceedings of BNAIC, pp\u00a0243\u2013250"},{"key":"200_CR5","volume-title":"Foundations of constraint satisfaction","author":"EPK Tsang","year":"1993","unstructured":"Tsang EPK (1993) Foundations of constraint satisfaction. Academic Press, London"},{"key":"200_CR6","unstructured":"Wiggers WA (2004) A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms. Twente student conference on IT, Jun 2004"},{"key":"200_CR7","unstructured":"http:\/\/www.pro.or.jp\/~fuji\/java\/puzzle\/nonogram\/knowhow.html"},{"key":"200_CR8","unstructured":"Database of Japanese puzzles. http:\/\/hattori.m78.com\/puzzle\/picture\/java\/stage_01\/index.html and http:\/\/www.books.com.tw\/exep\/prod\/booksfile.php?item=0010317755"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-009-0200-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-009-0200-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-009-0200-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:43Z","timestamp":1559154343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-009-0200-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,13]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1007\/s10489-009-0200-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,13]]}}}