{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:10Z","timestamp":1746295810069,"version":"3.40.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_53","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"616-625","source":"Crossref","is-referenced-by-count":3,"title":["Explaining Snapshots of Network Diffusions: Structural and Hardness Results"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Askalidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Randall A.","family":"Berry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay G.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, N., Liu, H., Tang, L., Yu, P.S.: Identifying the influential bloggers in a community. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, pp. 207\u2013218. ACM (2008)","DOI":"10.1145\/1341531.1341559"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Askalidis, G., Berry, R.A., Subramanian, V.G.: Explaining snapshots of network diffusions: Structural and hardness results. arXiv preprint arXiv:1402.6273 (2014)","DOI":"10.1007\/978-3-319-08783-2_53"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Zwi, O., Hermelin, D., Lokshtanov, D., Newman, I.: An exact almost optimal algorithm for target set selection in social networks. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 355\u2013362. ACM (2009)","DOI":"10.1145\/1566374.1566424"},{"issue":"3","key":"53_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 Journal on Discrete Mathematics\u00a023(3), 1400\u20131415 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference), pp. 262\u2013273. IEEE (1997)","DOI":"10.1109\/CCC.1997.612321"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, crowds, and markets, vol.\u00a06(1). Cambridge Univ. Press (2010)","DOI":"10.1017\/CBO9780511761942"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Eickmeyer, K., Grohe, M., Gruber, M.: Approximation of natural w [p]-complete minimisation problems is hard. In: 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, pp. 8\u201318. IEEE (2008)","DOI":"10.1109\/CCC.2008.24"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Gundecha, P., Feng, Z., Liu, H.: Seeking provenance of information using social media. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 1691\u20131696. ACM (2013)","DOI":"10.1145\/2505515.2505633"},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"53_CR10","doi-asserted-by":"crossref","unstructured":"Lappas, T., Terzi, E., Gunopulos, D., Mannila, H.: Finding effectors in social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1059\u20131068. ACM (2010)","DOI":"10.1145\/1835804.1835937"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Lu, Z., Zhang, W., Wu, W., Fu, B., Du, D.: Approximation and inapproximation for the influence maximization problem in social networks under deterministic linear threshold model. In: 2011 31st International Conference on Distributed Computing Systems Workshops (ICDCSW), pp. 160\u2013165. IEEE (2011)","DOI":"10.1109\/ICDCSW.2011.33"},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"Mathioudakis, M., Koudas, N.: Efficient identification of starters and followers in social media. In: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, pp. 708\u2013719. ACM (2009)","DOI":"10.1145\/1516360.1516442"},{"key":"53_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/2318857.2254783","volume":"40","author":"P. Netrapalli","year":"2012","unstructured":"Netrapalli, P., Sanghavi, S.: Learning the graph of epidemic cascades. ACM SIGMETRICS Performance Evaluation Review\u00a040, 211\u2013222 (2012)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"53_CR14","doi-asserted-by":"crossref","unstructured":"Nguyen, D.T., Nguyen, N.P., Thai, M.T.: Sources of misinformation in online social networks: Who to suspect? In: Military Communications Conference, MILCOM 2012, pp. 1\u20136. IEEE (2012)","DOI":"10.1109\/MILCOM.2012.6415780"},{"key":"53_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-17517-6_34","volume-title":"Algorithms and Computation","author":"A. Nichterlein","year":"2010","unstructured":"Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: On tractable cases of target set selection. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol.\u00a06506, pp. 378\u2013389. Springer, Heidelberg (2010)"},{"key":"53_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms, vol.\u00a03. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"53_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-013-0671-5","volume":"38","author":"B. Aditya Prakash","year":"2014","unstructured":"Aditya Prakash, B., Vreeken, J., Faloutsos, C.: Efficiently spotting the starting points of an epidemic in a large graph. Knowledge and Information Systems\u00a038(1), 35\u201359 (2014)","journal-title":"Knowledge and Information Systems"},{"key":"53_CR18","unstructured":"Rodriguez, M.G., Balduzzi, D., Sch\u00f6lkopf, B.: Uncovering the temporal dynamics of diffusion networks. arXiv preprint arXiv:1105.0697 (2011)"},{"issue":"8","key":"53_CR19","doi-asserted-by":"publisher","first-page":"5163","DOI":"10.1109\/TIT.2011.2158885","volume":"57","author":"D. Shah","year":"2011","unstructured":"Shah, D., Zaman, T.: Rumors in a network: Who\u2019s the culprit? IEEE Transactions on Information Theory\u00a057(8), 5163\u20135181 (2011)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:49:08Z","timestamp":1746294548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}