{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:10:21Z","timestamp":1725556221899},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131219"},{"type":"electronic","value":"9783642131226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13122-6_30","type":"book-chapter","created":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T09:26:31Z","timestamp":1274347591000},"page":"307-318","source":"Crossref","is-referenced-by-count":6,"title":["The Complexity of Flood Filling Games"],"prefix":"10.1007","author":[{"given":"David","family":"Arthur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rapha\u00ebl","family":"Clifford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Jalsenius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashley","family":"Montanaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Sach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Arthur, D., Clifford, R., Jalsenius, M., Montanaro, A., Sach, B.: The complexity of flood filling games (2010), \n                  \n                    http:\/\/arxiv.org\/abs\/1001.4420"},{"key":"30_CR2","series-title":"MSRI Publications","first-page":"389","volume-title":"More games of no chance","author":"T.C. Biedl","year":"2002","unstructured":"Biedl, T.C., Demaine, E.D., Demaine, M.L., Fleischer, R., Jacobsen, L., Munro, J.I.: The complexity of Clickomania. In: More games of no chance. MSRI Publications, vol.\u00a042, pp. 389\u2013404. Cambridge University Press, Cambridge (2002)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. In: Computing and Combinatorics, pp. 351\u2013363 (2003)","DOI":"10.1007\/3-540-45071-8_36"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/s00224-008-9117-y","volume":"44","author":"K. Iwama","year":"2009","unstructured":"Iwama, K., Miyano, E., Ono, H.: Drawing Borders Efficiently. Theory of Computing Systems\u00a044(2), 230\u2013244 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Li, M.: On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal of Computing\u00a024(5), 1122\u20131139 (1995)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF03025367","volume":"22","author":"R. Kaye","year":"2000","unstructured":"Kaye, R.: Minesweeper is NP-complete. The Mathematical Intelligencer\u00a022(2), 9\u201315 (2000)","journal-title":"The Mathematical Intelligencer"},{"key":"30_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4132-4","volume-title":"The Self-Avoiding Walk","author":"N. Madras","year":"1996","unstructured":"Madras, N., Slade, G.: The Self-Avoiding Walk. Birkh\u00e4user, Basel (1996)"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM\u00a025(2), 322\u2013336 (1978)","journal-title":"Journal of the ACM"},{"key":"30_CR9","first-page":"133","volume-title":"Infectious Disease Modelling Research Progress","author":"P. Munz","year":"2009","unstructured":"Munz, P., Hudea, I., Imad, J., Smith, R.J.: When zombies attack!: Mathematical modelling of an outbreak of zombie infection. In: Infectious Disease Modelling Research Progress, pp. 133\u2013150. Nova Science, Bombay (2009)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","volume":"16","author":"K.-J. R\u00e4ih\u00e4","year":"1981","unstructured":"R\u00e4ih\u00e4, K.-J., Ukkonen, E.: The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science\u00a016, 187\u2013198 (1981)","journal-title":"Theoretical Computer Science"},{"key":"30_CR11","unstructured":"Is this game NP-hard? (May 2009), \n                  \n                    http:\/\/valis.cs.uiuc.edu\/blog\/?p=2005"}],"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-13122-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:55:51Z","timestamp":1619783751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13122-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131219","9783642131226"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13122-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}