{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:25:38Z","timestamp":1776284738652,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319060880","type":"print"},{"value":"9783319060897","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06089-7_24","type":"book-chapter","created":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T01:55:10Z","timestamp":1396317310000},"page":"341-351","source":"Crossref","is-referenced-by-count":24,"title":["On the Parameterized Complexity for Token Jumping on Graphs"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Kami\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuhisa","family":"Yamanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.endm.2011.09.028","volume":"38","author":"M. Bonamy","year":"2011","unstructured":"Bonamy, M., Johnson, M., Lignos, I., Patel, V., Paulusma, D.: On the diameter of reconfiguration graphs for vertex colourings. Electronic Notes in Discrete Mathematics\u00a038, 161\u2013166 (2011)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"24_CR2","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. Theoretical Computer Science\u00a0410, 5215\u20135226 (2009)","journal-title":"Theoretical Computer Science"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/jgt.20514","volume":"67","author":"L. Cereceda","year":"2011","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Finding paths between 3-colourings. J. Graph Theory\u00a067, 69\u201382 (2011)","journal-title":"J. Graph Theory"},{"key":"24_CR4","doi-asserted-by":"publisher","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.\u00a0Computing\u00a038, 2330\u20132355 (2009)","journal-title":"SIAM J.\u00a0Computing"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"R.A. 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. Theoretical Computer Science\u00a0343, 72\u201396 (2005)","journal-title":"Theoretical Computer Science"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A K Peters (2009)","DOI":"10.1201\/b10581"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Ito, T., Demaine, E.D.: Approximability of the subset sum reconfiguration problem. To appear in J. Combinatorial Optimization, doi:10.1007\/s10878-012-9562-z","DOI":"10.1007\/s10878-012-9562-z"},{"key":"24_CR8","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., Demaine, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theoretical Computer Science\u00a0412, 1054\u20131065 (2011)","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.1016\/j.dam.2012.05.014","volume":"160","author":"T. Ito","year":"2012","unstructured":"Ito, T., Kami\u0144ski, M., Demaine, E.D.: Reconfiguration of list edge-colorings in a graph. Discrete Applied Mathematics\u00a0160, 2199\u20132207 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-35261-4_7","volume-title":"Algorithms and Computation","author":"T. Ito","year":"2012","unstructured":"Ito, T., Kawamura, K., Ono, H., Zhou, X.: Reconfiguration of list L(2,1)-labelings in a graph. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 34\u201343. Springer, Heidelberg (2012)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Ito, T., Kawamura, K., Zhou, X.: An improved sufficient condition for reconfiguration of list edge-colorings in a tree. IEICE Trans. on Information and Systems E95-D, 737\u2013745 (2012)","DOI":"10.1587\/transinf.E95.D.737"},{"key":"24_CR12","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. Theoretical Computer Science\u00a0412, 5205\u20135210 (2011)","journal-title":"Theoretical Computer Science"},{"key":"24_CR13","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. Theoretical Computer Science\u00a0439, 9\u201315 (2012)","journal-title":"Theoretical Computer Science"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"4613","DOI":"10.1016\/j.tcs.2011.04.041","volume":"412","author":"K. Makino","year":"2011","unstructured":"Makino, K., Tamaki, S., Yamamoto, M.: An exact algorithm for the Boolean connectivity problem for k-CNF. Theoretical Computer Science\u00a0412, 4613\u20134618 (2011)","journal-title":"Theoretical Computer Science"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-03898-8_24","volume-title":"Parameterized and Exact Computation","author":"A.E. Mouawad","year":"2013","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.) IPEC 2013. LNCS, vol.\u00a08246, pp. 281\u2013294. Springer, Heidelberg (2013)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06089-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T13:44:07Z","timestamp":1558878247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06089-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319060880","9783319060897"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06089-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}