{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:08:05Z","timestamp":1743066485062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"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-031-06678-8_22","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"299-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Harmless Sets in\u00a0Sparse Classes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7228-6640","authenticated-orcid":false,"given":"P\u00e5l Gr\u00f8n\u00e5s","family":"Drange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2410-6523","authenticated-orcid":false,"given":"Irene","family":"Muzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2354-3003","authenticated-orcid":false,"given":"Felix","family":"Reidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.disopt.2014.09.004","volume":"14","author":"C Bazgan","year":"2014","unstructured":"Bazgan, C., Chopin, M.: The complexity of finding harmless individuals in social networks. Discret. Optim. 14, 170\u2013182 (2014)","journal-title":"Discret. Optim."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $$c^k n$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","DOI":"10.1137\/130947374"},{"issue":"3","key":"22_CR3","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."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., et al.: Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the 2011 SIAM International Conference on Data Mining, pp. 379\u2013390. SIAM (2011)","DOI":"10.1137\/1.9781611972818.33"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00527ED1V01Y201308DTM037","volume":"5","author":"W Chen","year":"2013","unstructured":"Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and influence propagation in social networks. Synth. Lect. Data Manag. 5(4), 1\u2013177 (2013)","journal-title":"Synth. Lect. Data Manag."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"22_CR7","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, Heidelberg (2015)"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.T.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292\u2013302 (2008)","journal-title":"Comput. J."},{"key":"22_CR9","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2016","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 5th edn. Springer, Heidelberg (2016)","edition":"5"},{"key":"22_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 (2001)","DOI":"10.1145\/502512.502525"},{"key":"22_CR11","unstructured":"Drange, P.G., et al.: Kernelization and sparseness: the case of dominating set. In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. LIPIcs, vol. 47 pp. 31:1\u201331:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"7","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer Jr","year":"2009","unstructured":"Dreyer, P.A., Jr., 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)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"22_CR13","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.ejc.2012.12.004","volume":"34","author":"Z Dvo\u0159\u00e1k","year":"2013","unstructured":"Dvo\u0159\u00e1k, Z.: Constant-factor approximation of the domination number in sparse graphs. Eur. J. Comb. 34(5), 833\u2013840 (2013)","journal-title":"Eur. J. Comb."},{"key":"22_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets, vol. 8. Cambridge University Press, Cambridge (2010)"},{"key":"22_CR15","unstructured":"Einarson, C., Reidl, F.: A general kernelization technique for domination and independence problems in sparse classes. In: 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, Hong Kong, China, 14\u201318 December 2020 (Virtual Conference). LIPIcs, vol. 180, pp. 11:1\u201311:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/978-3-642-04128-0_63","volume-title":"Algorithms - ESA 2009","author":"FV Fomin","year":"2009","unstructured":"Fomin, F.V., Golovach, P., Thilikos, D.M.: Contraction bidimensionality: the accurate picture. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 706\u2013717. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_63"},{"key":"22_CR17","unstructured":"Gaikwad, A., Maity, S.: The harmless set problem. CoRR, abs\/2111.06267 (2021)"},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/3051095","volume":"64","author":"M Grohe","year":"2017","unstructured":"Grohe, M., Kreutzer, S., Siebertz, S.: Deciding first-order properties of nowhere dense graphs. J. ACM 64(3), 17:1-17:32 (2017)","journal-title":"J. ACM"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"D Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127\u20131138. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_91"},{"issue":"2","key":"22_CR21","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/3274652","volume":"15","author":"S Kreutzer","year":"2019","unstructured":"Kreutzer, S., Rabinovich, R., Siebertz, S.: Polynomial kernels and wideness properties of nowhere dense graph classes. ACM Trans. Algorithms 15(2), 24:1-24:19 (2019)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ejc.2006.07.013","volume":"29","author":"J Ne\u0161et\u0159il","year":"2008","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Grad and classes with bounded expansion I. Decompositions. Eur. J. Comb. 29(3), 760\u2013776 (2008)","journal-title":"Eur. J. Comb."},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Nguyen, N.P., Yan, G., Thai, M.T., Eidenbenz, S.: Containment of misinformation spread in online social networks. In: Proceedings of the 4th Annual ACM Web Science Conference, pp. 213\u2013222 (2012)","DOI":"10.1145\/2380718.2380746"},{"key":"22_CR25","unstructured":"Plotkin, S.A., Rao, S., Smith, W.D.: Shallow excluded minors and improved graph decompositions. In: Sleator, D.D. (ed.) Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, USA, 23\u201325 January 1994, pp. 462\u2013470. ACM\/SIAM (1994)"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ejc.2018.08.001","volume":"75","author":"F Reidl","year":"2019","unstructured":"Reidl, F., Villaamil, F.S., Stavropoulos, K.: Characterising bounded expansion by neighbourhood complexity. Eur. J. Comb. 75, 152\u2013168 (2019)","journal-title":"Eur. J. Comb."},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"key":"22_CR28","unstructured":"Roberts, F.S.: Graph-theoretical problems arising from defending against bioterrorism and controlling the spread of fires. In: Proceedings of the DIMACS\/DIMATIA\/Renyi Combinatorial Challenges Conference, Piscataway, NJ (2006)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:07:15Z","timestamp":1653779235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_22","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":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"41% - 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":"10","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)"}}]}}