V. Multicolored-clique-input, an integer k, and a coloring col , k}. Question: Does G contain a multicolored clique of size k, that is, a vertex subset V ? ? V with |V ? | = k such that for all u, v ? V ? it holds

A. Aazami, K. Stilp-ackerman, O. Ben-zwi, G. Adams, D. S. Troxell et al., Combinatorial model and bounds for target set selection Dynamic monopolies and feedback vertex sets in hexagonal grids Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids Network Flows: Theory, Algorithms, and Applications Some APX-completeness results for cubic graphs Approximation algorithms for the firefighter problem: Cuts over time and submodularity, SIAM Journal on Discrete Mathematics Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC '09), pp.1382-139944, 1993.

D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study Complexity of finding embeddings in a k-tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.

S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991.
DOI : 10.1016/0196-6774(91)90006-K

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.
DOI : 10.1017/CBO9780511804090

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, 1999.
DOI : 10.1007/978-3-642-58412-1

B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994.
DOI : 10.1145/174644.174650

J. Balogh, B. Bollobás, and R. Morris, Bootstrap Percolation in High Dimensions, Combinatorics, Probability and Computing, vol.6, issue.5-6, pp.643-692, 2010.
DOI : 10.1016/0898-1221(81)90137-1

C. Bazgan, M. Chopin, A. Nichterlein, and F. Sikora, Parameterized approximability of influence in social networks, Proceedings of the 19th Annual International Computing and Combinatorics Conference (COCOON '13), pp.543-554, 2013.

S. Peter, J. Bearman, K. Moody, and . Stovel, Chains of affection: The structure of adolescent romantic and sexual networks, American Journal of Sociology, vol.110, issue.1, pp.44-91, 2004.

O. Ben-zwi, D. Hermelin, D. Lokshtanov, and I. Newman, Treewidth governs the complexity of target set selection, Discrete Optimization, vol.8, issue.1, pp.87-96, 2011.
DOI : 10.1016/j.disopt.2010.09.007

L. Hans and . Bodlaender, Classes of graphs with bounded tree-width, Bulletin of EATCS, pp.116-128, 1988.

L. Hans and . Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.12, pp.1-45, 1998.

L. Hans, R. G. Bodlaender, M. R. Downey, D. Fellows, and . Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, issue.8, pp.75423-434, 2009.

L. Hans, B. M. Bodlaender, S. Jansen, and . Kratsch, Cross-composition: A new technique for kernelization lower bounds, Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS '11), LIPIcs 9, pp.165-176, 2011.

H. Bodlaender and L. , A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

N. Bourgeois, A. Giannakos, and G. Lucarelli, Ioannis Milis, and Vangelis Th. Paschos. Exact and approximation algorithms for densest k-subgraph, Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM '13), 2013.

N. Bousquet, J. Daligault, and S. Thomassé, Multicut is FPT, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.459-468, 2011.
DOI : 10.1145/1993636.1993698
URL : https://hal.archives-ouvertes.fr/lirmm-00741933

L. Cai, Parameterized Complexity of Cardinality Constrained Optimization Problems, The Computer Journal, vol.51, issue.1, pp.102-121, 2008.
DOI : 10.1093/comjnl/bxm086

L. Cai, S. M. Chan, and S. Chan, Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems, Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC '06), pp.239-250, 2006.
DOI : 10.1007/11847250_22

L. Cai, E. Verbin, and L. Yang, Firefighting on Trees: (1?????????1/e)???Approximation, Fixed Parameter Tractability and a Subexponential Algorithm, Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC '08), pp.258-269, 2008.
DOI : 10.1007/978-3-540-92182-0_25

C. C. Centeno, M. C. Dourado, L. D. Penso, D. Rautenbach, and J. L. Szwarcfiter, Irreversible conversion of graphs, Theoretical Computer Science, vol.412, issue.29, pp.3693-3700, 2011.
DOI : 10.1016/j.tcs.2011.03.029

D. Centola and M. Macy, Complex Contagions and the Weakness of Long Ties, American Journal of Sociology, vol.113, issue.3, pp.702-734, 2007.
DOI : 10.1086/521848

M. Cesati, The Turing way to parameterized complexity, Journal of Computer and System Sciences, vol.67, issue.4, pp.654-685, 2003.
DOI : 10.1016/S0022-0000(03)00073-4

P. Chalermsook and J. Chuzhoy, Resource Minimization for Fire Containment, Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10), pp.1334-1349, 2010.
DOI : 10.1137/1.9781611973075.108

