{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:37Z","timestamp":1725796597458},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_35","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"405-416","source":"Crossref","is-referenced-by-count":5,"title":["Reconfiguration of Dominating Sets"],"prefix":"10.1007","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","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Bousquet, N.: Recoloring bounded treewidth graphs. In: Proc. of the 7th Latin-American Algorithms, Graphs, and Optimization Symp. (2013)","DOI":"10.1016\/j.endm.2013.10.040"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-32589-2_22","volume-title":"Mathematical Foundations of Computer Science 2012","author":"P. Bonsma","year":"2012","unstructured":"Bonsma, P.: The complexity of rerouting shortest paths. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 222\u2013233. Springer, Heidelberg (2012)"},{"issue":"50","key":"35_CR3","doi-asserted-by":"publisher","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","volume":"410","author":"P. Bonsma","year":"2009","unstructured":"Bonsma, P., Cereceda, L.: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci.\u00a0410(50), 5215\u20135226 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"56","key":"35_CR4","doi-asserted-by":"publisher","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.: Connectedness of the graph of vertex-colourings. Discrete Math\u00a0308(56), 913\u2013919 (2008)","journal-title":"Discrete Math"},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/jgt.20514","volume":"67","author":"L. Cereceda","year":"2011","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Finding paths between 3-colorings. J. of Graph Theory\u00a067(1), 69\u201382 (2011)","journal-title":"J. of Graph Theory"},{"issue":"7","key":"35_CR6","doi-asserted-by":"publisher","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.: Mixing 3-colourings in bipartite graphs. European J. of Combinatorics\u00a030(7), 1593\u20131606 (2009)","journal-title":"European J. of Combinatorics"},{"key":"35_CR7","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1997","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1997)"},{"issue":"3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.7151\/dmgt.1562","volume":"31","author":"G. Fricke","year":"2011","unstructured":"Fricke, G., Hedetniemi, S.M., Hedetniemi, S.T., Hutson, K.R.: \u03b3-Graphs of Graphs. Discussiones Mathematicae Graph Theory\u00a031(3), 517\u2013531 (2011)","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"6","key":"35_CR9","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1137\/07070440X","volume":"38","author":"P. Gopalan","year":"2009","unstructured":"Gopalan, P., Kolaitis, P.G., Maneva, E.N., Papadimitriou, C.H.: The connectivity of boolean satisfiability: computational and structural dichotomies. SIAM J. on Computing\u00a038(6), 2330\u20132355 (2009)","journal-title":"SIAM J. on Computing"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Haas, R., Seyffarth, K.: The k-Dominating Graph. Graphs and Combinatorics (March 2013) (online publication)","DOI":"10.1007\/s00373-013-1302-3"},{"issue":"1-2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"R.A. 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. Theor. Comput. Sci.\u00a0343(1-2), 72\u201396 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-20877-5_7","volume-title":"Theory and Applications of Models of Computation","author":"T. Ito","year":"2011","unstructured":"Ito, T., Demaine, E.D.: Approximability of the subset sum reconfiguration problem. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol.\u00a06648, pp. 58\u201369. Springer, Heidelberg (2011)"},{"issue":"12-14","key":"35_CR13","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, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theor. Comput. Sci.\u00a0412(12-14), 1054\u20131065 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"15","key":"35_CR14","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.1016\/j.dam.2012.05.014","volume":"160","author":"T. Ito","year":"2012","unstructured":"Ito, T., Kami\u0144ski, M., Demaine, E.D.: Reconfiguration of list edge-colorings in a graph. Discrete Applied Math.\u00a0160(15), 2199\u20132207 (2012)","journal-title":"Discrete Applied Math."},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-35261-4_7","volume-title":"Algorithms and Computation","author":"T. Ito","year":"2012","unstructured":"Ito, T., Kawamura, K., Ono, H., Zhou, X.: Reconfiguration of list L(2,1)-labelings in a graph. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 34\u201343. Springer, Heidelberg (2012)"},{"issue":"39","key":"35_CR16","doi-asserted-by":"publisher","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.: Shortest paths between shortest paths. Theor. Comput. Sci.\u00a0412(39), 5205\u20135210 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR17","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.: Complexity of independent set reconfigurability problems. Theor. Comput. Sci.\u00a0439, 9\u201315 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"35_CR18","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01305236","volume":"12","author":"E.W. Mayr","year":"1992","unstructured":"Mayr, E.W., Plaxton, C.G.: On the spanning trees of weighted graphs. Combinatorica\u00a012(4), 433\u2013447 (1992)","journal-title":"Combinatorica"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-03898-8_24","volume-title":"Parameterized and Exact Computation","author":"A.E. Mouawad","year":"2013","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol.\u00a08246, pp. 281\u2013294. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T07:16:11Z","timestamp":1558941371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}