{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:36Z","timestamp":1725579036307},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_7","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"56-67","source":"Crossref","is-referenced-by-count":5,"title":["Shortest Paths between Shortest Paths and Independent Sets"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Kami\u0144ski","sequence":"first","affiliation":[]},{"given":"Paul","family":"Medvedev","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"50","key":"7_CR1","doi-asserted-by":"publisher","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","volume":"410","author":"P.S. Bonsma","year":"2009","unstructured":"Bonsma, P.S., Cereceda, L.: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci.\u00a0410(50), 5215\u20135226 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.endm.2007.07.073","volume":"29","author":"P.S. Bonsma","year":"2007","unstructured":"Bonsma, P.S., Cereceda, L., van den Heuvel, J., Johnson, M.: Finding paths between graph colourings: Computational complexity and possible distances. Electronic Notes in Discrete Mathematics\u00a029, 463\u2013469 (2007)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"5-6","key":"7_CR3","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1016\/j.disc.2007.07.028","volume":"308","author":"L. Cereceda","year":"2008","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Connectedness of the graph of vertex-colourings. Discrete Mathematics\u00a0308(5-6), 913\u2013919 (2008)","journal-title":"Discrete Mathematics"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1016\/j.ejc.2009.03.011","volume":"30","author":"L. Cereceda","year":"2009","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics\u00a030, 1593\u20131606 (2009)","journal-title":"European Journal of Combinatorics"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. of Math.\u00a0164, 51\u2013229 (2006)","journal-title":"Ann. of Math."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1002\/jgt.10045","volume":"40","author":"M. Conforti","year":"2002","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: Even-hole-free graphs part II: Recognition algorithm. J.\u00a0Graph Theory\u00a040, 238\u2013266 (2002)","journal-title":"J.\u00a0Graph Theory"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics\u00a03(3), 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J.\u00a0Comput.\u00a014(4), 926\u2013934 (1985)","journal-title":"SIAM J.\u00a0Comput."},{"issue":"6","key":"7_CR9","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.\u00a038(6), 2330\u20132355 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"7_CR10","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. Theor. Comput. Sci.\u00a0343(1-2), 72\u201396 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-92182-0_6","volume-title":"Algorithms and Computation","author":"T. Ito","year":"2008","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. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 28\u201339. Springer, Heidelberg (2008)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-03367-4_33","volume-title":"Algorithms and Data Structures","author":"T. Ito","year":"2009","unstructured":"Ito, T., Kami\u0144ski, M., Demaine, E.D.: Reconfiguration of list edge-colorings in a graph. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 375\u2013386. Springer, Heidelberg (2009)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Kaminski, M., Medvedev, P., Milanic, M.: Shortest paths between shortest paths and independent sets. CoRR, abs\/1008.4563 (2010)","DOI":"10.1007\/978-3-642-19222-7_7"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:41:58Z","timestamp":1558420918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}