{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:44:11Z","timestamp":1769561051293,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319687049","type":"print"},{"value":"9783319687056","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_10","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:06:22Z","timestamp":1509516382000},"page":"127-139","source":"Crossref","is-referenced-by-count":24,"title":["Token Sliding on Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Marthe","family":"Bonamy","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Bousquet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"10_CR1","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 Discret. Math. 44, 257\u2013262 (2013). (LAGOS 2013)","journal-title":"Electron. Notes Discret. Math."},{"key":"10_CR2","unstructured":"Bonamy, M., Bousquet, N.: Reconfiguring independent sets in cographs. CoRR, abs\/1406.1433 (2014)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Bousquet, N.: Token sliding on chordal graphs. CoRR, abs\/1605.00442 (2016)","DOI":"10.1007\/978-3-319-68705-6_10"},{"key":"10_CR4","unstructured":"Bonamy, M., Bousquet, N., Feghali, C., Johnson, M.: On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR, abs\/1510.06964 (2015)"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2013.09.012","volume":"510","author":"P Bonsma","year":"2013","unstructured":"Bonsma, P.: The complexity of rerouting shortest paths. Theoret. Comput. Sci. 510, 1\u201312 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-12340-0_9","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Bonsma","year":"2014","unstructured":"Bonsma, P.: Independent set reconfiguration in cographs. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 105\u2013116. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_9"},{"key":"10_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"},{"issue":"3","key":"10_CR8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-319-13075-0_31","volume-title":"Algorithms and Computation","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., et al.: Polynomial-time algorithm for sliding tokens on trees. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 389\u2013400. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_31"},{"key":"10_CR10","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Feghali, C., Johnson, M., Paulusma, D.: A reconfigurations analogue of Brooks\u2019 theorem and its consequences. CoRR, abs\/1501.05800 (2015)","DOI":"10.1002\/jgt.22000"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Feghali, C., Johnson, M., Paulusma, D.: Kempe equivalence of colourings of cubic graphs. CoRR, abs\/1503.03430 (2015)","DOI":"10.1016\/j.endm.2015.06.034"},{"key":"10_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York Inc., New York (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"6","key":"10_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., 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":"1\u20132","key":"10_CR15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"R Hearn","year":"2005","unstructured":"Hearn, R., Demaine, E.: 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."},{"issue":"12\u201314","key":"10_CR16","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., Demaine, E., Harvey, N., Papadimitriou, C., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theoret. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR17","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\u0109, M.: Complexity of independent set reconfigurability problems. Theoret. Comput. Sci. 439, 9\u201315 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. In: 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, pp. 281\u2013294 (2013)","DOI":"10.1007\/978-3-319-03898-8_24"},{"key":"10_CR19","first-page":"127","volume-title":"Surveys in Combinatorics 2013","author":"J Heuvel van den","year":"2013","unstructured":"van den Heuvel, J.: The complexity of change. In: Blackburn, S.R., Gerke, S., Wildon, M. (eds.) Surveys in Combinatorics 2013, pp. 127\u2013160. Cambridge University Press, Cambridge (2013)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-30139-6_19","volume-title":"WALCOM: Algorithms and Computation","author":"T Yamada","year":"2016","unstructured":"Yamada, T., Uehara, R.: Shortest reconfiguration of sliding tokens on a caterpillar. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 236\u2013248. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30139-6_19"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T01:10:39Z","timestamp":1659748239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}