R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, 1993.

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

G. Askalidis, R. A. Berry, and V. G. Subramanian, Explaining Snapshots of Network Diffusions: Structural and Hardness Results, Proceedings of the 20th International Conference on Computing and Combinatorics, pp.616-625, 2014.
DOI : 10.1007/978-3-319-08783-2_53

C. Bazgan, M. Chopin, A. Nichterlein, and F. Sikora, Parameterized Inapproximability of Target Set Selection and Generalizations, Computability, vol.3, issue.2, pp.135-145, 2014.
DOI : 10.1007/978-3-319-08019-2_2
URL : https://hal.archives-ouvertes.fr/hal-01388129

C. Bazgan, M. Chopin, A. Nichterlein, and F. Sikora, Parameterized approximability of maximizing the spread of influence in networks, Journal of Discrete Algorithms, vol.27, pp.54-65, 2014.
DOI : 10.1016/j.jda.2014.05.001
URL : https://hal.archives-ouvertes.fr/hal-01366676

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

S. Bharathi, D. Kempe, and M. Salek, Competitive Influence Maximization in Social Networks, Proceedings of the Third International Workshop on Internet and Network Economics, pp.306-311, 2007.
DOI : 10.1007/978-3-540-77105-0_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.7306

M. Chopin, A. Nichterlein, R. Niedermeier, and M. Weller, Constant thresholds can make target set selection tractable, Theory of Computing Systems, pp.61-83, 2014.
DOI : 10.1007/s00224-013-9499-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.1313

M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx et al., Parameterized Algorithms, 2015.
DOI : 10.1007/978-3-319-21275-3

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

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity, 2013.
DOI : 10.1007/978-1-4471-5559-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.456.2729

M. R. Fellows, D. Hermelin, F. Rosamond, and S. Vialette, On the parameterized complexity of multiple-interval graph problems, Theoretical Computer Science, vol.410, issue.1, pp.53-61, 2009.
DOI : 10.1016/j.tcs.2008.09.065
URL : https://hal.archives-ouvertes.fr/hal-00619739

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

D. Kempe and J. M. 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.105-147, 2015.
DOI : 10.1145/956750.956769

T. Lappas, E. Terzi, D. Gunopulos, and H. Mannila, Finding effectors in social networks, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.1059-1068, 2010.
DOI : 10.1145/1835804.1835937

A. Nichterlein, R. Niedermeier, J. Uhlmann, and M. Weller, On tractable cases of target set selection. Social Network Analysis and Mining, pp.233-256, 2013.

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

L. G. Valiant, The Complexity of Enumeration and Reliability Problems, SIAM Journal on Computing, vol.8, issue.3, pp.410-421, 1979.
DOI : 10.1137/0208032

C. Wang, W. Chen, and Y. Wang, Scalable influence maximization for independent cascade model in large-scale social networks, Data Mining and Knowledge Discovery, vol.8, issue.3, pp.545-576, 2012.
DOI : 10.1007/s10618-012-0262-1