{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:32Z","timestamp":1759638692436},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_8","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"65-77","source":"Crossref","is-referenced-by-count":9,"title":["Latency-Bounded Target Set Selection in Social Networks"],"prefix":"10.1007","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gennaro","family":"Cordasco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0411, 4017\u20134022 (2010)","journal-title":"Theoretical Computer Science"},{"key":"8_CR2","doi-asserted-by":"publisher","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 Optimization\u00a08, 87\u201396 (2011)","journal-title":"Discrete Optimization"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-34611-8_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Brunetti","year":"2012","unstructured":"Brunetti, S., Cordasco, G., Gargano, L., Lodi, E., Quattrociocchi, W.: Minimum Weight Dynamo and Fast Opinion Spreading. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 249\u2013261. Springer, Heidelberg (2012)"},{"key":"8_CR4","doi-asserted-by":"publisher","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.\u00a023, 1400\u20131415 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-34862-4_9","volume-title":"Design and Analysis of Algorithms","author":"M. Chopin","year":"2012","unstructured":"Chopin, M., Nichterlein, A., Niedermeier, R., Weller, M.: Constant Thresholds Can Make Target Set Selection Tractable. In: Even, G., Rawitz, D. (eds.) MedAlg 2012. LNCS, vol.\u00a07659, pp. 120\u2013133. Springer, Heidelberg (2012)"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.dam.2012.10.007","volume":"161","author":"F. Cicalese","year":"2013","unstructured":"Cicalese, F., Milani\u010d, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Disc. Appl. Math.\u00a0161, 750\u2013767 (2013)","journal-title":"Disc. Appl. Math."},{"key":"8_CR7","first-page":"65","volume-title":"Lecture Notes in Computer Science","author":"Ferdinando Cicalese","year":"2013","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milani\u010d, M., Vaccaro, U.: Latency-Bounded Target Set Selection in Social Networks. ArXiV:1303.6785 (2013)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"D.G. Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J.\u00a0Comput.\u00a034, 825\u2013847 (2005)","journal-title":"SIAM J.\u00a0Comput."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Math.\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Math."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. of the 7-th ACM SIGKDD International Conference, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.M.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511761942"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S.-I.: Finding branch-decompositions and rank-decompositions. SIAM J. Comput.\u00a038, 1012\u20131032 (2008)","journal-title":"SIAM J. Comput."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. of the 9-th ACM SIGKDD International Conference, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"D. Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Influential Nodes in a Diffusion Model for Social Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1127\u20131138. Springer, Heidelberg (2005)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S.-I. Oum","year":"2006","unstructured":"Oum, S.-I., Seymour, P.: Approximating clique\u2013width and branch\u2013width. J. Combin. Theory Ser. B\u00a096, 514\u2013528 (2006)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T11:49:27Z","timestamp":1563104967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}