{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:04:25Z","timestamp":1755219865050,"version":"3.43.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"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-981-96-1090-7_22","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:13Z","timestamp":1741105993000},"page":"264-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of\u00a0Distance-r Dominating Set Reconfiguration"],"prefix":"10.1007","author":[{"given":"Niranka","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8635-8462","authenticated-orcid":false,"given":"Duc A.","family":"Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"22_CR1","unstructured":"Banerjee, N., Hoang, D.A.: The complexity of distance-$$r$$ dominating set reconfiguration. arXiv preprint arXiv:2310.00241 (2023)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2021.05.014","volume":"301","author":"M Bonamy","year":"2021","unstructured":"Bonamy, M., Dorbec, P., Ouvrard, P.: Dominating sets reconfiguration under token sliding. Discret. Appl. Math. 301, 6\u201318 (2021). https:\/\/doi.org\/10.1016\/j.dam.2021.05.014","journal-title":"Discret. Appl. Math."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-030-86593-1_8","volume-title":"Fundamentals of Computation Theory","author":"N Bousquet","year":"2021","unstructured":"Bousquet, N., Joffard, A.: TS-reconfiguration of dominating sets in circle and circular-arc graphs. In: Bampis, E., Pagourtzis, A. (eds.) FCT 2021. LNCS, vol. 12867, pp. 114\u2013134. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86593-1_8"},{"key":"22_CR4","unstructured":"Bousquet, N., Mouawad, A.E., Nishimura, N., Siebertz, S.: A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. arXiv preprint arXiv:2204.10526 (2022)"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Dragan, F., Chepoi, V., Voloshin, V.: Dually chordal graphs. SIAM J. Discret. Math. 11(3), 437\u2013455 (1998). https:\/\/doi.org\/10.1137\/S0895480193253415","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/0605034","volume":"5","author":"GJ Chang","year":"1984","unstructured":"Chang, G.J., Nemhauser, G.L.: The $$k$$-domination and $$k$$-stability problems on sun-free chordal graphs. SIAM J. Algebraic Discrete Methods 5(3), 332\u2013345 (1984). https:\/\/doi.org\/10.1137\/0605034","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1007\/s00373-020-02174-9","volume":"36","author":"M DeVos","year":"2020","unstructured":"DeVos, M., Dyck, A., Jedwab, J., Simon, S.: Which graphs occur as $$\\gamma $$-graphs? Graphs Comb. 36(4), 1219\u20131246 (2020). https:\/\/doi.org\/10.1007\/s00373-020-02174-9","journal-title":"Graphs Comb."},{"key":"22_CR8","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, 5th edn., vol.\u00a0173. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2016.08.016","volume":"651","author":"A Haddadan","year":"2016","unstructured":"Haddadan, A., et al.: The complexity of dominating set reconfiguration. Theoret. Comput. Sci. 651, 37\u201349 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.08.016","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"22_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RA Hearn","year":"2005","unstructured":"Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoret. Comput. Sci. 343(1\u20132), 72\u201396 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.05.008","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Henning, M.A.: Distance Domination in Graphs, Developments in Mathematics, vol.\u00a064, pp. 205\u2013250. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51117-3_7","DOI":"10.1007\/978-3-030-51117-3_7"},{"issue":"12\u201314","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., et al.: On the complexity of reconfiguration problems. Theoret. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.12.005","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"K\u0159i\u0161t\u2019an, J.M., Svoboda, J.: Shortest dominating set reconfiguration under token sliding. In: Fernau, H., Jansen, K. (eds.) Proceedings of FCT 2023. LNCS, vol. 14292, pp. 333\u2013347. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43587-4_24","DOI":"10.1007\/978-3-031-43587-4_24"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jcss.2018.02.004","volume":"95","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Mouawad, A.E., Panolan, F., Ramanujan, M.S., Saurabh, S.: Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95, 122\u2013131 (2018). https:\/\/doi.org\/10.1016\/j.jcss.2018.02.004","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"A Meir","year":"1975","unstructured":"Meir, A., Moon, J.: Relations between packing and covering numbers of a tree. Pac. J. Math. 61(1), 225\u2013233 (1975). https:\/\/doi.org\/10.2140\/pjm.1975.61.225","journal-title":"Pac. J. Math."},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00453-016-0159-2","volume":"78","author":"AE Mouawad","year":"2017","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. Algorithmica 78(1), 274\u2013297 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0159-2","journal-title":"Algorithmica"},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"Mynhardt, C., Nasserasr, S.: Reconfiguration of colourings and dominating sets in graphs. In: Chung, F., Graham, R., Hoffman, F., Mullin, R.C., Hogben, L., West, D.B. (eds.) 50 years of Combinatorics, Graph Theory, and Computing, 1st edn., pp. 171\u2013191. CRC Press (2019). https:\/\/doi.org\/10.1201\/9780429280092-10","DOI":"10.1201\/9780429280092-10"},{"issue":"4","key":"22_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018). https:\/\/doi.org\/10.3390\/a11040052","journal-title":"Algorithms"},{"key":"22_CR19","doi-asserted-by":"publisher","unstructured":"Siebertz, S.: Reconfiguration on nowhere dense graph classes. Electron. J. Comb. 25(3), P3.24 (2018). https:\/\/doi.org\/10.37236\/7458","DOI":"10.37236\/7458"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"van den Heuvel, J.: The complexity of change. In: Surveys in Combinatorics, London Mathematical Society Lecture Note Series, vol.\u00a0409, pp. 127\u2013160. Cambridge University Press (2013). https:\/\/doi.org\/10.1017\/cbo9781139506748.005","DOI":"10.1017\/cbo9781139506748.005"},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"van der Zanden, T.C.: Parameterized complexity of graph constraint logic. In: Proceedings of IPEC 2015. LIPIcs, vol.\u00a043, pp. 282\u2013293. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2015.282","DOI":"10.4230\/LIPIcs.IPEC.2015.282"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T11:50:32Z","timestamp":1754567432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_22","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":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}