C. Aschwanden, Spatial simulation model for infectious viral diseases with focus on SARS and the common flu, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the, 2004.
DOI : 10.1109/HICSS.2004.1265357

P. Barone, P. Bonizzoni, G. D. Vedova, and G. Mauri, An approximation algorithm for the shortest common supersequence problem, Proceedings of the 2001 ACM symposium on Applied computing , SAC '01, pp.56-60, 2001.
DOI : 10.1145/372202.372275

H. L. Boadlaender, G. Rodney, R. Downey, M. R. Fellows, and D. Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.423-434, 2009.
DOI : 10.1016/j.jcss.2009.04.001

R. Clifford, M. Jalsenius, A. Montanaro, and B. Sach, The Complexity of Flood Filling Games, Theory of Computing Systems, vol.25, issue.5, pp.1-72, 2012.
DOI : 10.1007/s00224-011-9339-2

M. R. Fellows, M. T. Hallett, and U. Stege, Analogs & Duals of the MAST Problem for Sequences & Trees, Journal of Algorithms, vol.49, pp.1-192, 2003.

R. Fleischer and G. J. Woeginger, An algorithmic analysis of the Honey-Bee game, Theoretical Computer Science, vol.452, pp.75-87, 2012.
DOI : 10.1016/j.tcs.2012.05.032

H. Fukui, A. Nakanishi, R. Uehara, T. Uno, and Y. Uno, The Complexity of Free Flooding Games, IPSG) SIG Notes 2011, pp.1-5

J. Guo and R. Niedermeier, Invitation to data reduction and problem kernelization, ACM SIGACT News, vol.38, issue.1, pp.31-45, 2007.
DOI : 10.1145/1233481.1233493

A. Lagoutte, M. Noual, and E. Thierry, Flooding games on graphs, Discrete Applied Mathematics, vol.164, pp.2-2014
DOI : 10.1016/j.dam.2013.09.024

URL : https://hal.archives-ouvertes.fr/hal-00653714

K. Meeks and A. Scott, The complexity of flood-filling games on graphs, Discrete Applied Mathematics, vol.160, issue.7-8, pp.959-969, 2012.
DOI : 10.1016/j.dam.2011.09.001

K. Meeks and A. Scott, The complexity of Free-Flood-It on boards, Theoretical Computer Science, vol.500, pp.25-43, 2013.
DOI : 10.1016/j.tcs.2013.06.010

K. Meeks and A. Scott, Spanning Trees and the Complexity of Flood Filling Games, Theory of Computing Systems, vol.54, pp.4-731, 2014.

S. Rahmann, The shortest common supersequence problem in a microarray production setting, Bioinformatics, vol.19, issue.Suppl 2, pp.156-161, 2003.
DOI : 10.1093/bioinformatics/btg1073

J. Sim and K. Park, The consensus string problem for a metric is NP-complete, Journal of Discrete Algorithms, vol.1, issue.1, pp.111-117, 2003.
DOI : 10.1016/S1570-8667(03)00011-X

U. S. Souza, F. Protti, M. Dantas, and . Silva, Parameterized Complexity of Flood-Filling Games on Trees, Proceedings of COCOON Lecture Notes in Computer Science, vol.7936, pp.531-542, 2013.
DOI : 10.1007/978-3-642-38768-5_47