{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:25:29Z","timestamp":1742919929969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_23","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"275-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Complexity of\u00a0Immunization in\u00a0the\u00a0Threshold Model"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"404","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Error and attack tolerance of complex networks. Nature 404, 378\u2013382 (2000)","journal-title":"Nature"},{"key":"23_CR2","doi-asserted-by":"publisher","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). ISSN 1572\u20135286. https:\/\/doi.org\/10.1016\/j.disopt.2010.09.007","DOI":"10.1016\/j.disopt.2010.09.007"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Chen, P., David, M., Kempe, D.: Better vaccination strategies for better people. In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, 7\u201311 June (2010)","DOI":"10.1145\/1807342.1807370"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-26626-8_15","volume-title":"Combinatorial Optimization and Applications","author":"G Cordasco","year":"2015","unstructured":"Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A.A., Vaccaro, U.: A fast and effective heuristic for discovering small target sets in social networks. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 193\u2013208. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_15"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Influence propagation over large scale social networks. In: Proceedings of ASONAM 2015, pp. 1531\u20131538 (2015)","DOI":"10.1145\/2808797.2808888"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0408-z","volume":"6","author":"G Cordasco","year":"2016","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: On finding small sets that influence large networks. Soc. Netw. Anal. Min. 6(1), 1\u201320 (2016). https:\/\/doi.org\/10.1007\/s13278-016-0408-z","journal-title":"Soc. Netw. Anal. Min."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2018.02.024","volume":"764","author":"G Cordasco","year":"2019","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Active influence spreading in social networks. Theoret. Comput. Sci. 764, 15\u201329 (2019)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1002\/net.21756","volume":"71","author":"G Cordasco","year":"2018","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A., Vaccaro, U.: Evangelism in social networks: algorithms and complexity. Networks 71(4), 346\u2013357 (2018)","journal-title":"Networks"},{"key":"23_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"23_CR10","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Ehard, S., Rautenbach, D.: Vaccinate your trees! Theoret. Comput. Sci. 772, 46\u201357 (2019). ISSN 0304\u20133975. https:\/\/doi.org\/10.1016\/j.tcs.2018.11.018","DOI":"10.1016\/j.tcs.2018.11.018"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/S0166-218X(02)00394-3","volume":"127","author":"U Feige","year":"2003","unstructured":"Feige, U., Krauthgamer, R., Nissim, K.: On cutting a few vertices from a graph. Discret. Appl. Math. 127, 643\u2013649 (2003)","journal-title":"Discret. Appl. Math."},{"key":"23_CR13","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."},{"key":"23_CR14","unstructured":"Feige, U., Kogan, S.: Target Set Selection for Conservative Population CoRR abs\/1909.03422 (2019)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-40313-2_38","volume-title":"Mathematical Foundations of Computer Science 2013","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Golovach, P.A., Korhonen, J.H.: On the parameterized complexity of cutting a few vertices from a graph. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 421\u2013432. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_38"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2014.11.029","volume":"566","author":"L Gargano","year":"2015","unstructured":"Gargano, L., Rescigno, A.A.: Complexity of conflict-free colorings of graphs. Theoret. Comput. Sci. 566, 39\u201349 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Gavenciak, T., Knop, D., Kouteck\u00fd, M.: Integer Programming in Parameterized Complexity: Three Miniatures. In Proceedings of IPEC 2018 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2018.21","DOI":"10.4230\/LIPIcs.IPEC.2018.21"},{"issue":"6","key":"23_CR19","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter, M.: Threshold models of collective behaviors. Am. J. Sociol. 83(6), 1420\u20131443 (1978)","journal-title":"Am. J. Sociol."},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11561071_19","volume-title":"Algorithms \u2013 ESA 2005","author":"A Hayrapetyan","year":"2005","unstructured":"Hayrapetyan, A., Kempe, D., P\u00e1l, M., Svitkina, Z.: Unbalanced graph cuts. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 191\u2013202. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_19"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Hanaka, T., Bodlaender, H.L., van der Zanden, T.C., Ono, H.: On the maximum weight minimal separator. Theor. Comput. Sci. 796, 294\u2013308 (2019)","DOI":"10.1016\/j.tcs.2019.09.025"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, USA, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"23_CR23","unstructured":"Khalil, E.B., Dilkina, B., Song, L.: CuttingEdge: influence minimization in networks. In: Methods, Models, and Applications at NIPS, Workshop on Frontiers of Network Analysis (2013)"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discovery Data 3(2) (2009)","DOI":"10.1145\/1514888.1514892"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375ISSN: 0302-9743"},{"key":"23_CR26","unstructured":"Knop, D., Kouteck\u00fd, M., Masar\u00edk, T., Toufar, T.: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. Logical Methods Comput. Sci. 15(4) (2019)"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-33293-7_23","volume-title":"Parameterized and Exact Computation","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Sorge, M.: Finding dense subgraphs of sparse graphs. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 242\u2013251. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33293-7_23"},{"key":"23_CR28","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64, 19\u201337 (2012)","journal-title":"Algorithmica"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Menczer, F., Fortunato, S., Davis, C.A.: A First Course in Network Science, 1st edn. Cambridge University Press (2020)","DOI":"10.1017\/9781108653947"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Forrest, S., Balthrop, J.: Email networks and the spread of computer viruses. Phys. Rev. E 66 (2002)","DOI":"10.1103\/PhysRevE.66.035101"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","DOI":"10.1016\/0196-6774(86)90023-4"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:07:16Z","timestamp":1647389236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","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":"30","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":"0","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":"34% - 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":"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-9","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}