{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:43Z","timestamp":1725862723348},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_8","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T11:49:58Z","timestamp":1470656998000},"page":"96-108","source":"Crossref","is-referenced-by-count":3,"title":["Evangelism in Social Networks"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"4017","DOI":"10.1016\/j.tcs.2010.08.021","volume":"411","author":"E Ackerman","year":"2010","unstructured":"Ackerman, E., Ben-Zwi, O., Wolfovitz, G.: Combinatorial model and bounds for target set selection. Theor. Comput. Sci. 411, 4017\u20134022 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Lento, T.M., Adar, E., Ng, P.C.: Information evolution in social networks. In: Proceedings of the 9th ACM WSDM 2016, pp. 473\u2013482 (2016)","DOI":"10.1145\/2835776.2835827"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.jda.2014.05.001","volume":"27","author":"C Bazgan","year":"2014","unstructured":"Bazgan, C., Chopin, M., Nichterlein, A., Sikora, F.: Parametrized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms 27, 54\u201365 (2014)","journal-title":"J. Discrete Algorithms"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disopt.2010.09.007","volume":"8","author":"O Ben-Zwi","year":"2011","unstructured":"Ben-Zwi, O., Hermelin, D., Lokshtanov, D., Newman, I.: Treewidth governs the complexity of target set selection. Discrete Optim. 8, 87\u201396 (2011)","journal-title":"Discrete Optim."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discrete Math. 23, 1400\u20131415 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and Influence Propagation in Social Networks. Morgan & Claypool, San Rafael (2013)","DOI":"10.2200\/S00527ED1V01Y201308DTM037"},{"issue":"29","key":"8_CR7","doi-asserted-by":"crossref","first-page":"3693","DOI":"10.1016\/j.tcs.2011.03.029","volume":"412","author":"CC Centeno","year":"2011","unstructured":"Centeno, C.C., Dourado, M.C., Draque Penso, L., Rautenbach, D., Szwarcfiter, J.L.: Irreversible conversion of graphs. Theor. Comput. Sci. 412(29), 3693\u20133700 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00224-013-9499-3","volume":"55","author":"M Chopin","year":"2014","unstructured":"Chopin, M., Nichterlein, A., Niedermeier, R., Weller, M.: Constant thresholds can make target set selection tractable. Theor. Comput. Syst. 55, 61\u201383 (2014)","journal-title":"Theor. Comput. Syst."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1007\/s10878-012-9518-3","volume":"25","author":"C-Y Chiang","year":"2013","unstructured":"Chiang, C.-Y., Huang, L.-H., Li, B.-J., Wu, J., Yeh, H.-G.: Some results on the target set selection problem. J. Comb. Optim. 25, 702\u2013715 (2013)","journal-title":"J. Comb. Optim."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2014.02.027","volume":"535","author":"F Cicalese","year":"2014","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milani\u010d, M., Vaccaro, U.: Latency-bounded target set selection in social networks. Theor. Comput. Sci. 535, 1\u201315 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.tcs.2015.02.032","volume":"586","author":"F Cicalese","year":"2015","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milani\u010d, M., Peters, J.G., Vaccaro, U.: Spread of influence in weighted networks under time and budget constraints. Theor. Comput. Sci. 586, 40\u201358 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Feige, U., Krivelevich, M., Reichman, D.: Contagious sets in expanders. In: Proceedings of SODA 2015, pp. 1953\u20131987 (2015)","DOI":"10.1137\/1.9781611973730.131"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-319-26626-8_15","volume-title":"Combinatorial Optimization and Applications","author":"G Cordasco","year":"2015","unstructured":"Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A.A., Vaccaro, U.: A fast and effective heuristic for discovering small target sets in social networks. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) Combinatorial Optimization and Applications. LNCS, vol. 9486, pp. 193\u2013208. Springer, Heidelberg (2015)"},{"key":"8_CR14","volume-title":"The Selfish Gene","author":"R Dawkins","year":"1989","unstructured":"Dawkins, R.: The Selfish Gene. Oxford University Press, Oxford (1989)"},{"key":"8_CR15","volume-title":"Parameterized Complexity","author":"RG Downey","year":"2012","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (2012)"},{"key":"8_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York (2010)"},{"key":"8_CR17","unstructured":"Fiala, J., Gavenciak, T., Knop, D., Koutecky, M., Kratochv\u00edl, J.: Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems (2015). arXiv:1507.00640"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-29516-9_16","volume-title":"Combinatorial Algorithms","author":"D Freund","year":"2016","unstructured":"Freund, D., Poloczek, M., Reichman, D.: Contagious sets in dense graphs. In: Lipt\u00e1k, Z. (ed.) IWOCA 2015. LNCS, vol. 9538, pp. 185\u2013196. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29516-9_16"},{"key":"8_CR19","unstructured":"R. Ganian,Using neighborhood diversity to solve hard problems (2012). arXiv:1201.3091"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.tcs.2014.11.029","volume":"566","author":"L Gargano","year":"2015","unstructured":"Gargano, L., Rescigno, A.A.: Complexity of conflict-free colorings of graphs. Theor. Comput. Sci. 566, 39\u201349 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2015.02.015","volume":"584","author":"L Gargano","year":"2015","unstructured":"Gargano, L., Hell, P., Peters, J.G., Vaccaro, U.: Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. 584, 53\u201366 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR22","volume-title":"Selling the Dream: How to Promote Your Product, Company, or Ideas and Make a Difference Using Everyday Evangelism","author":"G Kawasaki","year":"1991","unstructured":"Kawasaki, G.: Selling the Dream: How to Promote Your Product, Company, or Ideas and Make a Difference Using Everyday Evangelism. HarperCollins, New York (1991)"},{"key":"8_CR23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the Spread of Influence through a Social Network. Theor. Comput. 11, 105\u2013147 (2015)","journal-title":"Theor. Comput."},{"key":"8_CR24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2011","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64, 19\u201337 (2011)","journal-title":"Algorithmica"},{"key":"8_CR25","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1080\/10495140903190374","volume":"22","author":"M Leppaniemi","year":"2010","unstructured":"Leppaniemi, M., et al.: Targeting young voters in a political campaign: empirical insights into an interactive digital marketing campaign in the 2007 finnish general election. J. Nonprofit Public Sect. Mark. 22, 14\u201337 (2010)","journal-title":"J. Nonprofit Public Sect. Mark."},{"key":"8_CR26","unstructured":"McConnell, B., Huba, J.: Creating Customer Evangelists: How Loyal Customers Become a Volunteer Sales Force. Lewis Lane Press, USA (2012)"},{"key":"8_CR27","first-page":"1","volume":"3","author":"A Nichterlein","year":"2012","unstructured":"Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: Tractable cases of target set selection. Soc. Netw. Anal. Min. 3, 1\u201324 (2012)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"5","key":"8_CR28","doi-asserted-by":"crossref","first-page":"683","DOI":"10.7155\/jgaa.00244","volume":"15","author":"TVT Reddy","year":"2011","unstructured":"Reddy, T.V.T., Rangan, C.P.: Variants of spreading messages. J. Graph Algorithms Appl. 15(5), 683\u2013699 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR29","unstructured":"Tumulty, K.: Obama\u2019s Viral Marketing Campaign. TIME Magazine, July 5 2007"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T08:29:41Z","timestamp":1568276981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}