{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:09:36Z","timestamp":1764842976616,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":35,"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_16","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:07Z","timestamp":1740067207000},"page":"244-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reconfiguration Using Generalized Token Jumping"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6657-0020","authenticated-orcid":false,"given":"Jan Maty\u00e1\u0161","family":"K\u0159i\u0161\u0165an","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Svoboda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"issue":"9","key":"16_CR1","doi-asserted-by":"publisher","first-page":"2914","DOI":"10.1007\/s00453-021-00848-1","volume":"83","author":"V Bartier","year":"2021","unstructured":"Bartier, V., Bousquet, N., Dallard, C., Lomer, K., Mouawad, A.E.: On girth and the parameterized complexity of token sliding and token jumping. Algorithmica 83(9), 2914\u20132951 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00848-1","journal-title":"Algorithmica"},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00224-020-09967-8","volume":"65","author":"R Belmonte","year":"2020","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 (2020). https:\/\/doi.org\/10.1007\/s00224-020-09967-8","journal-title":"Theory Comput. Syst."},{"key":"16_CR3","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/j.endm.2013.10.040","journal-title":"Electron. Notes Discrete Math."},{"key":"16_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":"16_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2021.05.014","volume":"301","author":"M Bonamy","year":"2021","unstructured":"Bonamy, M., Dorbec, P., Ouvrard, P.: Dominating sets reconfiguration under token sliding. Discret. Appl. Math. 301, 6\u201318 (2021). https:\/\/doi.org\/10.1016\/j.dam.2021.05.014","journal-title":"Discret. Appl. Math."},{"issue":"50","key":"16_CR6","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. Theoret. Comput. Sci. 410(50), 5215\u20135226 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.08.023","journal-title":"Theoret. Comput. Sci."},{"key":"16_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"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-13524-3_10","volume-title":"Parameterized and Exact Computation","author":"P Bonsma","year":"2014","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.) IPEC 2014. LNCS, vol. 8894, pp. 110\u2013121. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13524-3_10"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-030-86593-1_8","volume-title":"Fundamentals of Computation Theory","author":"N Bousquet","year":"2021","unstructured":"Bousquet, N., Joffard, A.: TS-reconfiguration of dominating sets in circle and circular-arc graphs. In: Bampis, E., Pagourtzis, A. (eds.) FCT 2021. LNCS, vol. 12867, pp. 114\u2013134. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86593-1_8"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jcss.2020.03.003","volume":"112","author":"K Censor-Hillel","year":"2020","unstructured":"Censor-Hillel, K., Rabie, M.: Distributed reconfiguration of maximal independent sets. J. Comput. Syst. Sci. 112, 85\u201396 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2020.03.003","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","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-colorings. J. Graph Theory 67(1), 69\u201382 (2010). https:\/\/doi.org\/10.1002\/jgt.20514","journal-title":"J. Graph Theory"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Charrier, T., Queffelec, A., Sankur, O., Schwarzentruber, F.: Complexity of planning for connected agents. Auton. Agents Multi-Agent Syst. 34(2) (2020). https:\/\/doi.org\/10.1007\/s10458-020-09468-5","DOI":"10.1007\/s10458-020-09468-5"},{"key":"16_CR13","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. Theoret. Comput. Sci. 600, 132\u2013142 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.07.037","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Gajjar, K., Jha, A.V., Kumar, M., Lahiri, A.: Reconfiguring shortest paths in graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36. no. (9), pp. 9758\u20139766 (2022). https:\/\/doi.org\/10.1609\/aaai.v36i9.21211","DOI":"10.1609\/aaai.v36i9.21211"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.mathsocsci.2019.07.005","volume":"101","author":"J Gan","year":"2019","unstructured":"Gan, J., Suksompong, W., Voudouris, A.A.: Envy-freeness in house allocation problems. Math. Soc. Sci. 101, 104\u2013106 (2019). https:\/\/doi.org\/10.1016\/j.mathsocsci.2019.07.005","journal-title":"Math. Soc. Sci."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/11786986_31","volume-title":"Automata, Languages and Programming","author":"P Gopalan","year":"2006","unstructured":"Gopalan, P., Kolaitis, P.G., Maneva, E.N., Papadimitriou, C.H.: The connectivity of Boolean satisfiability: computational and structural dichotomies. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 346\u2013357. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11786986_31"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2016.08.016","volume":"651","author":"A Haddadan","year":"2016","unstructured":"Haddadan, A., et al.: The complexity of dominating set reconfiguration. Theoret. Comput. Sci. 651, 37\u201349 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.08.016","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc. s1-10(1), 26\u201330 (1935). https:\/\/doi.org\/10.1112\/jlms\/s1-10.37.26","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-17402-6_22","volume-title":"Algorithms and Complexity","author":"DA Hoang","year":"2019","unstructured":"Hoang, D.A., Khorramian, A., Uehara, R.: Shortest reconfiguration sequence for sliding tokens on spiders. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 262\u2013273. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_22"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Ito, T., Nooka, H., Zhou, X.: Reconfiguration of vertex covers in a graph. IEICE Trans. Inf. Syst. E99.D(3), 598\u2013606 (2016). https:\/\/doi.org\/10.1587\/transinf.2015fcp0010","DOI":"10.1587\/transinf.2015fcp0010"},{"issue":"39","key":"16_CR21","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."},{"key":"16_CR22","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. Theoret. Comput. Sci. 439, 9\u201315 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.03.004","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"16_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/aadm151109021k","volume":"10","author":"W Klostermeyer","year":"2016","unstructured":"Klostermeyer, W., Mynhardt, C.: Protecting a graph with mobile guards. Appl. Anal. Discrete Math. 10(1), 1\u201329 (2016). https:\/\/doi.org\/10.2298\/aadm151109021k","journal-title":"Appl. Anal. Discrete Math."},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"K\u0159i\u0161\u0165an, J.M., Svoboda, J.: Shortest dominating set reconfiguration under token sliding. In: Fernau, H., Jansen, K. (eds.) FCT 2023. LNCS, vol. 14292, pp. 333\u2013347. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43587-4_24","DOI":"10.1007\/978-3-031-43587-4_24"},{"issue":"1","key":"16_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3280825","volume":"15","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Mouawad, A.E.: The complexity of independent set reconfiguration on bipartite graphs. ACM Trans. Algorithms 15(1), 1\u201319 (2018). https:\/\/doi.org\/10.1145\/3280825","journal-title":"ACM Trans. Algorithms"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jcss.2018.02.004","volume":"95","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Mouawad, A.E., Panolan, F., Ramanujan, M., Saurabh, S.: Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95, 122\u2013131 (2018). https:\/\/doi.org\/10.1016\/j.jcss.2018.02.004","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"16_CR27","doi-asserted-by":"publisher","first-page":"20","DOI":"10.3390\/a11020020","volume":"11","author":"A Mouawad","year":"2018","unstructured":"Mouawad, A., Nishimura, N., Raman, V., Siebertz, S.: Vertex cover reconfiguration and beyond. Algorithms 11(2), 20 (2018). https:\/\/doi.org\/10.3390\/a11020020","journal-title":"Algorithms"},{"issue":"3","key":"16_CR28","doi-asserted-by":"publisher","first-page":"2185","DOI":"10.1137\/16m1065288","volume":"31","author":"AE Mouawad","year":"2017","unstructured":"Mouawad, A.E., Nishimura, N., Pathak, V., Raman, V.: Shortest reconfiguration paths in the solution space of Boolean formulas. SIAM J. Discret. Math. 31(3), 2185\u20132200 (2017). https:\/\/doi.org\/10.1137\/16m1065288","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"16_CR29","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"},{"issue":"2","key":"16_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/s0022-0000(70)80006-x","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177\u2013192 (1970). https:\/\/doi.org\/10.1016\/s0022-0000(70)80006-x","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-030-33274-7_6","volume-title":"Artificial Intelligence","author":"R Stern","year":"2019","unstructured":"Stern, R.: Multi-agent path finding \u2013 an overview. In: Osipov, G.S., Panov, A.I., Yakovlev, K.S. (eds.) Artificial Intelligence. LNCS (LNAI), vol. 11866, pp. 96\u2013115. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33274-7_6"},{"key":"16_CR32","doi-asserted-by":"publisher","unstructured":"Tateo, D., Banfi, J., Riva, A., Amigoni, F., Bonarini, A.: Multiagent connected path planning: PSPACE-completeness and how to deal with it. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32. no. 1 (2018). https:\/\/doi.org\/10.1609\/aaai.v32i1.11587","DOI":"10.1609\/aaai.v32i1.11587"},{"key":"16_CR33","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)"},{"key":"16_CR34","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":"16_CR35","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2021.02.019","volume":"863","author":"T Yamada","year":"2021","unstructured":"Yamada, T., Uehara, R.: Shortest reconfiguration of sliding tokens on subclasses of interval graphs. Theoret. Comput. Sci. 863, 53\u201368 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.02.019","journal-title":"Theoret. Comput. Sci."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:10Z","timestamp":1740067210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_16","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"}}]}}