{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:48:20Z","timestamp":1774727300450,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP20H05967"],"award-info":[{"award-number":["JP20H05967"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015547","name":"University of Science, Vietnam National University, Hanoi","doi-asserted-by":"publisher","award":["TN.23.04"],"award-info":[{"award-number":["TN.23.04"]}],"id":[{"id":"10.13039\/100015547","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015548","name":"\u0110\u1ea1i h\u1ecdc Qu\u1ed1c gia H\u00e0 N\u1ed9i","doi-asserted-by":"publisher","award":["QG.25.07"],"award-info":[{"award-number":["QG.25.07"]}],"id":[{"id":"10.13039\/100015548","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10878-026-01406-7","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:12:30Z","timestamp":1772856750000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The complexity of distance-r dominating set reconfiguration"],"prefix":"10.1007","volume":"51","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","family":"A. Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,7]]},"reference":[{"key":"1406_CR1","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.dam.2022.06.006","volume":"320","author":"AK Abu-Affash","year":"2022","unstructured":"Abu-Affash AK, Carmi P, Krasin A (2022) A linear-time algorithm for minimum $$k$$-hop dominating set of a cactus graph. Discret Appl Math 320:488\u2013499. https:\/\/doi.org\/10.1016\/j.dam.2022.06.006","journal-title":"Discret Appl Math"},{"key":"1406_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 (2021) Dominating sets reconfiguration under token sliding. Discret Appl Math 301:6\u201318. https:\/\/doi.org\/10.1016\/j.dam.2021.05.014","journal-title":"Discret Appl Math"},{"key":"1406_CR3","doi-asserted-by":"publisher","unstructured":"Bonsma PS, Kami\u0144ski M, Wrochna M (2014) Reconfiguring Independent Sets in Claw-Free Graphs. In: Proceedings of SWAT 2014, Springer, LNCS, vol 8503, pp 86\u201397, https:\/\/doi.org\/10.1007\/978-3-319-08404-6_8","DOI":"10.1007\/978-3-319-08404-6_8"},{"key":"1406_CR4","doi-asserted-by":"publisher","unstructured":"Bousquet N, Joffard A (2021) TS-reconfiguration of dominating sets in circle and circular-arc graphs. In: Proceedings of FCT 2021, Springer, LNCS, vol 12867, https:\/\/doi.org\/10.1007\/978-3-030-86593-1_8","DOI":"10.1007\/978-3-030-86593-1_8"},{"key":"1406_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2024.100663","volume":"53","author":"N Bousquet","year":"2024","unstructured":"Bousquet N, Mouawad AE, Nishimura N, Siebertz S (2024) A survey on the parameterized complexity of reconfiguration problems. Computer Science Review 53:100663. https:\/\/doi.org\/10.1016\/j.cosrev.2024.100663","journal-title":"Computer Science Review"},{"issue":"3","key":"1406_CR6","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 (1998) Dually chordal graphs. SIAM J Discret Math 11(3):437\u2013455. https:\/\/doi.org\/10.1137\/S0895480193253415","journal-title":"SIAM J Discret Math"},{"issue":"3","key":"1406_CR7","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/0605034","volume":"5","author":"GJ Chang","year":"1984","unstructured":"Chang GJ, Nemhauser GL (1984) The $$k$$-domination and $$k$$-stability problems on sun-free chordal graphs. SIAM Journal on Algebraic Discrete Methods 5(3):332\u2013345. https:\/\/doi.org\/10.1137\/0605034","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"4","key":"1406_CR8","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 (2020) Which graphs occur as $$\\gamma $$-graphs? Graphs and Combinatorics 36(4):1219\u20131246. https:\/\/doi.org\/10.1007\/s00373-020-02174-9","journal-title":"Graphs and Combinatorics"},{"key":"1406_CR9","doi-asserted-by":"publisher","unstructured":"Diestel R (2017) Graph Theory, Graduate Texts in Mathematics, vol 173, 5th edn. Springer, https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"key":"1406_CR10","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. WH Freeman and Company"},{"key":"1406_CR11","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, Ito T, Mouawad AE, Nishimura N, Ono H, Suzuki A, Tebbal Y (2016) The complexity of dominating set reconfiguration. Theoret Comput Sci 651:37\u201349. https:\/\/doi.org\/10.1016\/j.tcs.2016.08.016","journal-title":"Theoret Comput Sci"},{"issue":"1\u20132","key":"1406_CR12","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RA Hearn","year":"2005","unstructured":"Hearn RA, Demaine ED (2005) 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. https:\/\/doi.org\/10.1016\/j.tcs.2005.05.008","journal-title":"Theoret Comput Sci"},{"key":"1406_CR13","doi-asserted-by":"publisher","unstructured":"Henning MA (2020) Distance Domination in Graphs, Developments in Mathematics, vol 64, Springer, pp 205\u2013250. https:\/\/doi.org\/10.1007\/978-3-030-51117-3_7","DOI":"10.1007\/978-3-030-51117-3_7"},{"key":"1406_CR14","doi-asserted-by":"publisher","unstructured":"Hoang DA (2023) On the complexity of distance-$$d$$ independent set reconfiguration. In: Lin BMT, Lin CC, Liotta G (eds) Proceedings of WALCOM 2023, LNCS, vol 13973, pp 254\u2013266. https:\/\/doi.org\/10.1007\/978-3-031-27051-2_22","DOI":"10.1007\/978-3-031-27051-2_22"},{"issue":"12\u201314","key":"1406_CR15","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, Demaine ED, Harvey NJA, Papadimitriou CH, Sideri M, Uehara R, Uno Y (2011) On the complexity of reconfiguration problems. Theoret Comput Sci 412(12\u201314):1054\u20131065. https:\/\/doi.org\/10.1016\/j.tcs.2010.12.005","journal-title":"Theoret Comput Sci"},{"key":"1406_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","volume":"439","author":"M Kami\u0144ski","year":"2012","unstructured":"Kami\u0144ski M, Medvedev P, Milani\u010d M (2012) Complexity of independent set reconfigurability problems. Theoret Comput Sci 439:9\u201315. https:\/\/doi.org\/10.1016\/j.tcs.2012.03.004","journal-title":"Theoret Comput Sci"},{"issue":"2","key":"1406_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ipl.2015.07.014","volume":"116","author":"S Kundu","year":"2016","unstructured":"Kundu S, Majumder S (2016) A linear time algorithm for optimal $$k$$-hop dominating set of a tree. Inf Process Lett 116(2):197\u2013202. https:\/\/doi.org\/10.1016\/j.ipl.2015.07.014","journal-title":"Inf Process Lett"},{"key":"1406_CR18","doi-asserted-by":"publisher","unstructured":"K\u0159i\u0161t\u2019an JM, Svoboda J (2023) Shortest dominating set reconfiguration under token sliding. In: Fernau H, Jansen K (eds) Proceedings of FCT 2023, Springer, LNCS, vol 14292, pp 333\u2013347. https:\/\/doi.org\/10.1007\/978-3-031-43587-4_24","DOI":"10.1007\/978-3-031-43587-4_24"},{"key":"1406_CR19","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 AE, Panolan F, Ramanujan MS, Saurabh S (2018) Reconfiguration on sparse graphs. J Comput Syst Sci 95:122\u2013131. https:\/\/doi.org\/10.1016\/j.jcss.2018.02.004","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"1406_CR20","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 (1975) Relations between packing and covering numbers of a tree. Pac J Math 61(1):225\u2013233. https:\/\/doi.org\/10.2140\/pjm.1975.61.225","journal-title":"Pac J Math"},{"issue":"1","key":"1406_CR21","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00453-016-0159-2","volume":"78","author":"AE Mouawad","year":"2017","unstructured":"Mouawad AE, Nishimura N, Raman V, Simjour N, Suzuki A (2017) On the parameterized complexity of reconfiguration problems. Algorithmica 78(1):274\u2013297. https:\/\/doi.org\/10.1007\/s00453-016-0159-2","journal-title":"Algorithmica"},{"key":"1406_CR22","doi-asserted-by":"publisher","unstructured":"Mynhardt C, Nasserasr S (2019) Reconfiguration of colourings and dominating sets in graphs. In: Chung F, Graham R, Hoffman F, Mullin RC, Hogben L, West DB (eds) 50 years of Combinatorics, Graph Theory, and Computing, 1st edn, CRC Press, pp 171\u2013191. https:\/\/doi.org\/10.1201\/9780429280092-10","DOI":"10.1201\/9780429280092-10"},{"issue":"4","key":"1406_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura N (2018) Introduction to reconfiguration Algorithms 11(4):52. https:\/\/doi.org\/10.3390\/a11040052","journal-title":"Introduction to reconfiguration Algorithms"},{"issue":"3","key":"1406_CR24","doi-asserted-by":"publisher","first-page":"P3.24","DOI":"10.37236\/7458","volume":"25","author":"S Siebertz","year":"2018","unstructured":"Siebertz S (2018) Reconfiguration on nowhere dense graph classes. Electron J Comb 25(3):P3.24. https:\/\/doi.org\/10.37236\/7458","journal-title":"Electron J Comb"},{"key":"1406_CR25","doi-asserted-by":"publisher","unstructured":"van den Heuvel J (2013) The complexity of change. In: Surveys in Combinatorics, London Mathematical Society Lecture Note Series, vol 409, Cambridge University Press, pp 127\u2013160. https:\/\/doi.org\/10.1017\/cbo9781139506748.005","DOI":"10.1017\/cbo9781139506748.005"},{"key":"1406_CR26","doi-asserted-by":"publisher","unstructured":"van der Zanden TC (2015) Parameterized complexity of graph constraint logic. In: Proceedings of IPEC 2015, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, LIPIcs, vol 43, pp 282\u2013293. https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2015.282","DOI":"10.4230\/LIPIcs.IPEC.2015.282"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01406-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01406-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01406-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:59:37Z","timestamp":1774724377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01406-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1406"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01406-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"19 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"25"}}