{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T09:36:33Z","timestamp":1780047393585,"version":"3.53.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T00:00:00Z","timestamp":1662422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T00:00:00Z","timestamp":1662422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00224-022-10100-0","type":"journal-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T05:03:41Z","timestamp":1662440621000},"page":"996-1018","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Target Set Selection Parameterized by Vertex Cover and More"],"prefix":"10.1007","volume":"66","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rogers","family":"Mathew","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6213-8687","authenticated-orcid":false,"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,6]]},"reference":[{"key":"10100_CR1","doi-asserted-by":"crossref","unstructured":"Bakshy, E., Rosenn, I., Marlow, C., Adamic, L.: The role of social networks in information diffusion. In: Proceedings of the 21st International Conference on World Wide Web, pp 519\u2013528. ACM (2012)","DOI":"10.1145\/2187836.2187907"},{"issue":"2","key":"10100_CR2","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/JSAC.2005.861394","volume":"24","author":"Y-C Hu","year":"2006","unstructured":"Hu, Y.-C., Perrig, A., Johnson, D.B.: Wormhole attacks in wireless networks. IEEE J. Selected Areas Commun. 24(2), 370\u2013380 (2006)","journal-title":"IEEE J. Selected Areas Commun."},{"key":"10100_CR3","doi-asserted-by":"crossref","unstructured":"Salath\u00e9, M., Kazandjieva, M., Lee, J.W., Levis, P., Feldman, M.W., Jones, J.H.: A high-resolution human contact network for infectious disease transmission. Proceedings of the National Academy of Sciences, 201009094 (2010)","DOI":"10.1073\/pnas.1009094108"},{"issue":"3","key":"10100_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. Discret. Math. 23(3), 1400\u20131415 (2009)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"10100_CR5","doi-asserted-by":"publisher","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(4), 702\u2013715 (2013)","journal-title":"J. Comb. Optim."},{"key":"10100_CR6","doi-asserted-by":"publisher","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."},{"issue":"1","key":"10100_CR7","doi-asserted-by":"publisher","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":"10100_CR8","doi-asserted-by":"publisher","unstructured":"Dvorak\u0301, P., Knop, D., Toufar, T.: Target set selection in dense graph classes. In: Hsu, W., Lee, D., Liao, C. (eds.) 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan. LIPIcs, vol. 123, pp. 18\u201311813. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.18 (2018)","DOI":"10.4230\/LIPIcs.ISAAC.2018.18"},{"issue":"2","key":"10100_CR9","doi-asserted-by":"publisher","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"},{"issue":"2","key":"10100_CR10","doi-asserted-by":"publisher","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":"10100_CR11","doi-asserted-by":"crossref","unstructured":"Hartmann, T.A.: Target set selection parameterized by clique-width and maximum threshold. In: International Conference on Current Trends in Theory and Practice of Informatics, pp 137\u2013149. Springer (2018)","DOI":"10.1007\/978-3-319-73117-9_10"},{"key":"10100_CR12","doi-asserted-by":"publisher","unstructured":"Bliznets, I., Sagunov, D.: Solving target set selection with bounded thresholds faster than 2n. In: Paul, C., Pilipczuk, M. (eds.) 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 115, pp. 22\u201312214. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2018.22 (2019)","DOI":"10.4230\/LIPIcs.IPEC.2018.22"},{"key":"10100_CR13","doi-asserted-by":"crossref","unstructured":"Keiler, L., Lima, C.V.G., Maia, A.K., Sampaio, R., Sau, I.: Target set selection with maximum activation time. arXiv:2007.05246 (2020)","DOI":"10.1016\/j.procs.2021.11.014"},{"key":"10100_CR14","doi-asserted-by":"crossref","unstructured":"Knop, D., Schierreich, S., Such\u00fd, O.: Balancing the spread of two opinions in sparse social networks. arXiv:2105.10184 (2021)","DOI":"10.1609\/aaai.v36i11.21630"},{"key":"10100_CR15","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Mathew, R., Panolan, F.: Target set selection parameterized by vertex cover and more. arXiv:1812.01482 (2021)","DOI":"10.1007\/s00224-022-10100-0"},{"issue":"1","key":"10100_CR16","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. Discret. Optim. 8(1), 87\u201396 (2011)","journal-title":"Discret. Optim."},{"key":"10100_CR17","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D, Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, vol. 4 Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"10100_CR18","doi-asserted-by":"crossref","unstructured":"Marx, D.: Can you beat treewidth? In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201907), pp. 169\u2013179. IEEE (2007)","DOI":"10.1109\/FOCS.2007.27"},{"issue":"4","key":"10100_CR19","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H Lenstra Jr.","year":"1983","unstructured":"Lenstra Jr., H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.538","journal-title":"Math. Oper. Res."},{"key":"10100_CR20","doi-asserted-by":"publisher","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing. STOC \u201983, pp. 193\u2013206. Association for Computing Machinery. https:\/\/doi.org\/10.1145\/800061.808749 (1983)","DOI":"10.1145\/800061.808749"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10100-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-022-10100-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10100-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T07:03:23Z","timestamp":1664435003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-022-10100-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,6]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["10100"],"URL":"https:\/\/doi.org\/10.1007\/s00224-022-10100-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,6]]},"assertion":[{"value":"10 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}