{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:09:37Z","timestamp":1764842977640,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_22","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:21Z","timestamp":1740067221000},"page":"346-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1376-4678","authenticated-orcid":false,"given":"Tatsuhiro","family":"Suga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5212-0202","authenticated-orcid":false,"given":"Akira","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5479-7006","authenticated-orcid":false,"given":"Yuma","family":"Tamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"unstructured":"Agrawal, A., Allumalla, R.K., Dhanekula, V.T.: Refuting FPT algorithms for some parameterized problems under Gap-ETH. In: IPEC. LIPIcs, vol.\u00a0214, pp. 2:1\u20132:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)","key":"22_CR1"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00224-020-09967-8","volume":"65","author":"R Belmonte","year":"2021","unstructured":"Belmonte, R., Kim, E.J., Lampis, M., Mitsou, V., Otachi, Y., Sikora, F.: Token sliding on split graphs. Theory Comput. Syst. 65(4), 662\u2013686 (2021)","journal-title":"Theory Comput. Syst."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.dam.2018.05.029","volume":"250","author":"M de Berg","year":"2018","unstructured":"de Berg, M., Jansen, B.M.P., Mukherjee, D.: Independent-set reconfiguration thresholds of hereditary graph classes. Disc. Appl. Math. 250, 165\u2013182 (2018)","journal-title":"Disc. Appl. Math."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-68705-6_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Bonamy","year":"2017","unstructured":"Bonamy, M., Bousquet, N.: Token sliding on chordal graphs. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 127\u2013139. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_10"},{"key":"22_CR5","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. Theor. Comput. Sci. 510, 1\u201312 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/jgt.21992","volume":"83","author":"PS Bonsma","year":"2016","unstructured":"Bonsma, P.S.: Independent set reconfiguration in cographs and their generalizations. J. Graph Theory 83(2), 164\u2013195 (2016)","journal-title":"J. Graph Theory"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-08404-6_8","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"P Bonsma","year":"2014","unstructured":"Bonsma, P., Kami\u0144ski, M., Wrochna, M.: Reconfiguring independent sets in claw-free graphs. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 86\u201397. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_8"},{"unstructured":"Brianski, M., Felsner, S., Hodor, J., Micek, P.: Reconfiguring independent sets on interval graphs. In: MFCS. LIPIcs, vol.\u00a0202, pp. 23:1\u201323:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)","key":"22_CR8"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1137\/18M1166869","volume":"49","author":"P Chalermsook","year":"2020","unstructured":"Chalermsook, P., et al.: From Gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more. SIAM J. Comput. 49(4), 772\u2013810 (2020)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Christen, R., et al.: PARIS: planning algorithms for reconfiguring independent sets. In: ECAI. Frontiers in Artificial Intelligence and Applications, vol.\u00a0372, pp. 453\u2013460. IOS Press (2023)","key":"22_CR10","DOI":"10.3233\/FAIA230303"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2002","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2002)","journal-title":"Ann. Math."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2015.07.037","volume":"600","author":"ED Demaine","year":"2015","unstructured":"Demaine, E.D., et al.: Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600, 132\u2013142 (2015)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Dinur, I.: Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover. Electron. Colloquium Comput. Complex. TR16-128 (2016)","key":"22_CR13"},{"doi-asserted-by":"publisher","unstructured":"Domon, N., Suzuki, A., Tamura, Y., Zhou, X.: The shortest path reconfiguration problem based on relaxation of reconfiguration rules. In: WALCOM. Lecture Notes in Computer Science, vol. 14549, pp. 227\u2013241. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-981-97-0566-5_17","key":"22_CR14","DOI":"10.1007\/978-981-97-0566-5_17"},{"issue":"10","key":"22_CR15","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)","journal-title":"Algorithmica"},{"key":"22_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W. H, New York City (1979)"},{"doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In: Topics on Perfect Graphs, North-Holland Mathematics Studies, vol.\u00a088, pp. 325\u2013356. North-Holland (1984)","key":"22_CR17","DOI":"10.1016\/S0304-0208(08)72943-8"},{"doi-asserted-by":"crossref","unstructured":"Hanaka, T., et al.: Reconfiguring spanning and induced subgraphs. Theor. Comput. Sci. 806, 553\u2013566 (2020)","key":"22_CR18","DOI":"10.1016\/j.tcs.2019.09.018"},{"issue":"1\u20132","key":"22_CR19","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RA 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. 343(1\u20132), 72\u201396 (2005)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"van\u00a0den Heuvel, J.: The complexity of change. In: Surveys in Combinatorics, London Mathematical Society Lecture Note Series, vol.\u00a0409, pp. 127\u2013160. Cambridge University Press (2013)","key":"22_CR20","DOI":"10.1017\/CBO9781139506748.005"},{"unstructured":"Hoang, D.A., Uehara, R.: Sliding tokens on a cactus. In: ISAAC. LIPIcs, vol.\u00a064, pp. 37:1\u201337:26. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)","key":"22_CR21"},{"issue":"12\u201314","key":"22_CR22","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., et al.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Ito, T., et al.: ZDD-based algorithmic framework for solving shortest reconfiguration problems. In: CPAIOR. Lecture Notes in Computer Science, vol. 13884, pp. 167\u2013183. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33271-5_12","key":"22_CR23","DOI":"10.1007\/978-3-031-33271-5_12"},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.dam.2023.01.026","volume":"333","author":"T Ito","year":"2023","unstructured":"Ito, T., Ono, H., Otachi, Y.: Reconfiguration of cliques in a graph. Disc. Appl. Math. 333, 43\u201358 (2023)","journal-title":"Disc. Appl. Math."},{"issue":"39","key":"22_CR25","doi-asserted-by":"publisher","first-page":"5205","DOI":"10.1016\/j.tcs.2011.05.021","volume":"412","author":"M Kaminski","year":"2011","unstructured":"Kaminski, M., Medvedev, P., Milanic, M.: Shortest paths between shortest paths. Theor. Comput. Sci. 412(39), 5205\u20135210 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","volume":"439","author":"M Kaminski","year":"2012","unstructured":"Kaminski, M., Medvedev, P., Milanic, M.: Complexity of independent set reconfigurability problems. Theor. Comput. Sci. 439, 9\u201315 (2012)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Mouawad, A.E.: The complexity of independent set reconfiguration on bipartite graphs. ACM Trans. Algor. 15(1), 7:1\u20137:19 (2019)","key":"22_CR27","DOI":"10.1145\/3280825"},{"issue":"2","key":"22_CR28","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algor. 31(2), 335\u2013354 (1999)","journal-title":"J. Algor."},{"unstructured":"Manurangsi, P., Raghavendra, P.: A birthday repetition theorem and complexity of approximating dense CSPs. In: ICALP. LIPIcs, vol.\u00a080, pp. 78:1\u201378:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)","key":"22_CR29"},{"issue":"4","key":"22_CR30","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)","journal-title":"Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Toda, T., Ito, T., Kawahara, J., Soh, T., Suzuki, A., Teruyama, J.: Solving reconfiguration problems of first-order expressible properties of graph vertices with boolean satisfiability. In: ICTAI, pp. 294\u2013302. IEEE (2023)","key":"22_CR31","DOI":"10.1109\/ICTAI59109.2023.00050"},{"key":"22_CR32","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)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"publisher","unstructured":"Yamada, Y., Banbara, M., Inoue, K., Schaub, T., Uehara, R.: Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis. In: WALCOM. Lecture Notes in Computer Science, vol. 14549, pp. 242\u2013256. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-981-97-0566-5_18","key":"22_CR33","DOI":"10.1007\/978-981-97-0566-5_18"}],"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-96-2845-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:28Z","timestamp":1740067228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","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":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}