{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T22:24:20Z","timestamp":1783117460206,"version":"3.54.6"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:00Z","timestamp":1780444800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101002854"],"award-info":[{"award-number":["101002854"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["CZ.02.01.01\/00\/22_008\/0004590"],"award-info":[{"award-number":["CZ.02.01.01\/00\/22_008\/0004590"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministry of Education Youth and Sports of the Czech Republic","doi-asserted-by":"publisher","award":["CZ.02.01.01\/00\/22_008\/0004590"],"award-info":[{"award-number":["CZ.02.01.01\/00\/22_008\/0004590"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.artint.2026.104563","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T23:27:23Z","timestamp":1779492443000},"page":"104563","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Balancing the spread of two opinions in sparse social networks"],"prefix":"10.1016","volume":"357","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2588-5709","authenticated-orcid":false,"given":"Du\u0161an","family":"Knop","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8901-1942","authenticated-orcid":false,"given":"\u0160imon","family":"Schierreich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7236-8336","authenticated-orcid":false,"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2026.104563_bib0001","series-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI \u201922","first-page":"12987","article-title":"Balancing the spread of two opinions in sparse social networks (Student abstract)","author":"Knop","year":"2022"},{"key":"10.1016\/j.artint.2026.104563_bib0002","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-23105-1","article-title":"Diffusion in Social Networks","author":"Shakarian","year":"2015"},{"issue":"3","key":"10.1016\/j.artint.2026.104563_bib0003","first-page":"1","article-title":"Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata","volume":"9","author":"Goldenberg","year":"2001","journal-title":"Acad. Mark. Sci. Rev."},{"key":"10.1016\/j.artint.2026.104563_bib0004","series-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"Easley","year":"2010"},{"key":"10.1016\/j.artint.2026.104563_bib0005","series-title":"Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201903","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.artint.2026.104563_bib0006","series-title":"Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP \u201905","first-page":"1127","article-title":"Influential nodes in a diffusion model for social networks","volume":"3580","author":"Kempe","year":"2005"},{"key":"10.1016\/j.artint.2026.104563_bib0007","doi-asserted-by":"crossref","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","article-title":"Maximizing the spread of influence through a social network","volume":"11","author":"Kempe","year":"2015","journal-title":"Theory Comput."},{"key":"10.1016\/j.artint.2026.104563_bib0008","series-title":"Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201901","first-page":"57","article-title":"Mining the network value of customers","author":"Domingos","year":"2001"},{"key":"10.1016\/j.artint.2026.104563_bib0009","article-title":"Information and Influence Propagation in Social Networks","author":"Chen","year":"2013"},{"key":"10.1016\/j.artint.2026.104563_bib0010","series-title":"Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201914","first-page":"946","article-title":"Maximizing social influence in nearly optimal time","author":"Borgs","year":"2014"},{"key":"10.1016\/j.artint.2026.104563_bib0011","series-title":"Proceedings of the 9th International Conference on Electronic Commerce, ICEC \u201907","first-page":"351","article-title":"Maximizing influence in a competitive social network: a follower\u2019s perspective","volume":"258","author":"Carnes","year":"2007"},{"key":"10.1016\/j.artint.2026.104563_bib0012","series-title":"Proceedings of the 3rd International Workshop on Internet and Network Economics, WINE \u201907","first-page":"306","article-title":"Competitive influence maximization in social networks","volume":"4858","author":"Bharathi","year":"2007"},{"key":"10.1016\/j.artint.2026.104563_bib0013","series-title":"Proceedings of the 20th International Conference on World Wide Web, WWW \u201911","first-page":"665","article-title":"Limiting the spread of misinformation in social networks","author":"Budak","year":"2011"},{"key":"10.1016\/j.artint.2026.104563_bib0014","series-title":"Proceedings of the 12th IEEE International Conference on Data Mining, ICDM \u201912","first-page":"539","article-title":"Clash of the contagions: cooperation and competition in information diffusion","author":"Myers","year":"2012"},{"issue":"2","key":"10.1016\/j.artint.2026.104563_bib0015","doi-asserted-by":"crossref","first-page":"60","DOI":"10.14778\/2850578.2850581","article-title":"From competition to complementarity: comparative influence diffusion and maximization","volume":"9","author":"Lu","year":"2015","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.artint.2026.104563_bib0016","series-title":"Proceedings of the 31st Annual Conference on Neural Information Processing Systems, NIPS \u201917","first-page":"4663","article-title":"Balancing information exposure in social networks","author":"Garimella","year":"2017"},{"key":"10.1016\/j.artint.2026.104563_bib0017","series-title":"Proceedings of the 5th International Conference on Weblogs and Social Media, ICWSM \u201911","first-page":"89","article-title":"Political polarization on twitter","author":"Conover","year":"2011"},{"key":"10.1016\/j.artint.2026.104563_bib0018","series-title":"Proceedings of the 22nd International Conference on Database Theory, ICDT \u201919","first-page":"12:1","article-title":"An experimental study of the treewidth of real-world graph data","volume":"127","author":"Maniu","year":"2019"},{"issue":"4","key":"10.1016\/j.artint.2026.104563_bib0019","doi-asserted-by":"crossref","first-page":"2177","DOI":"10.1137\/15M1034337","article-title":"The mixed Chinese postman problem parameterized by pathwidth and treedepth","volume":"30","author":"Gutin","year":"2016","journal-title":"SIAM J. Discrete Math."},{"issue":"12","key":"10.1016\/j.artint.2026.104563_bib0020","doi-asserted-by":"crossref","first-page":"3597","DOI":"10.1007\/s00453-018-0408-7","article-title":"Parameterized complexity of length-bounded cuts and multicuts","volume":"80","author":"Dvo\u0159\u00e1k","year":"2018","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.artint.2026.104563_bib0021","doi-asserted-by":"crossref","first-page":"401","DOI":"10.7155\/jgaa.00601","article-title":"Parameterized complexity of geodetic set","volume":"26","author":"Kellerhals","year":"2022","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.artint.2026.104563_bib0022","unstructured":"F. Eisenbrand, C. Hunkenschr\u00f6der, K.-M. Klein, M. Kouteck\u00fd, A. Levin, S. Onn, An algorithmic theory of integer programming, (2019). https:\/\/arxiv.org\/pdf\/1904.01361.pdf."},{"key":"10.1016\/j.artint.2026.104563_bib0023","series-title":"Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201902","first-page":"61","article-title":"Mining knowledge-sharing sites for viral marketing","author":"Richardson","year":"2002"},{"key":"10.1016\/j.artint.2026.104563_bib0024","series-title":"Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC \u201907","first-page":"128","article-title":"On the submodularity of influence in social networks","author":"Mossel","year":"2007"},{"issue":"3","key":"10.1016\/j.artint.2026.104563_bib0025","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","article-title":"On the approximability of influence in social networks","volume":"23","author":"Chen","year":"2009","journal-title":"SIAM J. Discrete Math."},{"issue":"34\u201336","key":"10.1016\/j.artint.2026.104563_bib0026","doi-asserted-by":"crossref","first-page":"3181","DOI":"10.1016\/j.tcs.2010.05.015","article-title":"The parameterized complexity of editing graphs for bounded degeneracy","volume":"411","author":"Mathieson","year":"2010","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"10.1016\/j.artint.2026.104563_bib0027","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1007\/s00224-021-10045-w","article-title":"A parameterized complexity view on collapsing k-cores","volume":"65","author":"Luo","year":"2021","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.artint.2026.104563_bib0028","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2014.02.027","article-title":"Latency-bounded target set selection in social networks","volume":"535","author":"Cicalese","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.artint.2026.104563_bib0029","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.tcs.2015.02.032","article-title":"Spread of influence in weighted networks under time and budget constraints","volume":"586","author":"Cicalese","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.artint.2026.104563_bib0030","series-title":"Proceedings 10th ACM Conference on Electronic Commerce, EC \u201909","first-page":"355","article-title":"An exact almost optimal algorithm for target set selection in social networks","author":"Ben-Zwi","year":"2009"},{"issue":"1","key":"10.1016\/j.artint.2026.104563_bib0031","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disopt.2010.09.007","article-title":"Treewidth governs the complexity of target set selection","volume":"8","author":"Ben-Zwi","year":"2011","journal-title":"Discrete Optim."},{"issue":"2","key":"10.1016\/j.artint.2026.104563_bib0032","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s13278-012-0067-7","article-title":"On tractable cases of target set selection","volume":"3","author":"Nichterlein","year":"2013","journal-title":"Soc. Netw. Anal. Min."},{"issue":"1","key":"10.1016\/j.artint.2026.104563_bib0033","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00224-013-9499-3","article-title":"Constant thresholds can make target set selection tractable","volume":"55","author":"Chopin","year":"2014","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10.1016\/j.artint.2026.104563_bib0034","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1137\/20M1337624","article-title":"Target set selection in dense graph classes","volume":"36","author":"Dvo\u0159\u00e1k","year":"2022","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.artint.2026.104563_bib0035","series-title":"Proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM \u201918","first-page":"137","article-title":"Target set selection parameterized by clique-width and maximum threshold","volume":"10706","author":"Hartmann","year":"2018"},{"key":"10.1016\/j.artint.2026.104563_bib0036","series-title":"Proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC \u201913","first-page":"163","article-title":"Parameterized algorithms for modular-width","volume":"8246","author":"Gajarsk\u00fd","year":"2013"},{"key":"10.1016\/j.artint.2026.104563_bib0037","series-title":"Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI \u201923","first-page":"16316","article-title":"Maximizing influence spread through a dynamic social network (Student abstract)","author":"Schierreich","year":"2023"},{"key":"10.1016\/j.artint.2026.104563_bib0038","series-title":"Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201923","first-page":"2222","article-title":"Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source","author":"Deligkas","year":"2023"},{"issue":"2","key":"10.1016\/j.artint.2026.104563_bib0039","article-title":"On the complexity of target set selection in simple geometric networks","volume":"26","author":"Dvo\u0159\u00e1k","year":"2024","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.artint.2026.104563_bib0040","series-title":"Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201910","first-page":"1029","article-title":"Scalable influence maximization for prevalent viral marketing in large-scale social networks","author":"Chen","year":"2010"},{"key":"10.1016\/j.artint.2026.104563_bib0041","series-title":"Proceedings of the 11th SIAM International Conference on Data Mining, SDM \u201911","first-page":"379","article-title":"Influence maximization in social networks when negative opinions may emerge and propagate","author":"Chen","year":"2011"},{"issue":"7","key":"10.1016\/j.artint.2026.104563_bib0042","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0102199","article-title":"Polarity related influence maximization in signed social networks","volume":"9","author":"Li","year":"2014","journal-title":"PLOS ONE"},{"issue":"2","key":"10.1016\/j.artint.2026.104563_bib0043","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1109\/TNSE.2021.3065272","article-title":"On multi-cascade influence maximization: model, hardness and algorithmic framework","volume":"8","author":"Tong","year":"2021","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"2","key":"10.1016\/j.artint.2026.104563_bib0044","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1109\/TCSS.2018.2818661","article-title":"Distributed rumor blocking with multiple positive cascades","volume":"5","author":"Tong","year":"2018","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.artint.2026.104563_bib0045","series-title":"Proceedings of the 32nd Annual Conference on Neural Information Processing Systems, NeurIPS \u201918","first-page":"339","article-title":"On misinformation containment in online social networks","author":"Tong","year":"2018"},{"key":"10.1016\/j.artint.2026.104563_bib0046","series-title":"Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI \u201920","first-page":"3","article-title":"Balancing spreads of influence in a social network","author":"Becker","year":"2020"},{"key":"10.1016\/j.artint.2026.104563_bib0047","series-title":"Graph Theory","volume":"173","author":"Diestel","year":"2017"},{"key":"10.1016\/j.artint.2026.104563_bib0048","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"5","key":"10.1016\/j.artint.2026.104563_bib0049","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1007\/s00224-022-10100-0","article-title":"Target set selection parameterized by vertex cover and more","volume":"66","author":"Banerjee","year":"2022","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"10.1016\/j.artint.2026.104563_bib0050","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","article-title":"On the complexity of k-SAT","volume":"62","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.artint.2026.104563_bib0051","series-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP \u201918","first-page":"49:1","article-title":"Faster algorithms for integer programs with block structure","volume":"107","author":"Eisenbrand","year":"2018"},{"key":"10.1016\/j.artint.2026.104563_bib0052","series-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP \u201918","first-page":"85:1","article-title":"A parameterized strongly polynomial algorithm for block structured integer programs","volume":"107","author":"Kouteck\u00fd","year":"2018"},{"issue":"3","key":"10.1016\/j.artint.2026.104563_bib0053","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/3396855","article-title":"Voting and bribing in single-exponential time","volume":"8","author":"Knop","year":"2020","journal-title":"ACM Trans. Econ. Comput."},{"key":"10.1016\/j.artint.2026.104563_bib0054","series-title":"Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, MFCS \u201924","first-page":"29:1","article-title":"Equitable connected partition and structural parameters revisited: n-fold beats lenstra","author":"Bla\u017eej","year":"2024"},{"key":"10.1016\/j.artint.2026.104563_bib0055","article-title":"Sparsity: Graphs, Structures, and Algorithms","volume":"28","author":"Ne\u0161et\u0159il","year":"2012"},{"issue":"4","key":"10.1016\/j.artint.2026.104563_bib0056","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","article-title":"On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems","volume":"67","author":"Pietrzak","year":"2003","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.artint.2026.104563_bib0057","doi-asserted-by":"crossref","first-page":"85","DOI":"10.4086\/toc.2010.v006a005","article-title":"Can you beat treewidth?","volume":"6","author":"Marx","year":"2010","journal-title":"Theory Comput."},{"key":"10.1016\/j.artint.2026.104563_bib0058","series-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI \u201922","first-page":"12919","article-title":"Controlling the spread of two secrets in diverse social networks (Student abstract)","author":"Bla\u017eej","year":"2022"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370226000895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370226000895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T21:58:39Z","timestamp":1783115919000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370226000895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":58,"alternative-id":["S0004370226000895"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2026.104563","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Balancing the spread of two opinions in sparse social networks","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2026.104563","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"104563"}}