{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:51:04Z","timestamp":1775011864133,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T00:00:00Z","timestamp":1440720000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10878-015-9947-x","type":"journal-article","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T04:14:39Z","timestamp":1440648879000},"page":"1182-1195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Reconfiguration of dominating sets"],"prefix":"10.1007","volume":"32","author":[{"given":"Akira","family":"Suzuki","sequence":"first","affiliation":[]},{"given":"Amer E.","family":"Mouawad","sequence":"additional","affiliation":[]},{"given":"Naomi","family":"Nishimura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"9947_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.endm.2013.10.040","volume":"44","author":"M Bonamy","year":"2013","unstructured":"Bonamy M, Bousquet N (2013) Recoloring bounded treewidth graphs. Electron Notes Discret Math 44:257\u2013262","journal-title":"Electron Notes Discret Math"},{"key":"9947_CR2","doi-asserted-by":"crossref","unstructured":"Bonsma P (2012) The complexity of rerouting shortest paths. In: Proceedings of the mathematical foundations of computer science, pp 222\u2013233","DOI":"10.1007\/978-3-642-32589-2_22"},{"key":"9947_CR3","doi-asserted-by":"crossref","unstructured":"Bonsma P (2014) Independent set reconfiguration in cographs. In: Proceedings of the 40th international workshop on graph-theoretic concepts in computer science. Lecture notes in computer science, vol. 8747. Springer, Berlin, pp 105\u2013116","DOI":"10.1007\/978-3-319-12340-0_9"},{"issue":"50","key":"9947_CR4","doi-asserted-by":"crossref","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","volume":"410","author":"P Bonsma","year":"2009","unstructured":"Bonsma P, Cereceda L (2009) Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor Comput Sci 410(50):5215\u20135226","journal-title":"Theor Comput Sci"},{"issue":"56","key":"9947_CR5","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.disc.2007.07.028","volume":"308","author":"L Cereceda","year":"2008","unstructured":"Cereceda L, van den Heuvel J, Johnson M (2008) Connectedness of the graph of vertex-colourings. Discret Math 308(56):913\u2013919","journal-title":"Discret Math"},{"issue":"7","key":"9947_CR6","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.ejc.2009.03.011","volume":"30","author":"L Cereceda","year":"2009","unstructured":"Cereceda L, van den Heuvel J, Johnson M (2009) Mixing 3-colourings in bipartite graphs. Eur J Comb 30(7):1593\u20131606","journal-title":"Eur J Comb"},{"issue":"1","key":"9947_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.20514","volume":"67","author":"L Cereceda","year":"2011","unstructured":"Cereceda L, van den Heuvel J, Johnson M (2011) Finding paths between 3-colorings. J Graph Theory 67(1):69\u201382","journal-title":"J Graph Theory"},{"key":"9947_CR8","doi-asserted-by":"crossref","unstructured":"Demaine ED, Demaine ML, Fox-Epstein E, Hoang DA, Ito T, Ono H, Otachi Y, Uehara R, Yamada T (2014) Polynomial-time algorithm for sliding tokens on trees. In: Proceedings of the 25th international symposium on algorithms and computation. Lecture notes in computer science, vol 8889. Springer, Berlin, pp 389\u2013400","DOI":"10.1007\/978-3-319-13075-0_31"},{"issue":"3","key":"9947_CR9","doi-asserted-by":"crossref","first-page":"517","DOI":"10.7151\/dmgt.1562","volume":"31","author":"G Fricke","year":"2011","unstructured":"Fricke G, Hedetniemi SM, Hedetniemi ST, Hutson KR (2011) $$\\gamma $$ \u03b3 -Graphs of graphs. Discuss Math Graph Theory 31(3):517\u2013531","journal-title":"Discuss Math Graph Theory"},{"issue":"6","key":"9947_CR10","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1137\/07070440X","volume":"38","author":"P Gopalan","year":"2009","unstructured":"Gopalan P, Kolaitis PG, Maneva EN, Papadimitriou C (2009) The connectivity of boolean satisfiability: computational and structural dichotomies. SIAM J Comput 38(6):2330\u20132355","journal-title":"SIAM J Comput"},{"issue":"3","key":"9947_CR11","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s00373-013-1302-3","volume":"30","author":"R Haas","year":"2014","unstructured":"Haas R, Seyffarth K (2014) The $$k$$ k -dominating graph. Graphs Comb 30(3):609\u2013617","journal-title":"Graphs Comb"},{"key":"9947_CR12","doi-asserted-by":"crossref","unstructured":"Haddadan A, Ito T, Mouawad AE, Nishimura N, Ono H, Suzuki A, Tebbal Y (2015) The complexity of dominating set reconfiguration. In: Proceedings of the 14th algorithms and data structures symposium","DOI":"10.1007\/978-3-319-21840-3_33"},{"issue":"1\u20132","key":"9947_CR13","doi-asserted-by":"crossref","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. Theor Comput Sci 343(1\u20132):72\u201396","journal-title":"Theor Comput Sci"},{"key":"9947_CR14","doi-asserted-by":"crossref","unstructured":"Ito T, Demaine ED (2011) Approximability of the subset sum reconfiguration problem. In: Proceedings of the 8th annual conference on theory and applications of models of computation, pp 58\u201369","DOI":"10.1007\/978-3-642-20877-5_7"},{"issue":"12\u201314","key":"9947_CR15","doi-asserted-by":"crossref","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. Theor Comput Sci 412(12\u201314):1054\u20131065","journal-title":"Theor Comput Sci"},{"key":"9947_CR16","doi-asserted-by":"crossref","unstructured":"Ito T, Kami\u0144ski M, Demaine ED (2012a) Reconfiguration of list edge-colorings in a graph. Discret Appl Math 160(15):2199\u20132207","DOI":"10.1016\/j.dam.2012.05.014"},{"key":"9947_CR17","doi-asserted-by":"crossref","unstructured":"Ito T, Kawamura K, Ono H, Zhou X (2012b) Reconfiguration of list L(2,1)-labelings in a graph. In: Proceedings of the 23rd international symposium on algorithms and computation, pp 34\u201343","DOI":"10.1007\/978-3-642-35261-4_7"},{"key":"9947_CR18","doi-asserted-by":"crossref","unstructured":"Ito T, Kaminski M, Ono H (2014a) Fixed-parameter tractability of token jumping on planar graphs. In: Proceedings of the 25th international symposium on algorithms and computation. Lecture notes in computer science, vol 8889. Springer, Berlin, pp 208\u2013219","DOI":"10.1007\/978-3-319-13075-0_17"},{"key":"9947_CR19","doi-asserted-by":"crossref","unstructured":"Ito T, Kaminski M, Ono H, Suzuki A, Uehara R, Yamanaka K (2014b) On the parameterized complexity for token jumping on graphs. In: Theory and applications of models of computation. Lecture notes in computer science, vol 8402. Springer, Berlin, pp 341\u2013351","DOI":"10.1007\/978-3-319-06089-7_24"},{"key":"9947_CR20","doi-asserted-by":"crossref","unstructured":"Ito T, Nooka H, Zhou X (2015) Reconfiguration of vertex covers in a graph. In: Proceedings of the 25th international workshop on combinatorial algorithms. Lecture notes in computer science, vol 8986. Springer, Berlin, pp 164\u2013175","DOI":"10.1007\/978-3-319-19315-1_15"},{"key":"9947_CR21","doi-asserted-by":"crossref","unstructured":"Johnson M, Kratsch D, Kratsch S, Patel V, Paulusma D (2014) Finding shortest paths between graph colourings. In: Proceedings of the 9th international symposium on parameterized and exact computation. Lecture notes in computer science, vol 8894. Springer, Berlin, pp 221\u2013233","DOI":"10.1007\/978-3-319-13524-3_19"},{"issue":"39","key":"9947_CR22","doi-asserted-by":"crossref","first-page":"5205","DOI":"10.1016\/j.tcs.2011.05.021","volume":"412","author":"M Kami\u0144ski","year":"2011","unstructured":"Kami\u0144ski M, Medvedev P, Milani\u010d M (2011) Shortest paths between shortest paths. Theor Comput Sci 412(39):5205\u20135210","journal-title":"Theor Comput Sci"},{"key":"9947_CR23","doi-asserted-by":"crossref","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. Theor Comput Sci 439:9\u201315","journal-title":"Theor Comput Sci"},{"key":"9947_CR24","doi-asserted-by":"crossref","unstructured":"Lokshtanov D, Mouawad AE, Panolan F, Ramanujan M, Saurabh S (2015) Reconfiguration on sparse graphs. In: Proceedings of the 14th algorithms and data structures symposium","DOI":"10.1007\/978-3-319-21840-3_42"},{"issue":"4","key":"9947_CR25","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01305236","volume":"12","author":"EW Mayr","year":"1992","unstructured":"Mayr EW, Plaxton CG (1992) On the spanning trees of weighted graphs. Combinatorica 12(4):433\u2013447","journal-title":"Combinatorica"},{"key":"9947_CR26","doi-asserted-by":"crossref","unstructured":"Mouawad AE, Nishimura N, Raman V, Simjour N, Suzuki A (2013) On the parameterized complexity of reconfiguration problems. In: Proceedings of the 8th international symposium on parameterized and exact computation, pp 281\u2013294","DOI":"10.1007\/978-3-319-03898-8_24"},{"key":"9947_CR27","doi-asserted-by":"crossref","unstructured":"Mouawad AE, Nishimura N, Raman V (2014) Vertex cover reconfiguration and beyond. In: Proceedings of the 25th international symposium on algorithms and computation. Lecture notes in computer science, vol 8889. Springer, Berlin, pp 452\u2013463","DOI":"10.1007\/978-3-319-13075-0_36"},{"key":"9947_CR28","first-page":"127","volume":"2013","author":"J Heuvel van den","year":"2013","unstructured":"van den Heuvel J (2013) The complexity of change. Surv Comb 2013:127\u2013160","journal-title":"Surv Comb"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9947-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9947-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9947-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9947-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:27Z","timestamp":1559276607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9947-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,28]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9947"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9947-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,28]]}}}