The Complexity of Flood Filling Games

David Arthur; Raphaël Clifford; Markus Jalsenius; Ashley Montanaro; Benjamin Sach

The Complexity of Flood Filling Games

David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

11 Citations (Scopus)

Translated title of the contribution	The Complexity of Flood Filling Games
Original language	English
Title of host publication	Proceedings of the 5th International Conference on FUN WITH ALGORITHMS (FUN)
Publisher	Springer Berlin Heidelberg
Publication status	Published - 2010

Bibliographical note

Other page information: 307-318
Conference Proceedings/Title of Journal: Proceedings of the 5th International Conference on FUN WITH ALGORITHMS (FUN)
Other identifier: 2001296

Access to Document

http://www.cs.bris.ac.uk/Publications/pub_master.jsp?id=2001296

Handle.net

Persistent link

Cite this

@inproceedings{2afa50b5ce084bdbb9e7498e91abbb7d,

title = "The Complexity of Flood Filling Games",

author = "David Arthur and Rapha{\"e}l Clifford and Markus Jalsenius and Ashley Montanaro and Benjamin Sach",

note = "Other page information: 307-318 Conference Proceedings/Title of Journal: Proceedings of the 5th International Conference on FUN WITH ALGORITHMS (FUN) Other identifier: 2001296",

year = "2010",

language = "English",

booktitle = "Proceedings of the 5th International Conference on FUN WITH ALGORITHMS (FUN)",

publisher = "Springer Berlin Heidelberg",

address = "Germany",

}

TY - GEN

T1 - The Complexity of Flood Filling Games

AU - Arthur, David

AU - Clifford, Raphaël

AU - Jalsenius, Markus

AU - Montanaro, Ashley

AU - Sach, Benjamin

N1 - Other page information: 307-318 Conference Proceedings/Title of Journal: Proceedings of the 5th International Conference on FUN WITH ALGORITHMS (FUN) Other identifier: 2001296

PY - 2010

Y1 - 2010

M3 - Conference Contribution (Conference Proceeding)

BT - Proceedings of the 5th International Conference on FUN WITH ALGORITHMS (FUN)

PB - Springer Berlin Heidelberg

ER -