{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:32:57Z","timestamp":1762918377199,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343469"},{"type":"electronic","value":"9783031343476"}],"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-34347-6_4","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"36-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Burn and\u00a0Win"],"prefix":"10.1007","author":[{"given":"Pradeesha","family":"Ashok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayani","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avi","family":"Tomar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaily","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.dam.2017.07.016","volume":"232","author":"S Bessy","year":"2017","unstructured":"Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Burning a graph is hard. Discret. Appl. Math. 232, 73\u201387 (2017)","journal-title":"Discret. Appl. Math."},{"key":"4_CR2","unstructured":"Bonato, A.: A survey of graph burning. arXiv preprint arXiv:2009.10642 (2020)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-13123-8_2","volume-title":"Algorithms and Models for the Web Graph","author":"A Bonato","year":"2014","unstructured":"Bonato, A., Janssen, J., Roshanbin, E.: Burning a graph as a model of social contagion. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) WAW 2014. LNCS, vol. 8882, pp. 13\u201322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13123-8_2"},{"issue":"1\u20132","key":"4_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1080\/15427951.2015.1103339","volume":"12","author":"A Bonato","year":"2016","unstructured":"Bonato, A., Janssen, J., Roshanbin, E.: How to burn a graph. Internet Math. 12(1\u20132), 85\u2013100 (2016)","journal-title":"Internet Math."},{"key":"4_CR5","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, vol. 5. Springer, Heidelberg (2015)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275\u2013291 (2000)","journal-title":"Algorithmica"},{"key":"4_CR7","unstructured":"Gupta, A.T., Lokhande, S.A., Mondal, K.: NP-completeness results for graph burning on geometric graphs. arXiv preprint arXiv:2003.07746 (2020)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-030-63072-0_12","volume-title":"Graphs and Combinatorial Optimization: from Theory to Applications","author":"M Hiller","year":"2021","unstructured":"Hiller, M., Koster, A.M., Triesch, E.: On the burning number of $$p$$-caterpillars. In: Gentile, C., Stecca, G., Ventura, P. (eds.) Graphs and Combinatorial Optimization: from Theory to Applications, pp. 145\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-63072-0_12"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Janssen, R.: The burning number of directed graphs: bounds and computational complexity. arXiv preprint arXiv:2001.03381 (2020)","DOI":"10.20429\/tag.2020.070108"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-030-25005-8_25","volume-title":"Combinatorial Algorithms","author":"AS Kare","year":"2019","unstructured":"Kare, A.S., Vinod Reddy, I.: Parameterized algorithms for graph burning problem. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 304\u2013314. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_25"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Otachi, Y.: Parameterized complexity of graph burning. Algorithmica 1\u201315 (2022)","DOI":"10.1007\/s00453-022-00962-8"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-49787-7_1","volume-title":"Algorithms and Models for the Web Graph","author":"MR Land","year":"2016","unstructured":"Land, M.R., Lu, L.: An upper bound on the burning number of graphs. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) WAW 2016. LNCS, vol. 10088, pp. 1\u20138. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49787-7_1"},{"key":"4_CR13","unstructured":"Roshanbin, E.: Burning a graph as a model for the spread of social contagion. Ph.D. thesis, Dalhousie University (2016)"}],"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-34347-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T14:07:19Z","timestamp":1712758039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_4","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":"3 June 2023","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":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","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":"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":"33","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":"38% - 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.04","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.69","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)"}}]}}