C. Chang and Y. Lyuu, Spreading messages, Theoretical Computer Science, vol.410, pp.27-292714, 2009.
DOI : 10.1016/j.tcs.2009.03.032
URL : http://doi.org/10.1016/j.tcs.2009.03.032

J. Chen, X. Huang, I. A. Kanj, and G. Xia, Strong computational lower bounds via parameterized complexity, Journal of Computer and System Sciences, vol.72, issue.8, pp.1346-1367, 2006.
DOI : 10.1016/j.jcss.2006.04.007
URL : http://doi.org/10.1016/j.jcss.2006.04.007

J. Chen, I. A. Kanj, and G. Xia, Improved upper bounds for vertex cover, Theoretical Computer Science, vol.411, issue.40-42, pp.40-423736, 2010.
DOI : 10.1016/j.tcs.2010.06.026

N. Chen, On the Approximability of Influence in Social Networks, SIAM Journal on Discrete Mathematics, vol.23, issue.3, pp.1400-1415, 2009.
DOI : 10.1137/08073617X

W. Chen, Y. Wang, and S. Yang, Efficient influence maximization in social networks, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pp.199-208, 2009.
DOI : 10.1145/1557019.1557047

W. Chen, C. Wang, and Y. Wang, Scalable influence maximization for prevalent viral marketing in large-scale social networks, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.1029-1038, 2010.
DOI : 10.1145/1835804.1835934

Y. Chen, M. Grohe, and . Grüber, On Parameterized Approximability, Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC '06), pp.109-120, 2006.
DOI : 10.1007/11847250_10

C. Chiang, L. Huang, B. Li, J. Wu, and H. Yeh, Some results on the target set selection problem, Journal of Combinatorial Optimization, vol.13, issue.4, 2012.
DOI : 10.1007/s10878-012-9518-3

A. Nicholas, J. H. Christakis, and . Fowler, The Spread of Obesity in a Large Social Network over 32 Years, New England Journal of Medicine, vol.357, issue.4, pp.370-379, 2007.

C. Christensen, I. Albert, B. Grenfell, and R. Albert, Disease dynamics in a dynamic social network. Physica A: Statistical Mechanics and its Applications, pp.2663-2674, 2010.

R. K. Fan, P. D. Chung, and . Seymour, Graphs with small bandwidth and cutwidth, Graph Theory and combinatorics 1988 Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös, pp.113-119, 1989.

E. J. Cockayne, R. M. Dawes, and S. T. Hedetniemi, Total domination in graphs, Networks, vol.23, issue.3, pp.211-219, 1980.
DOI : 10.1002/net.3230100304

B. Courcelle, The monadic second-order logic of graphs I. Recognizable sets of Finite Graphs. Information and Computation, pp.12-75, 1990.

M. Develin and S. G. Hartke, Fire containment in grids of dimension three and higher, Discrete Applied Mathematics, vol.155, issue.17, pp.2257-2268, 2007.
DOI : 10.1016/j.dam.2007.06.002

I. Dinur and S. Safra, The importance of being biased, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.33-42, 2002.
DOI : 10.1145/509907.509915

P. Domingos and M. Richardson, Mining the network value of customers, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.57-66, 2001.
DOI : 10.1145/502512.502525

M. Doucha and J. Kratochvíl, Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS '12), pp.348-359, 2012.
DOI : 10.1007/978-3-642-32589-2_32

R. G. Downey, M. R. Fellows, C. Mccartin, and F. R. , Parameterized approximation of dominating set problems, Information Processing Letters, vol.109, issue.1, pp.68-70, 2008.
DOI : 10.1016/j.ipl.2008.09.017

A. Paul, F. S. Dreyer, and . Roberts, Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion, Discrete Applied Mathematics, vol.157, issue.7, pp.1615-1627, 2009.

D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World, 2010.
DOI : 10.1017/CBO9780511761942

