{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T22:42:09Z","timestamp":1773787329444,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030389185","type":"print"},{"value":"9783030389192","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38919-2_10","type":"book-chapter","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T17:03:18Z","timestamp":1579194198000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Burning Two Worlds"],"prefix":"10.1007","author":[{"given":"Shahin","family":"Kamali","sequence":"first","affiliation":[]},{"given":"Avery","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Kenny","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"key":"10_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.C.M., Rautenbach, D., Roshanbin, E.: Burning a graph is hard. Discrete Appl. Math. 232, 73\u201387 (2017)","journal-title":"Discrete Appl. Math."},{"key":"10_CR2","unstructured":"Bonato, A., Gunderson, K., Shaw, A.: Burning the plane: densities of the infinite cartesian grid. Preprint (2018)"},{"key":"10_CR3","first-page":"13","volume-title":"Lecture Notes in Computer Science","author":"Anthony Bonato","year":"2014","unstructured":"Bonato, A., Janssen, J.C.M., Roshanbin, E.: Burning a graph as a model of social contagion. In: Workshop of Workshop on Algorithms and Models for the Web Graph, pp. 13\u201322 (2014)"},{"issue":"1\u20132","key":"10_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.C.M., Roshanbin, E.: How to burn a graph. Internet Math. 12(1\u20132), 85\u2013100 (2016)","journal-title":"Internet Math."},{"key":"10_CR5","first-page":"74","volume-title":"Lecture Notes in Computer Science","author":"Anthony Bonato","year":"2019","unstructured":"Bonato, A., Kamali, S.: Approximation algorithms for graph burning. In: Theory and Applications of Models of Computation Conference (TAMC), pp. 74\u201392 (2019)"},{"key":"10_CR6","unstructured":"Bonato, A., Lidbetter, T.: Bounds on the burning numbers of spiders and path-forests. ArXiv e-prints, July 2017"},{"issue":"7415","key":"10_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1038\/nature11421","volume":"489","author":"RM Bond","year":"2012","unstructured":"Bond, R.M., et al.: A 61-million-person experiment in social influence and political mobilization. Nature 489(7415), 295\u2013298 (2012)","journal-title":"Nature"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-74180-2_13","volume-title":"Algorithms and Discrete Applied Mathematics","author":"S Das","year":"2018","unstructured":"Das, S., Dev, S.R., Sadhukhan, A., Sahoo, U., Sen, S.: Burning spiders. In: Panda, B.S., Goswami, P.P. (eds.) CALDAM 2018. LNCS, vol. 10743, pp. 155\u2013163. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-74180-2_13"},{"issue":"16","key":"10_CR10","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.disc.2005.12.060","volume":"307","author":"Y Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Math. 307(16), 2008\u20132029 (2007)","journal-title":"Discrete Math."},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s11067-013-9186-6","volume":"13","author":"D Fajardo","year":"2013","unstructured":"Fajardo, D., Gardner, L.M.: Inferring contagion patterns in social contact networks with limited infection data. Netw. Spat. Econ. 13(4), 399\u2013426 (2013)","journal-title":"Netw. Spat. Econ."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"PC Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Can. J. Math. 16, 539\u2013548 (1964)","journal-title":"Can. J. Math."},{"issue":"1\u20132","key":"10_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R Halin","year":"1976","unstructured":"Halin, R.: S-functions for graphs. J. Geom. 8(1\u20132), 171\u2013186 (1976)","journal-title":"J. Geom."},{"key":"10_CR15","unstructured":"Kamali, S., Miller, A., Zhang, K.: Burning two worlds: Algorithms for burning dense and tree-like graphs. CoRR abs\/1909.00530 (2019). \nhttp:\/\/arxiv.org\/abs\/1909.00530"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Kramer, A.D.I.: The spread of emotion via facebook. In: CHI Conference on Human Factors in Computing Systems, (CHI), pp. 767\u2013770 (2012)","DOI":"10.1145\/2207676.2207787"},{"issue":"24","key":"10_CR17","doi-asserted-by":"publisher","first-page":"8788","DOI":"10.1073\/pnas.1320040111","volume":"111","author":"A. D. I. Kramer","year":"2014","unstructured":"Kramer, A.D.I., Guillory, J.E., Hancock, J.T.: Experimental evidence of massive-scale emotional contagion through social networks. In: Proceedings of the National Academy of Sciences, pp. 8788\u20138790 (2014)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10_CR18","first-page":"1","volume-title":"Lecture Notes in Computer Science","author":"Max R. Land","year":"2016","unstructured":"Land, M.R., Lu, L.: An upper bound on the burning number of graphs. In: Proceedings of Workshop on Algorithms and Models for the Web Graph, pp. 1\u20138 (2016)"},{"key":"10_CR19","unstructured":"Leitert, A.: Tree-Breadth of Graphs with Variants and Applications. Ph.D. thesis, Kent State University, College of Arts and Sciences, Department of Computer Science (2017)"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.cam.2019.04.024","volume":"361","author":"H Liu","year":"2019","unstructured":"Liu, H., Zhang, R., Hu, X.: Burning number of theta graphs. Appl. Math. Comput. 361, 246\u2013257 (2019)","journal-title":"Appl. Math. Comput."},{"issue":"7","key":"10_CR21","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.dam.2009.10.007","volume":"158","author":"D Lokshtanov","year":"2010","unstructured":"Lokshtanov, D.: On the complexity of computing treelength. Discrete Appl. Math. 158(7), 820\u2013827 (2010). third Workshop on GraphClasses, Optimization, and Width Parameters Eugene, Oregon, USA, October 2007","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00373-017-1768-5","volume":"33","author":"D Mitsche","year":"2017","unstructured":"Mitsche, D., Pralat, P., Roshanbin, E.: Burning graphs: a probabilistic perspective. Graphs and Combinatorics 33(2), 449\u2013471 (2017)","journal-title":"Graphs and Combinatorics"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.tcs.2018.06.036","volume":"746","author":"D Mitsche","year":"2018","unstructured":"Mitsche, D., Pralat, P., Roshanbin, E.: Burning number of graph products. Theor. Comput. Sci. 746, 124\u2013135 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors iii planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"10_CR26","first-page":"1","volume":"6","author":"KA Sim","year":"2017","unstructured":"Sim, K.A., Tan, T.S., Wong, K.B.: On the burning number of generalized Petersen graphs. Bull. Malays. Math. Sci. Soc. 6, 1\u201314 (2017)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"10_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"issue":"16","key":"10_CR28","doi-asserted-by":"publisher","first-page":"3269","DOI":"10.3390\/app9163269","volume":"9","author":"M \u0160imon","year":"2019","unstructured":"\u0160imon, M., Huraj, L., Dirgova Lupt\u00e1kov\u00e1, I., Pospichal, J.: Heuristics for spreading alarm throughout a network. Appl. Sci. 9(16), 3269 (2019). \nhttps:\/\/doi.org\/10.3390\/app9163269","journal-title":"Appl. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2020: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38919-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T17:12:23Z","timestamp":1579194743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38919-2_10"}},"subtitle":["Algorithms for Burning Dense and Tree-Like Graphs"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389185","9783030389192"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38919-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","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":"20 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cyprusconferences.org\/sofsem2020\/","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":"125","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":"40","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":"17","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":"32% - 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":"2.9","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":"3.8","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)"}}]}}