{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:18:21Z","timestamp":1725891501771},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303463"},{"type":"electronic","value":"9783642303470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30347-0_28","type":"book-chapter","created":{"date-parts":[[2012,5,30]],"date-time":"2012-05-30T22:27:55Z","timestamp":1338416875000},"page":"282-292","source":"Crossref","is-referenced-by-count":2,"title":["Spanning Trees and the Complexity of Flood-Filling Games"],"prefix":"10.1007","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","reference":[{"key":"28_CR1","unstructured":"Flood It Game, \n                  \n                    http:\/\/floodit.appspot.com"},{"key":"28_CR2","unstructured":"Flood It! 2, \n                  \n                    http:\/\/itunes.apple.com"},{"key":"28_CR3","unstructured":"Flood It!, \n                  \n                    https:\/\/market.android.com"},{"key":"28_CR4","unstructured":"Mad Virus, \n                  \n                    http:\/\/www.bubblebox.com\/play\/puzzle\/539.htm"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-13122-6_30","volume-title":"Fun with Algorithms","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. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 307\u2013318. Springer, Heidelberg (2010) ISBN 978-3-642-13121-9"},{"key":"28_CR6","unstructured":"Born, A.: Flash application for the computer game. Biene (Honey-Bee) (2009), \n                  \n                    http:\/\/www.ursulinen.asn-graz.ac.at\/Bugs\/htm\/games\/biene.htm"},{"key":"28_CR7","unstructured":"Clifford, R., Jalsenius, M., Montanaro, A., Sach, B.: The Complexity of Flood Filling Games. arXiv.1001.4420v2 [cs.DS] (August 2010)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-13122-6_19","volume-title":"Fun with Algorithms","author":"R. Fleischer","year":"2010","unstructured":"Fleischer, R., Woeginger, G.J.: An Algorithmic Analysis of the Honey-Bee Game. In: Boldi, P. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 178\u2013189. Springer, Heidelberg (2010) ISBN 978-3-642-13121-9"},{"key":"28_CR9","unstructured":"Fukui, H., Nakanishi, A., Uehara, R., Uno, T., Uno, Y.: The complexity of free flooding games. Information Processing Society of Japan (IPSJ) SIG Notes 2011, 1\u20135 (August 2011)"},{"key":"28_CR10","unstructured":"Lagoutte, A.: Jeux d\u2019inondation dans les graphes, Technical report, ENS Lyon, HAL: hal-00509488 (August 2010)"},{"key":"28_CR11","unstructured":"Lagoutte, A., Noual, M., Thierry, E.: Flooding games on graphs, HAL: hal-00653714 (December 2011)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Meeks, K., Scott, A.: The complexity of flood-filling games on graphs. Discrete Applied Mathematics (2011), doi:10.1016\/j.dam.2011.09.001","DOI":"10.1016\/j.dam.2011.09.001"},{"key":"28_CR13","unstructured":"Meeks, K., Scott, A.: The complexity of Free-Flood-It on 2 \u00d7n boards. arxiv.1101.5518v1 [cs.DS] (January 2011)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Meeks, K., Scott, A.: Spanning trees and the complexity of flood-filling games. arXiv:1203.2538v1 [cs.DS] (March 2012)","DOI":"10.1007\/978-3-642-30347-0_28"}],"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-30347-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:37:16Z","timestamp":1620113836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30347-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303463","9783642303470"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30347-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}