{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:29:33Z","timestamp":1774333773607,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_29","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:04Z","timestamp":1770977224000},"page":"432-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3953-4339","authenticated-orcid":false,"given":"Rin","family":"Saito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9912-6898","authenticated-orcid":false,"given":"Takehiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"10","key":"29_CR1","doi-asserted-by":"publisher","first-page":"2938","DOI":"10.1016\/j.disc.2018.07.007","volume":"341","author":"J Asplund","year":"2018","unstructured":"Asplund, J., Edoh, K.D., Haas, R., Hristova, Y., Novick, B., Werner, B.: Reconfiguration graphs of shortest paths. Discret. Math. 341(10), 2938\u20132948 (2018). https:\/\/doi.org\/10.1016\/j.disc.2018.07.007","journal-title":"Discret. Math."},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.09.012","volume":"510","author":"PS Bonsma","year":"2013","unstructured":"Bonsma, P.S.: The complexity of rerouting shortest paths. Theoret. Comput. Sci. 510, 1\u201312 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.09.012","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.dam.2016.05.024","volume":"231","author":"PS Bonsma","year":"2017","unstructured":"Bonsma, P.S.: Rerouting shortest paths in planar graphs. Discret. Appl. Math. 231, 95\u2013112 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.05.024","journal-title":"Discret. Appl. Math."},{"key":"29_CR4","doi-asserted-by":"publisher","unstructured":"Bousquet, N., Gajjar, K., Lahiri, A., Mouawad, A.E.: Parameterized shortest path reconfiguration. In: Proceedings of IPEC 2024. Leibniz International Proceedings in Informatics, vol. 321, pp. 23:1\u201323:14 (2024). https:\/\/doi.org\/10.4230\/LIPICS.IPEC.2024.23","DOI":"10.4230\/LIPICS.IPEC.2024.23"},{"key":"29_CR5","doi-asserted-by":"publisher","unstructured":"Bousquet, N., Gajjar, K., Lahiri, A., Mouawad, A.E.: Parameterized shortest path reconfiguration. CoRR abs\/2406.12717 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2406.12717","DOI":"10.48550\/ARXIV.2406.12717"},{"key":"29_CR6","doi-asserted-by":"publisher","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 68\u201384. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFB0017474","DOI":"10.1007\/BFB0017474"},{"issue":"10","key":"29_CR7","doi-asserted-by":"publisher","first-page":"3309","DOI":"10.1007\/S00453-024-01263-Y","volume":"86","author":"K Gajjar","year":"2024","unstructured":"Gajjar, K., Jha, A.V., Kumar, M., Lahiri, A.: Reconfiguring shortest paths in graphs. Algorithmica 86(10), 3309\u20133338 (2024). https:\/\/doi.org\/10.1007\/S00453-024-01263-Y","journal-title":"Algorithmica"},{"issue":"11","key":"29_CR8","doi-asserted-by":"publisher","first-page":"3395","DOI":"10.1007\/S00453-024-01261-0","volume":"86","author":"T Gima","year":"2024","unstructured":"Gima, T., Ito, T., Kobayashi, Y., Otachi, Y.: Algorithmic meta-theorems for combinatorial reconfiguration revisited. Algorithmica 86(11), 3395\u20133424 (2024). https:\/\/doi.org\/10.1007\/S00453-024-01261-0","journal-title":"Algorithmica"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/J.COSREV.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010). https:\/\/doi.org\/10.1016\/J.COSREV.2010.01.001","journal-title":"Comput. Sci. Rev."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles and Computation. A K Peters (2009)","DOI":"10.1201\/b10581"},{"key":"29_CR11","doi-asserted-by":"publisher","unstructured":"van den Heuvel, J.: The complexity of change. In: Surveys in Combinatorics 2013. London Mathematical Society Lecture Note Series, vol.\u00a0409, pp. 127\u2013160. Cambridge University Press (2013). https:\/\/doi.org\/10.1017\/CBO9781139506748.005","DOI":"10.1017\/CBO9781139506748.005"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/S00224-008-9150-X","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196\u2013217 (2010). https:\/\/doi.org\/10.1007\/S00224-008-9150-X","journal-title":"Theory Comput. Syst."},{"issue":"39","key":"29_CR13","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. Theoret. Comput. Sci. 412(39), 5205\u20135210 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.021","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/S00453-016-0159-2","volume":"78","author":"AE Mouawad","year":"2017","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. Algorithmica 78(1), 274\u2013297 (2017). https:\/\/doi.org\/10.1007\/S00453-016-0159-2","journal-title":"Algorithmica"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-319-13524-3_21","volume-title":"Parameterized and Exact Computation","author":"AE Mouawad","year":"2014","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Wrochna, M.: Reconfiguration over tree decompositions. In: Cygan, M., Heggernes, P. (eds.) IPEC 2014. LNCS, vol. 8894, pp. 246\u2013257. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13524-3_21"},{"key":"29_CR16","doi-asserted-by":"publisher","unstructured":"Ne\u0161etril, J., Ossona de Mendez, P.: Sparsity - Graphs, Structures, and Algorithms. Algorithms and Combinatorics, vol.\u00a028. Springer, Heidelberg (2012) https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"issue":"4","key":"29_CR17","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018). https:\/\/doi.org\/10.3390\/a11040052","journal-title":"Algorithms"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/978-3-662-43948-7_77","volume-title":"Automata, Languages, and Programming","author":"F Reidl","year":"2014","unstructured":"Reidl, F., Rossmanith, P., Villaamil, F.S., Sikdar, S.: A faster parameterized algorithm for treedepth. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 931\u2013942. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_77"},{"issue":"3","key":"29_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.7155\/JGAA.V28I3.2973","volume":"28","author":"R Saito","year":"2024","unstructured":"Saito, R., Eto, H., Ito, T., Uehara, R.: Reconfiguration of vertex-disjoint shortest paths on graphs. J. Graph Algorithms Appl. 28(3), 87\u2013101 (2024). https:\/\/doi.org\/10.7155\/JGAA.V28I3.2973","journal-title":"J. Graph Algorithms Appl."},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 634\u2013645. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_52"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2017.11.003","volume":"93","author":"M Wrochna","year":"2018","unstructured":"Wrochna, M.: Reconfiguration in bounded bandwidth and tree-depth. J. Comput. Syst. Sci. 93, 1\u201310 (2018). https:\/\/doi.org\/10.1016\/j.jcss.2017.11.003","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR22","doi-asserted-by":"publisher","unstructured":"van\u00a0der Zanden, T.C.: Parameterized complexity of graph constraint logic. In: Proceedings of IPEC 2015, pp. 282\u2013293 (2015). https:\/\/doi.org\/10.4230\/LIPICS.IPEC.2015.282","DOI":"10.4230\/LIPICS.IPEC.2015.282"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:09:03Z","timestamp":1774325343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}