{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:40:49Z","timestamp":1762908049886,"version":"3.45.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031929342"},{"type":"electronic","value":"9783031929359"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92935-9_16","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:07:14Z","timestamp":1747454834000},"page":"249-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Burning Path-Like and\u00a0Clique-Like Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3862-6322","authenticated-orcid":false,"given":"Radhika","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2174-0051","authenticated-orcid":false,"given":"Pradeesha","family":"Ashok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6521-9328","authenticated-orcid":false,"given":"Dhairya","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ashok, P., Das, S., Kanesh, L., Saurabh, S., Tomar, A., Verma, S.: Burn and win. In: Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, 7\u201310, June 2023, Proceedings. Lecture Notes in Computer Science, vol. 13889, pp. 36\u201348. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-34347-6_4"},{"key":"16_CR2","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":"16_CR3","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.) Algorithms and Models for the Web Graph, pp. 13\u201322. Springer, Cham (2014)"},{"issue":"1\u20132","key":"16_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":"16_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-14812-6_6","volume-title":"Theory and Applications of Models of Computation","author":"A Bonato","year":"2019","unstructured":"Bonato, A., Kamali, S.: Approximation algorithms for graph burning. In: Gopal, T., Watada, J. (eds.) Theory and Applications of Models of Computation, pp. 74\u201392. Springer, Cham (2019)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2018.05.035","volume":"794","author":"A Bonato","year":"2019","unstructured":"Bonato, A., Lidbetter, T.: Bounds on the burning numbers of spiders and path-forests. Theor. Comput. Sci. 794, 12\u201319 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3392720","volume":"16","author":"D Chakrabarty","year":"2020","unstructured":"Chakrabarty, D., Goyal, P., Krishnaswamy, R.: The non-uniform k-center problem. ACM Trans. Algorithms (TALG) 16(4), 1\u201319 (2020)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.dam.2025.02.004","volume":"367","author":"J Courtiel","year":"2025","unstructured":"Courtiel, J., Dorbec, P., Gima, T., Lecoq, R., Otachi, Y.: Orientable burning number of graphs. Discret. Appl. Math. 367, 116\u2013128 (2025)","journal-title":"Discret. Appl. Math."},{"key":"16_CR9","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, Cham (2015)"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"07","key":"16_CR11","doi-asserted-by":"publisher","first-page":"2350096","DOI":"10.1142\/S1793830923500969","volume":"16","author":"RK Gautam","year":"2024","unstructured":"Gautam, R.K., Kare, A.S., Bhavani, S.D.: Approximation algorithms for the graph burning on cactus and directed trees. Discret. Math. Algorithms Appl. 16(07), 2350096 (2024)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.dam.2023.03.026","volume":"336","author":"B Gorain","year":"2023","unstructured":"Gorain, B., Gupta, A.T., Lokhande, S.A., Mondal, K., Pandit, S.: Burning and w-burning of geometric graphs. Discret. Appl. Math. 336, 83\u201398 (2023)","journal-title":"Discret. Appl. Math."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Hiller, M., Koster, A.M., Triesch, E.: On the burning number of p-caterpillars. In: Graphs and Combinatorial Optimization: From Theory to Applications: CTW2020 Proceedings, pp. 145\u2013156. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-63072-0_12"},{"key":"16_CR14","unstructured":"Inamdar, T., Varadarajan, K.: Non-uniform $$ k $$-center and greedy clustering. arXiv preprint arXiv:2111.06362 (2021)"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Janssen, R.: The burning number of directed graphs: bounds and computational complexity. Theory Appl. Graphs 7, 1\u201314 (2020). https:\/\/doi.org\/10.20429\/tag.2020.070108","DOI":"10.20429\/tag.2020.070108"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Jia, X., Rohwedder, L., Sheth, K., Svensson, O.: Towards non-uniform k-center with constant types of radii*. In: Symposium on Simplicity in Algorithms (SOSA), pp. 228\u2013237. SIAM (2022)","DOI":"10.1137\/1.9781611977066.16"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Kare, A.S., Vinod\u00a0Reddy, I.: Parameterized algorithms for graph burning problem. In: International Workshop on Combinatorial Algorithms, pp. 304\u2013314. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-25005-8_25"},{"issue":"8","key":"16_CR18","doi-asserted-by":"publisher","first-page":"2379","DOI":"10.1007\/s00453-022-00962-8","volume":"84","author":"Y Kobayashi","year":"2022","unstructured":"Kobayashi, Y., Otachi, Y.: Parameterized complexity of graph burning. Algorithmica 84(8), 2379\u20132393 (2022)","journal-title":"Algorithmica"},{"key":"16_CR19","first-page":"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.) Algorithms and Models for the Web Graph, pp. 1\u20138. Springer, Cham (2016)"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-031-18367-6_2","volume-title":"Approximation and Online Algorithms","author":"M Lieskovsk\u00fd","year":"2022","unstructured":"Lieskovsk\u00fd, M., Sgall, J.: Graph burning and non-uniform k-centers for small treewidth. In: Chalermsook, P., Laekhanukit, B. (eds.) Approximation and Online Algorithms, pp. 20\u201335. Springer, Cham (2022)"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Lieskovsk\u00fd, M., Sgall, J., Feldmann, A.E.: Approximation algorithms and lower bounds for graph burning. In: Megow, N., Smith, A. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0275, pp. 9:1\u20139:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2023.9. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.APPROX\/RANDOM.2023.9","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2023.9"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Norin, S., Turcotte, J.: The burning number conjecture holds asymptotically. J. Comb. Theory Ser. B 168, 208\u2013235 (2024). https:\/\/doi.org\/10.1016\/j.jctb.2024.05.003. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S009589562400042X","DOI":"10.1016\/j.jctb.2024.05.003"},{"key":"16_CR23","unstructured":"Roshanbin, E.: Burning a graph as a model for the spread of social contagion. Ph.D. thesis, Dalhousie University Halifax (2016)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92935-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:37:18Z","timestamp":1762907838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92935-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929342","9783031929359"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92935-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}