{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:58:23Z","timestamp":1648771103425},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T00:00:00Z","timestamp":1458172800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00224-016-9670-8","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T21:44:26Z","timestamp":1458337466000},"page":"253-279","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Finding Effectors"],"prefix":"10.1007","volume":"60","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Fafianie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Froese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,17]]},"reference":[{"key":"9670_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993)"},{"key":"9670_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"9670_CR3","doi-asserted-by":"crossref","unstructured":"Askalidis, G., Berry, R.A., Subramanian, V.G.: Explaining snapshots of network diffusions Structural and hardness results. In: proceedings of the 20th International Conference on Computing and Combinatorics, volume 8591 of LNCS, pp 616\u2013625. Springer (2014)","DOI":"10.1007\/978-3-319-08783-2_53"},{"issue":"2","key":"9670_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.3233\/COM-140030","volume":"3","author":"C Bazgan","year":"2014","unstructured":"Bazgan, C., Chopin, M., Nichterlein, A., Sikora, F.: Parameterized inapproximability of target set selection and generalizations. Computability 3(2), 135\u2013145 (2014)","journal-title":"Computability"},{"key":"9670_CR5","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.: Parameterized approximability of maximizing the spread of influence in networks. J. Discret. Algorithm. 27, 54\u201365 (2014)","journal-title":"J. Discret. Algorithm."},{"issue":"1","key":"9670_CR6","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. Discret. Optim. 8(1), 87\u201396 (2011)","journal-title":"Discret. Optim."},{"key":"9670_CR7","doi-asserted-by":"crossref","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: proceedings of the Third International Workshop on Internet and Network Economics, volume 4858 of LNCS, pp 306\u2013311. Springer (2007)","DOI":"10.1007\/978-3-540-77105-0_31"},{"issue":"1","key":"9670_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. Theory Comput. Syst. 55(1), 61\u201383 (2014)","journal-title":"Theory Comput. Syst."},{"key":"9670_CR9","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F. V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized algorithms. springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"9670_CR10","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 57\u201366. ACM (2001)","DOI":"10.1145\/502512.502525"},{"key":"9670_CR11","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of parameterized complexity. springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"1","key":"9670_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9670_CR13","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory, springer (2006)"},{"key":"9670_CR14","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, \u00c9.: Maximizing the spread of influence through a social network. Theory Comput. 11, 105\u2013147 (2015)","journal-title":"Theory Comput."},{"key":"9670_CR15","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"},{"issue":"2","key":"9670_CR16","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.: On tractable cases of target set selection. Soc. Netw. Anal. Min. 3(2), 233\u2013256 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"key":"9670_CR17","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter algorithms. oxford university press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"3","key":"9670_CR18","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9670_CR19","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang, C., Chen, W., Wang, Y.: Scalable influence maximization for independent cascade model in large-scale social networks. Data Min. Knowl. Discov. 25(3), 545\u2013576 (2012)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9670-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9670-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9670-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9670-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T10:49:20Z","timestamp":1600339760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9670-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,17]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9670"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9670-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,17]]}}}