R. Barbosa, D. Rautenbach, V. Fernandes-dos-santos, and J. L. Szwarcfiter, On minimal and minimum hull sets, Electronic Notes in Discrete Mathematics, vol.44, pp.207-212, 2013.

O. Ben-zwi, D. Hermelin, D. Lokshtanov, and I. Newman, Treewidth governs the complexity of target set selection, Discrete Optimization, vol.8, pp.87-96, 2011.

K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, pp.335-379, 1976.

C. C. Centeno, M. C. Dourado, L. D. Penso, D. Rautenbach, and J. L. Szwarcfiter, Irreversible conversion of graphs, Theoretical Computer Science, vol.412, pp.3693-3700, 2011.

C. Chiang, L. Huang, B. J. Li, H. Wu, and . Yeh, Some results on the target set selection problem, Journal of Combinatorial Optimization, vol.25, pp.702-715, 2013.

M. Chopin, A. Nichterlein, R. Niedermeier, and M. Weller, Constant thresholds can make target set selection tractable, Theory of Computing Systems, vol.55, pp.61-83, 2014.

N. Chen, On the approximability of influence in social networks, SIAM Journal on Discrete Mathematics, vol.23, pp.1400-1415, 2009.

P. Domingos and M. Richardson, Mining the network value of customers, Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.57-66, 2001.

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

D. Kempe, J. Kleinberg, and E. Tardos, Maximizing the spread of influence through a social network, Theory of Computing, vol.11, pp.105-147, 2015.

J. Kyn?l, B. Lidický, and T. Vysko?il, Irreversible 2-conversion set in graphs of bounded degree, Discrete Mathematics and Theoretical Computer Science, vol.19, p.3, 2017.