Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Meeks:2013:CFF, author = "Kitty Meeks and Alexander Scott", title = "The complexity of {Free-Flood-It} on $ 2 \times n $ boards", journal = j-THEOR-COMP-SCI, volume = "500", number = "??", pages = "25--43", day = "19", month = aug, year = "2013", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Oct 7 09:23:10 MDT 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397513004647", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }