{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T21:40:36Z","timestamp":1768513236965,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T00:00:00Z","timestamp":1431388800000},"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":["Algorithmica"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00453-015-0009-7","type":"journal-article","created":{"date-parts":[[2015,5,11]],"date-time":"2015-05-11T13:34:57Z","timestamp":1431351297000},"page":"295-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Finding Shortest Paths Between Graph Colourings"],"prefix":"10.1007","volume":"75","author":[{"given":"Matthew","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"Viresh","family":"Patel","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,12]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28, 277\u2013305 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"9_CR2","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.: Recoloring bounded treewidth graphs. Electron. Notes Discrete Math. 44, 257\u2013262 (2013)","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/s10878-012-9490-y","volume":"27","author":"M Bonamy","year":"2014","unstructured":"Bonamy, M., Johnson, M., Lignos, I.M., Patel, V., Paulusma, D.: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27, 132\u2013143 (2014)","journal-title":"J. Comb. Optim."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bonsma, P.: The complexity of rerouting shortest paths. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) Mathematical Foundations of Computer Science (MFCS 2012). Lecture Notes in Computer Science, vol. 7464, pp. 222\u2013233. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32589-2_22"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bonsma, P.: Independent set reconfiguration in cographs, In: Kratsch, D., Todinca, I. (eds.) Graph-Theoretic Concepts in Computer Science (WG 2014). Lecture Notes in Computer Science, vol. 8747, pp. 105\u2013116. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-12340-0_9"},{"key":"9_CR6","unstructured":"Bonsma, P.: Rerouting shortest paths in planar graphs, In: D\u2019Souza, D., Kavitha, T., Radhakrishnan J. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). LIPIcs, vol. 18, pp. 337\u2013349. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2012)"},{"key":"9_CR7","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.: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theoret. Comput. Sci. 410, 5215\u20135226 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Bonsma, P., Mouawad, A.E., Nishimura, N., Raman, V.: The complexity of bounded length graph recoloring and CSP reconfiguration. In: Cygan, M., Heggernes P. (eds.) Parameterized and Exact Computation (IPEC 2014). Lecture Notes in Computer Science, vol. 8894, pp 110\u2013121. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-13524-3_10"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Bonsma, P., Kami\u0144ski, M., Wrochna, M.: Reconfiguring independent sets in claw-free graphs. In: 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014). Lecture Notes in Computer Science, vol. 8503, pp. 86\u201397. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-08404-6_8"},{"key":"9_CR10","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.: Connectedness of the graph of vertex-colourings. Discrete Math. 308, 913\u2013919 (2008)","journal-title":"Discrete Math."},{"key":"9_CR11","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.: Mixing 3-colourings in bipartite graphs. Eur. J. Comb. 30, 1593\u20131606 (2009)","journal-title":"Eur. J. Comb."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.20514","volume":"67","author":"L Cereceda","year":"2010","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Finding paths between 3-colourings. J. Graph Theory 67, 69\u201382 (2010)","journal-title":"J. Graph Theory"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and ids. In: Proceedings of ICALP 2009. Lecture Notes in Computer Science, vol. 5555, pp. 378\u2013389 (2009)","DOI":"10.1007\/978-3-642-02927-1_32"},{"key":"9_CR14","doi-asserted-by":"crossref","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, 2330\u20132355 (2009)","journal-title":"SIAM J. Comput."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"van den Heuvel, J.: The complexity of change. Surveys in Combinatorics 2013. London Mathematical Society Lecture Notes Series 409","DOI":"10.1017\/CBO9781139506748.005"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2010","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. Theoret. Comput. Sci. 412, 1054\u20131065 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Ito, T., Kami\u0144ski, M., Demaine, E.D.: Reconfiguration of list edge-colorings in a graph. In: Proceedings of WADS 2009. Lecture Notes in Computer Science, vol. 5664, pp. 375\u2013386 (2009)","DOI":"10.1007\/978-3-642-03367-4_33"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Ito, T., Kawamura, K., Ono, H., Zhou, X.: Reconfiguration of list $$L(2, 1)$$ L ( 2 , 1 ) -labelings in a graph. In: Chao, K-M., Hsu, T-S., Lee, D-T. (eds.) Algorithms and Computation (ISAAC 2012). Lecture Notes in Computer Science, vol. 7676, pp. 34\u201343. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-35261-4_7"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Ito, T., Kawamura, K., Zhou, X.: An improved sufficient condition for reconfiguration of list edge-colorings in a tree. In: Ogihara, M., Tarui, J. (eds.) Theory and Applications of Models of Computation (TAMC 2011). Lecture Notes in Computer Science, vol. 6648, pp. 94\u2013105. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20877-5_10"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Ito, T., Demaine, E.D.: Approximability of the subset sum reconfiguration problem. In: Ogihara, M., Tarui, J. (eds.) Theory and Applications of Models of Computation (TAMC 2011). Lecture Notes in Computer Science, vol. 6648, pp. 58\u201369. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20877-5_7"},{"key":"9_CR21","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.: Complexity of independent set reconfigurability problems. Theoret. Comput. Sci. 439, 9\u201315 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"9_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.: Shortest paths between shortest paths. Theoret. Comput. Sci. 412, 5205\u20135210 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR23","unstructured":"Lov\u00e1sz, L.: Coverings and coloring of hypergraphs. In: Proceedings of 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, pp. 3\u201312 (1973)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V.: Vertex cover reconfiguration and beyond. In: Ahn, H.-K., Shin, C.-S. (eds.) Algorithms and Computation (ISAAC 2014). Lecture Notes in Computer Science, vol. 8889, pp. 452\u2013463. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-13075-0_36"},{"key":"9_CR25","doi-asserted-by":"crossref","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.) Parameterized and Exact Computation (IPEC 2013). Lecture Notes in Computer Science, vol. 8246, pp. 281\u2013294. Springer, Berlin (2013)","DOI":"10.1007\/978-3-319-03898-8_24"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"9_CR27","unstructured":"Wrochna, M.: Homomorphism reconfiguration via homotopy. In: Mayr, E.W., Ollinger, N. (eds.) 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). LIPIcs, vol. 30, pp. 730\u2013742. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2015)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0009-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0009-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0009-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T10:26:43Z","timestamp":1691663203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0009-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,12]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0009-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,12]]}}}