{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:04Z","timestamp":1759063804132},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T00:00:00Z","timestamp":1370304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00224-013-9482-z","type":"journal-article","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T06:08:08Z","timestamp":1370239688000},"page":"731-753","source":"Crossref","is-referenced-by-count":5,"title":["Spanning Trees and the Complexity of Flood-Filling Games"],"prefix":"10.1007","volume":"54","author":[{"given":"Kitty","family":"Meeks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,4]]},"reference":[{"key":"9482_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-642-13122-6_30","volume-title":"FUN","author":"D. Arthur","year":"2010","unstructured":"Arthur, D., Clifford, R., Jalsenius, M., Montanaro, A., Sach, B.: The complexity of flood filling games. In: Boldi, P., Gargano, L. (eds.) FUN. Lecture Notes in Computer Science, vol. 6099, pp. 307\u2013318. Springer, Berlin (2010)"},{"key":"9482_CR2","unstructured":"Born, A.: Flash application for the computer game \u201cBiene\u201d (Honey-Bee) (2009). Available at http:\/\/www.ursulinen.asn-graz.ac.at\/Bugs\/htm\/games\/biene.htm"},{"key":"9482_CR3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/s00224-011-9339-2","volume":"50","author":"R. Clifford","year":"2012","unstructured":"Clifford, R., Jalsenius, M., Montanaro, A., Sach, B.: The complexity of flood filling games. Theory Comput. Syst. 50, 72\u201392 (2012)","journal-title":"Theory Comput. Syst."},{"key":"9482_CR4","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press\/McGraw-Hill, New York (1990)"},{"key":"9482_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2012.05.032","volume":"452","author":"R. Fleischer","year":"2012","unstructured":"Fleischer, R., Woeginger, G.: An algorithmic analysis of the honey-bee game. Theor. Comput. Sci. 452, 75\u201387 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"9482_CR6","unstructured":"Flood It Game. Available at http:\/\/floodit.appspot.com"},{"key":"9482_CR7","unstructured":"Flood It! 2. Available at http:\/\/itunes.apple.com"},{"key":"9482_CR8","unstructured":"Flood It! Available at https:\/\/market.android.com"},{"key":"9482_CR9","unstructured":"Fukui, H., Nakanishi, A., Uehara, R., Uno, T., Uno, Y.: The complexity of free flooding games. In: Information Processing Society of Jamap (IPSG) SIG Notes, August, 1\u20135 (2011)"},{"key":"9482_CR10","unstructured":"Lagoutte, A.: Jeux d\u2019inondation dans les graphes. Technical report, ENS Lyon, HAL: hal-00509488, August (2010)"},{"key":"9482_CR11","unstructured":"Lagoutte, A., Noual, M., Thierry, E.: Flooding games on graphs. HAL: hal-00653714, December (2011)"},{"key":"9482_CR12","unstructured":"Mad Virus. Available at http:\/\/www.bubblebox.com\/play\/puzzle\/539.htm"},{"key":"9482_CR13","unstructured":"Meeks, K., Scott, A.: The complexity of Free-Flood-It on 2\u00d7n boards (2011). arXiv:1101.5518v1 [cs.DS]"},{"key":"9482_CR14","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/j.dam.2011.09.001","volume":"160","author":"K. Meeks","year":"2012","unstructured":"Meeks, K., Scott, A.: The complexity of flood-filling games on graphs. Discrete Appl. Math. 160, 959\u2013969 (2012)","journal-title":"Discrete Appl. Math."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9482-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9482-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9482-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:25Z","timestamp":1558698865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9482-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,4]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9482"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9482-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,4]]}}}