{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T21:44:09Z","timestamp":1785966249070,"version":"3.56.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T00:00:00Z","timestamp":1476230400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s13278-016-0408-z","type":"journal-article","created":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T10:24:13Z","timestamp":1476267853000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["On finding small sets that influence large networks"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9148-9769","authenticated-orcid":false,"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,10,12]]},"reference":[{"issue":"44\u201346","key":"408_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 (2010) Combinatorial model and bounds for target set selection. Theor Comput Sci 411(44\u201346):4017\u20134022","journal-title":"Theor Comput Sci"},{"key":"408_CR2","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 (2014) Parameterized approximability of maximizing the spread of influence in networks. J Discret Algorithms 27:54\u201365","journal-title":"J Discret Algorithms"},{"issue":"1","key":"408_CR3","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 (2011) Treewidth governs the complexity of target set selection. Discret Optim 8(1):87\u201396","journal-title":"Discret Optim"},{"key":"408_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1038\/nature11421","volume":"489","author":"RM Bond","year":"2012","unstructured":"Bond RM, Fariss CJ, Jones JJ, Kramer ADI, Marlow C, Settle JE, Fowler JH (2012) A 61-million-person experiment in social influence and political mobilization. Nature 489:295\u2013298","journal-title":"Nature"},{"issue":"29","key":"408_CR5","doi-asserted-by":"crossref","first-page":"3693","DOI":"10.1016\/j.tcs.2011.03.029","volume":"412","author":"CC Centeno","year":"2011","unstructured":"Centeno CC, Dourado MC, Penso LD, Rautenbach D, Szwarcfiter JL (2011) Irreversible conversion of graphs. Theor Comput Sci 412(29):3693\u20133700","journal-title":"Theor Comput Sci"},{"issue":"3","key":"408_CR6","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen N (2009) On the approximability of influence in social networks. SIAM J Discret Math 23(3):1400\u20131415","journal-title":"SIAM J Discret Math"},{"key":"408_CR7","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201909, pp 199\u2013208, New York, NY","DOI":"10.1145\/1557019.1557047"},{"key":"408_CR8","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"408_CR9","volume-title":"Information and influence propagation in social networks","author":"W Chen","year":"2013","unstructured":"Chen W, Castillo C, Lakshmanan L (2013) Information and influence propagation in social networks. Morgan & Claypool, San Rafael"},{"issue":"4","key":"408_CR10","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, Jiaojiao W, Yeh H-G (2013a) Some results on the target set selection problem. J Comb Optim 25(4):702\u2013715","journal-title":"J Comb Optim"},{"issue":"1","key":"408_CR11","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/120868864","volume":"27","author":"C-Y Chiang","year":"2013","unstructured":"Chiang C-Y, Huang L-H, Yeh H-G (2013b) Target set selection problem for honeycomb networks. SIAM J Discret Math 27(1):310\u2013328","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"408_CR12","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 (2014) Constant thresholds can make target set selection tractable. Theory Comput Syst 55(1):61\u201383","journal-title":"Theory Comput Syst"},{"key":"408_CR13","unstructured":"Christakis NA, Fowler JH (2011) Connected: the surprising power of our social networks and how they shape our lives\u2014how your friends\u2019 friends\u2019 friends affect everything you feel,think, and do. back bay books, reprint edn, January 2011"},{"key":"408_CR14","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 (2014) Latency-bounded target set selection in social networks. Theor Comput Sci 535:1\u201315","journal-title":"Theor Comput Sci"},{"key":"408_CR15","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, Vaccaro U (2015) Spread of influence in weighted networks under time and budget constraints. Theor Comput Sci 586:40\u201358","journal-title":"Theor Comput Sci"},{"key":"408_CR16","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan A, Feige U, Krivelevich M, Reichman D (2015) Contagious sets in expanders. In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms, pp 1953\u20131987","DOI":"10.1137\/1.9781611973730.131"},{"key":"408_CR17","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Mecchia M, Rescigno AA, Vaccaro U (2015a) A fast and effective heuristic for discovering small target sets in social networks. In: Proceedings of COCOA 2015, vol 9486, pp 193\u2013208","DOI":"10.1007\/978-3-319-26626-8_15"},{"key":"408_CR18","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Rescigno AA, Vaccaro U (2015b) Optimizing spread of influence in social networks via partial incentives. In: Structural information and communication complexity: 22nd international colloquium, SIROCCO 2015, pp 119\u2013134. Springer International Publishing","DOI":"10.1007\/978-3-319-25258-2_9"},{"key":"408_CR19","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Rescigno AA (2015c) Influence propagation over large scale social networks. In: Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining, ASONAM 2015, Paris, France, pp 1531\u20131538","DOI":"10.1145\/2808797.2808888"},{"key":"408_CR20","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Rescigno AA, Vaccaro U (2016b) Evangelism in social networks. In: Combinatorial algorithms\u201427th international workshop, IWOCA 2016, Helsinki, Finland, 17\u201319 Aug 2016, proceedings, pp 96\u2013108","DOI":"10.1007\/978-3-319-44543-4_8"},{"key":"408_CR21","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Rescigno AA, Vaccaro U (2016b) Evangelism in social networks. In: Combinatorial algorithms\u201427th international workshop, IWOCA 2016, Helsinki, Finland, 17\u201319 Aug 2016, proceedings, pp 96\u2013108","DOI":"10.1007\/978-3-319-44543-4_8"},{"issue":"6","key":"408_CR22","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1109\/TNET.2013.2290714","volume":"22","author":"TN Dinh","year":"2014","unstructured":"Dinh TN, Zhang H, Nguyen DT, Thai MT (2014) Cost-effective viral marketing for time-critical campaigns in large-scale social networks. IEEE\/ACM Trans Netw 22(6):2001\u20132011","journal-title":"IEEE\/ACM Trans Netw"},{"key":"408_CR23","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201901, pp 57\u201366, New York, NY, USA","DOI":"10.1145\/502512.502525"},{"issue":"2","key":"408_CR24","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S1570-8667(03)00022-4","volume":"1","author":"P Flocchini","year":"2003","unstructured":"Flocchini P, Kr\u00e1lovic R, Ruzicka P, Roncato A, Santoro N (2003) On time versus size for monotone dynamic monopolies in regular topologies. J Discret Algorithms 1(2):129\u2013150","journal-title":"J Discret Algorithms"},{"key":"408_CR25","doi-asserted-by":"crossref","unstructured":"Freund D, Poloczek M, Reichman D (2015) Contagious sets in dense graphs. In: Proceedings of 26th int\u2019l workshop on combinatorial algorithms (IWOCA2015)","DOI":"10.1007\/978-3-319-29516-9_16"},{"issue":"C","key":"408_CR26","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 JG, Vaccaro U (2015) Influence diffusion in social networks under time window constraints. Theor Comput Sci 584(C):53\u201366","journal-title":"Theor Comput Sci"},{"issue":"6","key":"408_CR27","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420\u20131443","journal-title":"Am J Sociol"},{"key":"408_CR28","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201903, pp 137\u2013146, New York, NY, USA","DOI":"10.1145\/956750.956769"},{"key":"408_CR29","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2005) Influential nodes in a diffusion model for social networks. In: Proceedings of the 32Nd international conference on automata, languages and programming, ICALP\u201905, pp 1127\u20131138, Berlin","DOI":"10.1007\/11523468_91"},{"issue":"4","key":"408_CR30","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, Tardos \u00c9 (2015) Maximizing the spread of influence through a social network. Theory Comput 11(4):105\u2013147","journal-title":"Theory Comput"},{"key":"408_CR31","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ins.2015.04.024","volume":"316","author":"S Kundu","year":"2015","unstructured":"Kundu S, Pal SK (2015) Deprecation based greedy strategy for target set selection in large scale social networks. Inf Sci 316:107\u2013122","journal-title":"Inf Sci"},{"issue":"1","key":"408_CR32","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1080\/10495140903190374","volume":"22","author":"M Leppaniemi","year":"2010","unstructured":"Leppaniemi M, Karjaluoto H, Lehto H, Goman A (2010) Targeting young voters in a political campaign: empirical insights into an interactive digital marketing campaign in the 2007 finnish general election. J Nonprofit Publ Sect Mark 22(1):14\u201337","journal-title":"J Nonprofit Publ Sect Mark"},{"key":"408_CR34","unstructured":"Leskovec J, Krevl A (2015) SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"408_CR33","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5","journal-title":"ACM Trans Web"},{"key":"408_CR35","unstructured":"Newman M (2015) Network data. http:\/\/www-personal.umich.edu\/~mejn\/netdata\/"},{"issue":"2","key":"408_CR36","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s13278-012-0067-7","volume":"3","author":"A Nichterlein","year":"2013","unstructured":"Nichterlein A, Niedermeier R, Uhlmann J, Weller M (2013) On tractable cases of target set selection. Soc Netw Anal Min 3(2):233\u2013256","journal-title":"Soc Netw Anal Min"},{"issue":"5","key":"408_CR37","doi-asserted-by":"crossref","first-page":"683","DOI":"10.7155\/jgaa.00244","volume":"15","author":"TV Thirumala Reddy","year":"2011","unstructured":"Thirumala Reddy TV, Pandu Rangan C (2011) Variants of spreading messages. J Graph Algorithms Appl 15(5):683\u2013699","journal-title":"J Graph Algorithms Appl"},{"key":"408_CR38","unstructured":"Rival J-B, Walach J (2007) The use of viral marketing in politics: a case study of the 2007 french presidential election. Master thesis, J\u00f6nk\u00f6ping University, J\u00f6nk\u00f6ping International Business School"},{"issue":"4","key":"408_CR39","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1007\/s13278-013-0135-7","volume":"3","author":"P Shakarian","year":"2013","unstructured":"Shakarian P, Eyre S, Paulo D (2013) A scalable heuristic for viral marketing under the tipping model. Soc Netw Anal Min 3(4):1225\u20131248","journal-title":"Soc Netw Anal Min"},{"key":"408_CR40","unstructured":"Tumulty K (2007) Obama\u2019s viral marketing campaign. TIME Magazine, July 2007"},{"key":"408_CR41","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge"},{"key":"408_CR42","unstructured":"Zafarani R, Liu H (2009) Social computing data repository at ASU. http:\/\/socialcomputing.asu.edu"},{"issue":"6","key":"408_CR43","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.disc.2011.11.038","volume":"312","author":"M Zaker","year":"2012","unstructured":"Zaker M (2012) On dynamic monopolies of graphs with general thresholds. Discret Math 312(6):1136\u20131143","journal-title":"Discret Math"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0408-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-016-0408-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0408-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T10:08:21Z","timestamp":1568455701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-016-0408-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,12]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["408"],"URL":"https:\/\/doi.org\/10.1007\/s13278-016-0408-z","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,12]]},"article-number":"94"}}