{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:27:50Z","timestamp":1725809270248},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_24","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:11:32Z","timestamp":1415981492000},"page":"314-328","source":"Crossref","is-referenced-by-count":0,"title":["The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs"],"prefix":"10.1007","author":[{"given":"Tatsuhiko","family":"Hatanaka","sequence":"first","affiliation":[]},{"given":"Takehiro","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/s10878-012-9490-y","volume":"27","author":"M Bonamy","year":"2014","unstructured":"Bonamy, M., Johnson, M., Lignos, I., Patel, V., Paulusma, D.: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27, 132\u2013143 (2014)","journal-title":"J. Comb. Optim."},{"key":"24_CR2","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)","journal-title":"Electron. Notes Discrete Math."},{"key":"24_CR3","unstructured":"Bonsma, P.: Rerouting shortest paths in planar graphs. In: Proceedings of FSTTCS 2012, LIPIcs 18, pp. 337\u2013349 (2012)"},{"key":"24_CR4","doi-asserted-by":"publisher","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":"24_CR5","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, 5215\u20135226 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR6","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, Heidelberg (2014)"},{"key":"24_CR7","unstructured":"Bonsma, P., Mouawad, A.E.: The complexity of bounded length graph recoloring (2014). \n                      arXiv:1404.0337"},{"key":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"key":"24_CR9","unstructured":"Cereceda, L.: Mixing graph colourings. Ph.D. thesis, London School of Economics and Political Science (2007)"},{"key":"24_CR10","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 \n                      \n                        \n                      \n                      $$3$$\n                    -colorings. J. Graph Theor. 67, 69\u201382 (2011)","journal-title":"J. Graph Theor."},{"key":"24_CR11","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. Comput. 38, 2330\u20132355 (2009)","journal-title":"SIAM J. Comput."},{"key":"24_CR12","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. Theoret. Comput. Sci. 343, 72\u201396 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR13","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. Theoret. Comput. Sci. 412, 1054\u20131065 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR14","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 Appl. Math. 160, 2199\u20132207 (2012)","journal-title":"Discrete Appl. Math."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2014.04.011","volume":"544","author":"T Ito","year":"2014","unstructured":"Ito, T., Kawamura, K., Ono, H., Zhou, X.: Reconfiguration of list \n                      \n                        \n                      \n                      $$L(2,1)$$\n                    -labelings in a graph. Theoret. Comput. Sci. 544, 84\u201397 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1587\/transinf.E95.D.737","volume":"E95\u2013D","author":"T Ito","year":"2012","unstructured":"Ito, T., Kawamura, K., Zhou, X.: An improved sufficient condition for reconfiguration of list edge-colorings in a tree. IEICE Trans. Inf. Syst. E95\u2013D, 737\u2013745 (2012)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Appl. Math. 75, 135\u2013155 (1997)","journal-title":"Discrete Appl. Math."},{"key":"24_CR18","unstructured":"Johnson, M., Kratsch, D., Kratsch, S., Patel, V., Paulusma, D.: Colouring reconfiguration is fixed-parameter tractable (2014). \n                      arXiv:1403.6347"},{"key":"24_CR19","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, 5205\u20135210 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR20","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)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR21","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 \n                      \n                        \n                      \n                      $$k$$\n                    -CNF. Theoret. Comput. Sci. 412, 4613\u20134618 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR22","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":"AE 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. 8246, pp. 281\u2013294. Springer, Heidelberg (2013)"},{"key":"24_CR23","first-page":"167","volume":"3","author":"A Proskurowski","year":"1999","unstructured":"Proskurowski, A., Telle, J.A.: Classes of graphs with restricted interval models. Discrete Math. Theor. Comput. Sci. 3, 167\u2013176 (1999)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.: Graph minors. I Excluding a forest. J. Comb. Theor. Ser. B 35, 39\u201361 (1983)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"24_CR25","unstructured":"Wrochna, M.: Reconfiguration in bounded bandwidth and treedepth (2014). \n                      arXiv:1405.0847"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:33:24Z","timestamp":1559054004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}