{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:32:04Z","timestamp":1772717524824,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319135236","type":"print"},{"value":"9783319135243","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_21","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:51:38Z","timestamp":1417542698000},"page":"246-257","source":"Crossref","is-referenced-by-count":14,"title":["Reconfiguration over Tree Decompositions"],"prefix":"10.1007","author":[{"given":"Amer E.","family":"Mouawad","sequence":"first","affiliation":[]},{"given":"Naomi","family":"Nishimura","sequence":"additional","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Wrochna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"5","key":"21_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF00271645","volume":"21","author":"G Bauer","year":"1984","unstructured":"Bauer, G., Otto, F.: Finite complete rewriting systems and the complexity of the word problem. Acta Inf. 21(5), 521\u2013540 (1984)","journal-title":"Acta Inf."},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"key":"21_CR4","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. 7464, pp. 222\u2013233. Springer, Heidelberg (2012)"},{"key":"21_CR5","unstructured":"Bonsma, P.: Rerouting shortest paths in planar graphs. In: Leibniz International Proceedings in Informatics (LIPIcs), FSTTCS 2012, vol. 18, pp. 337\u2013349 (2012)"},{"issue":"56","key":"21_CR6","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. 308(56), 913\u2013919 (2008)","journal-title":"Discrete Math."},{"issue":"1","key":"21_CR7","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. Graph Theory 67(1), 69\u201382 (2011)","journal-title":"J. Graph Theory"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Demaine, E., Hajiaghayi, M., Kawarabayashi, K.: Algorithmic graph minor theory: secomposition, approximation, and coloring. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 637\u2013646, October 2005","DOI":"10.1109\/SFCS.2005.14"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292\u2013302 (2008)","journal-title":"Comput. J."},{"key":"21_CR11","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2005). (Electronic Edition)"},{"key":"21_CR12","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1997","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1997)"},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27(3), 275\u2013291 (2000)","journal-title":"Algorithmica"},{"issue":"7","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1016\/j.dam.2007.08.013","volume":"156","author":"S Fiorini","year":"2008","unstructured":"Fiorini, S., Hardy, N., Reed, B., Vetta, A.: Planar graph bipartization in linear time. Discrete Appl. Math. 156(7), 1175\u20131180 (2008)","journal-title":"Discrete Appl. Math."},{"key":"21_CR15","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"6","key":"21_CR16","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. Comput. 38(6), 2330\u20132355 (2009)","journal-title":"SIAM J. Comput."},{"issue":"091","key":"21_CR17","first-page":"3","volume":"14","author":"M Grohe","year":"2007","unstructured":"Grohe, M.: Logic, graphs, and algorithms. Electron. Colloquium Comput. Complex. (ECCC) 14(091), 3 (2007)","journal-title":"Electron. Colloquium Comput. Complex. (ECCC)"},{"issue":"12\u201314","key":"21_CR18","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. 412(12\u201314), 1054\u20131065 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"15","key":"21_CR19","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 Appl. Math. 160(15), 2199\u20132207 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"39","key":"21_CR20","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. 412(39), 5205\u20135210 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Treewidth Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)"},{"key":"21_CR22","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":"AE 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. 8246, pp. 281\u2013294. Springer, Heidelberg (2013)"},{"key":"21_CR23","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2267170","volume":"12","author":"EL Post","year":"1947","unstructured":"Post, E.L.: Recursive unsolvability of a problem of Thue. J. Symbol. Logic 12(1), 1\u201311 (1947)","journal-title":"J. Symbol. Logic"},{"key":"21_CR25","unstructured":"Wrochna, M.: Reconfiguration in bounded bandwidth and treedepth (2014). arXiv:1405.0847"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:34:31Z","timestamp":1747175671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}