D. Eppstein, Diameter and Treewidth in Minor-Closed Graph Families, Algorithmica, vol.27, issue.3, pp.275-291, 2000.
DOI : 10.1007/s004530010020

S. Finbow and G. Macgillivray, The firefighter problem: a survey of results, directions and questions, The Australasian Journal of Combinatorics, vol.43, pp.57-77, 2009.

S. Finbow, A. King, G. Macgillivray, and R. Rizzi, The firefighter problem for graphs of maximum degree three, Discrete Mathematics, vol.307, issue.16, pp.2094-2105, 2007.
DOI : 10.1016/j.disc.2005.12.053

P. Floderus, A. Lingas, and M. Persson, TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING, Proceedings of the 18th Computing: the Australasian Theory Symposium (CATS '11), CRPIT 119, pp.69-74, 2011.
DOI : 10.1142/S0129054113400017

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

F. Fomin, P. Heggernes, and E. Jan-van-leeuwen, Making Life Easier for Firefighters, Proceedings of the 6th International conference on Fun with Algorithms (FUN '12), pp.177-188
DOI : 10.1007/978-3-642-30347-0_19

L. Fortnow and R. Santhanam, Infeasibility of instance compression and succinct PCPs for NP, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.133-142, 2008.
DOI : 10.1145/1374376.1374398

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

P. A. Golovach, J. Kratochvil, and O. Such´ysuch´y, Parameterized complexity of generalized domination problems, Discrete Applied Mathematics, vol.160, issue.6, pp.780-792, 2012.
DOI : 10.1016/j.dam.2010.11.012

R. Halin, S-functions for graphs, Journal of Geometry, vol.147, issue.1-2, pp.171-186, 1976.
DOI : 10.1007/BF01917434

J. Harant, A. Pruchnewski, and M. Voigt, On Dominating Sets and Independent Sets of Graphs, Combinatorics, Probability and Computing, vol.8, issue.6, pp.547-553, 1999.
DOI : 10.1017/S0963548399004034

B. Hartnell, Firefighter! an application of domination, Presentation, 10th Conference on Numerical Mathematics and Computing, 1995.

B. Hartnell and Q. Li, Firefighting on trees: how bad is the greedy algorithm? Congressus Numerantium, pp.187-192, 2000.

J. Håstad, Clique is hard to approximate within n1?????, Acta Mathematica, vol.182, issue.1, pp.105-142, 1999.
DOI : 10.1007/BF02392825

D. S. Hochbaum, Approximation algorithms for NP-hard problems, 1997.

R. Impagliazzo and R. Paturi, Complexity of k-SAT, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), pp.367-375, 2001.
DOI : 10.1109/CCC.1999.766282

Y. Iwaikawa, N. Kamiyama, and T. Matsui, Improved Approximation Algorithms for Firefighter Problem on Trees, IEICE Transactions on Information and Systems, vol.94, issue.2, pp.196-199, 2011.
DOI : 10.1587/transinf.E94.D.196

Q. Jiang, G. Song, G. Cong, Y. Wang, W. Si et al., Simulated annealing based influence maximization in social networks, Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI '11), 2011.

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

D. Kempe and J. Kleinberg, Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.137-146, 2003.
DOI : 10.1145/956750.956769

S. Khanna, R. Motwani, M. Sudan, and U. V. Vazirani, On syntactic versus computational views of approximability, Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS '94), pp.819-830, 1994.

M. Kimura, K. Saito, and H. Motoda, Blocking links to minimize contamination spread in a social network, ACM Transactions on Knowledge Discovery from Data, vol.3, issue.2, pp.1-9, 2009.
DOI : 10.1145/1514888.1514892

A. King and G. Macgillivray, The firefighter problem for cubic graphs, Discrete Mathematics, vol.310, issue.3, pp.614-621, 2010.
DOI : 10.1016/j.disc.2009.05.007

R. Klasing and C. Laforest, Hardness results and approximation algorithms of k-tuple domination in graphs, Information Processing Letters, vol.89, issue.2, pp.75-83, 2004.
DOI : 10.1016/j.ipl.2003.10.004
URL : https://hal.archives-ouvertes.fr/hal-00307230

C. Komusiewicz and R. Niedermeier, New Races in Parameterized Algorithmics, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS '12), pp.19-30
DOI : 10.1007/978-3-642-32589-2_2

E. Korach and N. Solel, Tree-width, path-width, and cutwidth, Discrete Applied Mathematics, vol.43, issue.1, pp.97-101, 1993.
DOI : 10.1016/0166-218X(93)90171-J

H. W. Lenstra, Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research, vol.8, issue.4, pp.538-548, 1983.
DOI : 10.1287/moor.8.4.538

J. Leskovec, L. A. Adamic, and B. A. Huberman, The dynamics of viral marketing, ACM Transactions on the Web, vol.1, issue.1, 2007.

J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Vanbriesen et al., Cost-effective outbreak detection in networks, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '07, pp.420-429, 2007.
DOI : 10.1145/1281192.1281239

G. Macgillivray and P. Wang, On the firefighter problem, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.47, pp.83-96, 2003.

D. Marx, Parameterized Complexity and Approximation Algorithms, The Computer Journal, vol.51, issue.1, pp.60-78, 2008.
DOI : 10.1093/comjnl/bxm048

D. Marx, Completely Inapproximable Monotone and Antimonotone Parameterized Problems, 2010 IEEE 25th Annual Conference on Computational Complexity, pp.144-151, 2013.
DOI : 10.1109/CCC.2010.25

D. Marx and I. Razgon, Constant ratio fixed-parameter approximation of the edge multicut problem, Information Processing Letters, vol.109, issue.20, pp.1161-1166, 2009.
DOI : 10.1016/j.ipl.2009.07.016

L. Mathieson and S. Szeider, Parameterized Graph Editing with Chosen Vertex Degrees, Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA '08), pp.13-22, 2008.
DOI : 10.1007/978-3-540-85097-7_2

M. Ross, J. Mcconnell, and . Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '94), pp.536-545, 1994.

C. Moore and J. M. Robson, Hard Tiling Problems with Simple Tiles, Discrete & Computational Geometry, vol.26, issue.4, pp.573-590, 2001.
DOI : 10.1007/s00454-001-0047-6

. Kah-loon, P. Ng, and . Raff, A generalization of the firefighter problem on ZxZ, Discrete Applied Mathematics, vol.156, issue.5, pp.730-745, 2008.

A. Nichterlein, R. Niedermeier, J. Uhlmann, and M. Weller, On tractable cases of target set selection. Social Network Analysis and Mining, 2012.

R. Niedermeier, Invitation to Fixed-Parameter Algorithms. Number 31 in Oxford Lecture Series in Mathematics and Its Applications, 2006.

H. Christos, Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.

D. Peleg, Local majorities, coalitions and monopolies in graphs: a review, Theoretical Computer Science, vol.282, issue.2, pp.231-257, 2002.
DOI : 10.1016/S0304-3975(01)00055-X

S. Venkatesh-raman, S. Saurabh, and . Srihari, Parameterized algorithms for generalized domination, Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), pp.116-126, 2008.

T. V. Thirumala-reddy and C. Pandu-rangan, Variants of Spreading Messages, Journal of Graph Algorithms and Applications, vol.15, issue.5, pp.683-699, 2011.
DOI : 10.7155/jgaa.00244

D. Reichman, New bounds for contagious sets, Discrete Mathematics, vol.312, issue.10, pp.3121812-1814, 2012.
DOI : 10.1016/j.disc.2012.01.016

M. Richardson and P. Domingos, Mining knowledge-sharing sites for viral marketing, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.61-70, 2002.
DOI : 10.1145/775047.775057

N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1984.
DOI : 10.1016/0095-8956(84)90013-3

A. E. Scott, U. Stege, and N. Zeh, Politician???s Firefighting, Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC '06), pp.608-617, 2006.
DOI : 10.1007/11940128_61

V. Vijay and . Vazirani, Approximation Algorithms, 2004.

P. Wang and S. A. Moeller, Fire control on graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.41, pp.19-34, 2002.

P. David, D. B. Williamson, and . Shmoys, The Design of Approximation Algorithms, 2011.

L. Yang, Efficient algorithms on trees, 2009.