{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:49:43Z","timestamp":1742964583924,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_20","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"264-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Broadcast Domination and Multipacking in\u00a0Digraphs"],"prefix":"10.1007","author":[{"given":"Florent","family":"Foucaud","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Gras","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Perez","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Sikora","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"issue":"1","key":"20_CR1","first-page":"86","volume":"71","author":"L Beaudou","year":"2019","unstructured":"Beaudou, L., Brewster, R.C., Foucaud, F.: Broadcast domination and multipacking: bounds and the integrality gap. Australas. J. Comb. 71(1), 86\u201397 (2019)","journal-title":"Australas. J. Comb."},{"key":"20_CR2","unstructured":"Blair, J.R.S., Heggernes, P., Horton, S., Manne, F.: Broadcast domination algorithms for interval graphs, series-parallel graphs, and trees. In: Proceedings of the 35th South-eastern International Conference on Combinatorics, Graph Theory, and Computing. Congressus Numerantium, vol. 169, pp. 55\u201377 (2004)"},{"issue":"35","key":"20_CR3","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.dam.2018.08.021","volume":"261","author":"RC Brewster","year":"2019","unstructured":"Brewster, R.C., MacGillivray, G., Yang, F.: Broadcast domination and multipacking in strongly chordal graphs. Discrete Appl. Math. 261, 108\u2013118 (2019)","journal-title":"Discrete Appl. Math."},{"key":"20_CR5","first-page":"1334","volume":"11","author":"RC Brewster","year":"2013","unstructured":"Brewster, R.C., Mynhardt, C.M., Teshima, L.E.: New bounds for the broadcast domination number of a graph. Cent. Eur. J. Math. 11, 1334\u20131343 (2013)","journal-title":"Cent. Eur. J. Math."},{"key":"20_CR6","unstructured":"Casel, K.: Resolving Conflicts for lower-bounded clustering. In: 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, Helsinki, Finland, 20\u201324 August 2018, pp. 23:1\u201323:14 (2018)"},{"key":"20_CR7","unstructured":"Chang, R.Y., Peng, S.L.: A linear-time algorithm for broadcast domination problem on interval graphs. In: Proceedings of the 27th Workshop on Combinatorial Mathematics and Computation Theory, pp. 184\u2013188. Providence University Taichung, Taiwan (2010)"},{"key":"20_CR8","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, Switzerland (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1002\/net.20275","volume":"53","author":"J Dabney","year":"2009","unstructured":"Dabney, J., Dean, B.C., Hedetniemi, S.T.: A linear-time algorithm for broadcast domination in a tree. Networks 53(2), 160\u2013169 (2009)","journal-title":"Networks"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2650261","volume":"11","author":"M Dom","year":"2014","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and IDs. ACM Trans. Algorithms 11(2), 13:1\u201313:20 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.dam.2005.07.009","volume":"154","author":"JE Dunbar","year":"2006","unstructured":"Dunbar, J.E., Erwin, D.J., Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T.: Broadcasts in graphs. Discrete Appl. Math. 154(1), 59\u201375 (2006)","journal-title":"Discrete Appl. Math."},{"key":"20_CR12","first-page":"89","volume":"42","author":"DJ Erwin","year":"2004","unstructured":"Erwin, D.J.: Dominating broadcasts in graphs. Bull. ICA 42, 89\u2013105 (2004)","journal-title":"Bull. ICA"},{"key":"20_CR13","unstructured":"Erwin, D.J.: Cost domination in graphs. Ph.D. thesis, Western Michigan University (2001)"},{"key":"20_CR14","unstructured":"Foucaud, F., Gras, B., Perez, A., Sikora, F.: On the complexity of broadcast domination and multipacking in digraphs. CoRR abs\/2003.10570 (2020). https:\/\/arxiv.org\/abs\/2003.10570"},{"key":"20_CR15","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)"},{"key":"20_CR16","first-page":"19","volume":"94","author":"BL Hartnell","year":"2014","unstructured":"Hartnell, B.L., Mynhardt, C.M.: On the difference between broadcast and multipacking numbers of graphs. Utilitas Mathematica 94, 19\u201329 (2014)","journal-title":"Utilitas Mathematica"},{"issue":"24","key":"20_CR17","doi-asserted-by":"publisher","first-page":"3267","DOI":"10.1016\/j.disc.2006.06.013","volume":"306","author":"P Heggernes","year":"2006","unstructured":"Heggernes, P., Lokshtanov, D.: Optimal broadcast domination in polynomial time. Discrete Math. 306(24), 3267\u20133280 (2006)","journal-title":"Discrete Math."},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-30642-6_17","volume-title":"Computer Science \u2013 Theory and Applications","author":"P Heggernes","year":"2012","unstructured":"Heggernes, P., S\u00e6ther, S.H.: Broadcast domination on block graphs in linear time. In: Hirsch, E.A., Karhum\u00e4ki, J., Lepist\u00f6, A., Prilutskii, M. (eds.) CSR 2012. LNCS, vol. 7353, pp. 172\u2013183. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30642-6_17"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Hermelin, D., Wu, X.: Weak compositions and their applications to polynomial lower bounds for kernelization. In: SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 104\u2013113 (2012)","DOI":"10.1137\/1.9781611973099.9"},{"key":"20_CR20","volume-title":"Introduction to Combinatorial Mathematics","author":"CL Liu","year":"1968","unstructured":"Liu, C.L.: Introduction to Combinatorial Mathematics. McGraw-Hill, New York (1968)"},{"key":"20_CR21","unstructured":"Lokshtanov, D.: Broadcast domination. Master\u2019s thesis, University of Bergen (2007)"},{"key":"20_CR22","first-page":"227","volume":"104","author":"CM Mynhardt","year":"2017","unstructured":"Mynhardt, C.M., Teshima, L.E.: Broadcasts and multipackings in trees. Utilitas Mathematica 104, 227\u2013242 (2017)","journal-title":"Utilitas Mathematica"},{"key":"20_CR23","unstructured":"Ordyniak, S., Kreutzer, S.: Width-measures for directed graphs and algorithmic applications. In: Quantitative Graph Theory, pp. 195\u2013245. Chapman and Hall\/CRC (2014)"},{"key":"20_CR24","unstructured":"Teshima, L.: Broadcasts and multipackings in graphs. Master\u2019s thesis, University of Victoria (2012)"},{"key":"20_CR25","unstructured":"Yang, F.: New results on broadcast domination and multipacking. Master\u2019s thesis, University of Victoria (2015)"}],"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-030-48966-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:17:06Z","timestamp":1710256626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","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":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","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":"62","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":"48% - 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,8","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":"5,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 conference had to be postponed due to the COVID-19 pandemic","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}