1. Abebe, R., Adamic, L., Kleinberg, J.: Mitigating overexposure in viral marketing. In: The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018), pp. 241–248 (2018)

   Google Scholar 

2. Berger, J., Heath, C.: Where consumers diverge from others: identity signaling and product domains. J. Consum. Res.34(2), 121–134 (2007)

   Article  Google Scholar 

3. Byers, J.W., Mitzenmacher, M., Zervas, G.: The groupon effect on yelp ratings: a root cause analysis. In: Proceedings of 13th ACM Conference on Electronic Commerce, EC 2012, pp. 248–265 (2012)

   Google Scholar 

4. Chen, Y., Li, H., Qu, Q.: Negative-aware influence maximization on social networks. In: Proceedings of AAAI Conference on Artificial Intelligence (2018)

   Google Scholar 

5. Cordasco, G., Gargano, L., Rescigno, A.A., Vaccaro, U.: Optimizing spread of influence in social networks via partial incentives. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 119–134. Springer, Cham (2015).https://doi.org/10.1007/978-3-319-25258-2_9

   Chapter  Google Scholar 

6. Cordasco, G., Gargano, L., Rescigno, A.A.: Influence propagation over large scale social networks. In: Proceedings of ASONAM 2015, pp. 1531–1538 (2015)

   Google Scholar 

7. Cordasco, G., et al.: Whom to befriend to influence people. Theoret. Comput. Sci. (to appear)

   Google Scholar 

8. Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A.A., Vaccaro, U.: Discovering small target sets in social networks: a fast and effective algorithm. Algorithmica80(6), 1804–1833 (2018)

   Article MathSciNet  Google Scholar 

9. Cordasco, G., Gargano, L., Rescigno, A.A.: Active influence spreading in social networks. Theoret. Comput. Sci.764, 15–29 (2019)

   Article MathSciNet  Google Scholar 

10. Cordasco, G., Gargano, L., Rescigno, A.A., Vaccaro, U.: Evangelism in social networks: algorithms and complexity. Networks71(4), 346–357 (2018)

    Article MathSciNet  Google Scholar 

11. Cravens, K., Goad Oliver, E., Ramamoorti, S.: The reputation index: measuring and managing corporate reputation. Eur. Manag. J.21(2), 201–212 (2003)

    Article  Google Scholar 

12. Cretu, A.E., Brodie, R.J.: The influence of brand image and company reputation where manufacturers market to small firms: a customer value perspective. Ind. Mark. Manag.36(2), 230–240 (2007)

    Article  Google Scholar 

13. Delbot, F., Laforest, C., Phan, R.: Graphs with forbidden and required vertices. In: 17th Rencontres Francophones sur les Aspects Algorithmiques des Télécom (ALGOTEL 2015) (2015)

    Google Scholar 

14. Dunbar, J.E., Hedetniemi, S.T., Henning, M.A., Slater, P.J.: Signed domination in graphs. In: Proceedings of the Seventh International Conference in Graph Theory, Combinatorics, Algorithms, and Applications, pp. 311–321 (1995)

    Google Scholar 

15. Dunbar, J., Hedetniemi, S., Henning, M.A., McRae, A.: Minus domination in graphs. Discret. Math.199(1), 35–47 (1999)

    Article MathSciNet  Google Scholar 

16. Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York (2010)

    Book  Google Scholar 

17. Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs (Pure and Applied Mathematics (Marcel Dekker)). CRC, Boca Raton (1998)

    Google Scholar 

18. Hu, Y., Van den Bulte, C.: Nonmonotonic status effects in new product adoption. Mark. Sci.33(4), 509–533 (2014)

    Article  Google Scholar 

19. Joshi, Y.V., Reibstein, D.J., Zhang, Z.J.: Turf wars: product line strategies in competitive markets. Mark. Sci.35(1), 128–141 (2016)

    Google Scholar 

20. Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett.70(1), 39–45 (1999)

    Article MathSciNet  Google Scholar 

21. Li, Y., Chen, W., Wang, Y., Zhang, Z.-L.: Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proc. of WSDM 2013, pp. 657–666 (2013)

    Google Scholar 

22. Liu, X., Kong, X., Yu, P.S.: Active opinion maximization in social networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (KDD 2018) (2018)

    Google Scholar 

23. Manurangsi, P.: Almost-polynomial ratio ETH-hardness of approximating densest K-subgraph. In: Proceedings of the 49th ACM SIGACT Symposium on Theory of Computing (STOC 2017), pp. 954–961 (2017)

    Google Scholar 

24. Miyano, E., Ono, H.: Maximum domination problem. In: Proceedings of the 17th Computing on The Australasian Theory Symposium (CATS 2011), vol. 119, pp. 55–62 (2011)

    Google Scholar 

25. Neiheisel, J.R., Niebler, S.: On the limits of persuasion: campaign ads and the structure of voters’ interpersonal discussion networks. Polit. Commun.32(3), 434–452 (2015)

    Article  Google Scholar 

26. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Prog.14(1), 265–294 (1978)

    Article MathSciNet  Google Scholar 

27. Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett.32(1), 41–43 (2004)

    Article MathSciNet  Google Scholar 

28. Wakefield, M., Flay, B., Nichter, M., Giovino, G.: Effects of anti-smoking advertising on youth smoking: a review. J. Health Comm.8(3), 229–247 (2003)

    Article  Google Scholar 

Download references