{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:43:37Z","timestamp":1755222217350,"version":"3.43.0"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032002808","type":"print"},{"value":"9783032002815","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-00281-5_21","type":"book-chapter","created":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:34Z","timestamp":1754825914000},"page":"360-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for\u00a0Burning Schedule Reconfiguration Problem on\u00a0Path Forests"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1370-5240","authenticated-orcid":false,"given":"Astuki","family":"Nagao","sequence":"first","affiliation":[]},{"given":"Sawako","family":"Ogawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Anthony Bonato, Jeannette Janssen, and Elham Roshanbin: Burning a graph as a model of social contagion. International Workshop on Algorithms and Models for the Web-Graph, pp. 13\u201322. Springer, 2014","DOI":"10.1007\/978-3-319-13123-8_2"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Dieter Mitsche, Pawe\u0142 Pra\u0142at, and Elham Roshanbin: Burning number of graph products. Theoretical Computer Science, vol. 746, pp.124\u2013135. Elsevier 2018","DOI":"10.1016\/j.tcs.2018.06.036"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Anthony Bonato and Thomas Lidbetter: Bounds on the burning numbers of spiders and path forests. Theoretical Computer Science, vol. 794, pp.12\u201319. Elsevier, 2019","DOI":"10.1016\/j.tcs.2018.05.035"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, and Elham Roshanbin: Burning a graph is hard. Discrete Applied Mathmatics, vol. 232, pp. 73\u201387. Elsevier, 2017","DOI":"10.1016\/j.dam.2017.07.016"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Debajyoti Mondal, N. Parthiban,V. Kavitha, and I. Rajasingh : APX-hardness and approximation for the k-burning number problem. International Workshop on Algorithms and Computation, pp.272-283. Springer, 2021","DOI":"10.1007\/978-3-030-68211-8_22"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"P.\u00a0Gopalan, P.\u00a0G.\u00a0Kolaitis, E.\u00a0N.\u00a0Maneva, and C.\u00a0H.\u00a0Papadimitriou: The connectivity of boolean satisfiability: Computational and structural dichotomies. SIAM Journal on Computing, vol. 38(6), pp. 2330\u20132355. SIAM, 2009","DOI":"10.1137\/07070440X"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Takehiro Ito, Erik D Demaine, Nicholas JA Harvey, Christos H Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno: On the complexity of reconfiguration problems. Theoretical Computer Science, vol. 412(12\u201314), pp. 1054\u20131065. Elsevier 2011","DOI":"10.1016\/j.tcs.2010.12.005"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Yasuaki Kobayashi, and Yota Otachi : Parameterized complexity of graph burning. Algorithmica, pp.1\u201315. Springer, 2022","DOI":"10.1007\/s00453-022-00962-8"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00281-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:35Z","timestamp":1754825915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00281-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,11]]},"ISBN":["9783032002808","9783032002815"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00281-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/JCDCGG\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}