{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:48:23Z","timestamp":1743025703430,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031322952"},{"type":"electronic","value":"9783031322969"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32296-9_5","type":"book-chapter","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:03:02Z","timestamp":1684191782000},"page":"68-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Establishing Herd Immunity is Hard Even in\u00a0Simple Geometric Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5048-773X","authenticated-orcid":false,"given":"Michal","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2588-5709","authenticated-orcid":false,"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8901-1942","authenticated-orcid":false,"given":"\u0160imon","family":"Schierreich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,16]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.dam.2017.11.007","volume":"237","author":"RT Ara\u00fajo","year":"2018","unstructured":"Ara\u00fajo, R.T., Sampaio, R.M., dos Santos, V.F., Szwarcfiter, J.L.: The convexity of induced paths of order three and applications: complexity aspects. Discret. Appl. Math. 237, 33\u201342 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.11.007","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"5_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 Optim. 8(1), 87\u201396 (2011). https:\/\/doi.org\/10.1016\/j.disopt.2010.09.007","journal-title":"Discrete Optim."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.dam.2019.01.022","volume":"260","author":"S Bessy","year":"2019","unstructured":"Bessy, S., Ehard, S., Penso, L.D., Rautenbach, D.: Dynamic monopolies for interval graphs with bounded thresholds. Discret. Appl. Math. 260, 256\u2013261 (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.01.022","journal-title":"Discret. Appl. Math."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bla\u017eej, V., Knop, D., Schierreich, \u0160.: Controlling the spread of two secrets in diverse social networks (student abstract). In: AAAI 2022, pp. 12919\u201312920. AAAI Press (2022). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/21596","DOI":"10.1609\/aaai.v36i11.21596"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1), 3\u201324 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97)00014-X","journal-title":"Comput. Geom."},{"issue":"3","key":"5_CR6","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. 23(3), 1400\u20131415 (2009). https:\/\/doi.org\/10.1137\/08073617X","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/s10878-012-9518-3","volume":"25","author":"CY 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). https:\/\/doi.org\/10.1007\/s10878-012-9518-3","journal-title":"J. Comb. Optim."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00224-013-9499-3","volume":"55","author":"M Chopin","year":"2013","unstructured":"Chopin, M., Nichterlein, A., Niedermeier, R., Weller, M.: Constant thresholds can make target set selection tractable. Theory Comput. Syst. 55(1), 61\u201383 (2013). https:\/\/doi.org\/10.1007\/s00224-013-9499-3","journal-title":"Theory Comput. Syst."},{"key":"5_CR9","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). https:\/\/doi.org\/10.1016\/j.tcs.2014.02.027","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1), 165\u2013177 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90358-O","journal-title":"Discrete Math."},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994). https:\/\/doi.org\/10.1137\/S0097539792225297","journal-title":"SIAM J. Comput."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-20533-0_7","volume-title":"Consensual Processes","author":"D Dimitrov","year":"2011","unstructured":"Dimitrov, D.: The social choice approach to group identification. In: Herrera-Viedma, E., Garc\u00eda-Lapresta, J.L., Kacprzyk, J., Fedrizzi, M., Nurmi, H., Zadro\u017cny, S. (eds.) Consensual Processes, pp. 123\u2013134. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20533-0_7"},{"issue":"7","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer","year":"2009","unstructured":"Dreyer, P.A., Roberts, F.S.: Irreversible $$k$$-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discret. Appl. Math. 157(7), 1615\u20131627 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.09.012","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/20M1337624","volume":"36","author":"P Dvo\u0159\u00e1k","year":"2022","unstructured":"Dvo\u0159\u00e1k, P., Knop, D., Toufar, T.: Target set selection in dense graph classes. SIAM J. Discrete Math. 36(1), 536\u2013572 (2022). https:\/\/doi.org\/10.1137\/20M1337624","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-019-09427-9","volume":"34","author":"G Erd\u00e9lyi","year":"2019","unstructured":"Erd\u00e9lyi, G., Reger, C., Yang, Y.: The complexity of bribery and control in group identification. Auton. Agent. Multi-Agent Syst. 34(1), 1\u201331 (2019). https:\/\/doi.org\/10.1007\/s10458-019-09427-9","journal-title":"Auton. Agent. Multi-Agent Syst."},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","volume":"1","author":"M Farber","year":"1982","unstructured":"Farber, M.: Independent domination in chordal graphs. Oper. Res. Lett. 1(4), 134\u2013138 (1982). https:\/\/doi.org\/10.1016\/0167-6377(82)90015-3","journal-title":"Oper. Res. Lett."},{"key":"5_CR17","first-page":"57","volume":"43","author":"S Finbow","year":"2009","unstructured":"Finbow, S., MacGillivray, G.: The firefighter problem: a survey of results, directions and questions. Australas. J. Comb. 43, 57\u201377 (2009)","journal-title":"Australas. J. Comb."},{"issue":"20","key":"5_CR18","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1016\/j.disc.2010.05.028","volume":"310","author":"H Fleischner","year":"2010","unstructured":"Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3- and 4-regular hamiltonian graphs. Discrete Math. 310(20), 2742\u20132749 (2010). https:\/\/doi.org\/10.1016\/j.disc.2010.05.028","journal-title":"Discrete Math."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2015.11.024","volume":"613","author":"FV Fomin","year":"2016","unstructured":"Fomin, F.V., Heggernes, P., van Leeuwen, E.J.: The firefighter problem on graph classes. Theor. Comput. Sci. 613, 38\u201350 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.11.024","journal-title":"Theor. Comput. Sci."},{"key":"5_CR20","first-page":"133","volume":"2","author":"T Gallai","year":"1959","unstructured":"Gallai, T.: \u00dcber extreme punkt- und kantenmengen. Ann. Univ. Sci. Budapest 2, 133\u2013138 (1959)","journal-title":"Ann. Univ. Sci. Budapest"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-73117-9_10","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"TA Hartmann","year":"2018","unstructured":"Hartmann, T.A.: Target set selection parameterized by clique-width and maximum threshold. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 137\u2013149. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73117-9_10"},{"key":"5_CR22","unstructured":"Hartnell, B.L.: Firefighter! an application of domination (1995)"},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P., Kratochv\u00edl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Math. 229(1), 101\u2013124 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00204-1","journal-title":"Discrete Math."},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Huson, M.L., Sen, A.: Broadcast scheduling algorithms for radio networks. In: MILCOM 1995, vol. 2, pp. 647\u2013651 (1995). https:\/\/doi.org\/10.1109\/MILCOM.1995.483546","DOI":"10.1109\/MILCOM.1995.483546"},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s00454-012-9394-8","volume":"47","author":"RJ Kang","year":"2012","unstructured":"Kang, R.J., M\u00fcller, T.: Sphere and dot product representations of graphs. Discrete Comput. Geom. 47(3), 548\u2013568 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9394-8","journal-title":"Discrete Comput. Geom."},{"key":"5_CR26","unstructured":"Kasher, A., Rubinstein, A.: On the question \u201cwho is a J?\u201d a social choice approach. Logique et Analyse 40(160), 385\u2013395 (1997)"},{"issue":"4","key":"5_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theory Comput. 11(4), 105\u2013147 (2015). https:\/\/doi.org\/10.4086\/toc.2015.v011a004","journal-title":"Theory Comput."},{"issue":"34\u201336","key":"5_CR28","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1016\/j.tcs.2010.05.015","volume":"411","author":"L Mathieson","year":"2010","unstructured":"Mathieson, L.: The parameterized complexity of editing graphs for bounded degeneracy. Theor. Comput. Sci. 411(34\u201336), 3181\u20133187 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.05.015","journal-title":"Theor. Comput. Sci."},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-46515-7_16","volume-title":"Discrete and Computational Geometry","author":"T Matsui","year":"2000","unstructured":"Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 194\u2013200. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46515-7_16"},{"issue":"2","key":"5_CR30","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). https:\/\/doi.org\/10.1007\/s13278-012-0067-7","journal-title":"Soc. Netw. Anal. Min."},{"key":"5_CR31","unstructured":"Peleg, D.: Majority voting, coalitions and monopolies in graphs. In: SIROCCO 1996, pp. 152\u2013169. Carleton Scientific (1996)"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-11440-3_22","volume-title":"WALCOM: Algorithms and Computation","author":"TVT Reddy","year":"2010","unstructured":"Reddy, T.V.T., Krishna, D.S., Rangan, C.P.: Variants of spreading messages. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 240\u2013251. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11440-3_22"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD 2002, pp. 61\u201370. ACM, New York (2002). https:\/\/doi.org\/10.1145\/775047.775057","DOI":"10.1145\/775047.775057"},{"issue":"02","key":"5_CR34","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 30(02), 135\u2013140 (1981). https:\/\/doi.org\/10.1109\/TC.1981.6312176","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"5_CR35","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s10458-018-9392-1","volume":"32","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Dimitrov, D.: How hard is it to control a group? Auton. Agent. Multi-Agent Syst. 32(5), 672\u2013692 (2018). https:\/\/doi.org\/10.1007\/s10458-018-9392-1","journal-title":"Auton. Agent. Multi-Agent Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32296-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:41:00Z","timestamp":1710268860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32296-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031322952","9783031322969"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32296-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.ryerson.ca\/waw2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"More than 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}