{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:16Z","timestamp":1759638676734,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_80","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"985-996","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas"],"prefix":"10.1007","author":[{"given":"Amer E.","family":"Mouawad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naomi","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinayak","family":"Pathak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"80_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-40450-4_2","volume-title":"Algorithms \u2013 ESA 2013","author":"O Aichholzer","year":"2013","unstructured":"Aichholzer, O., Mulzer, W., Pilz, A.: Flip distance between triangulations of a simple polygon is NP-complete. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 13\u201324. Springer, Heidelberg (2013)"},{"key":"80_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York, NY, USA (2009)","edition":"1"},{"issue":"3","key":"80_CR3","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1215\/S0012-7094-37-00334-X","volume":"3","author":"G Birkhoff","year":"1937","unstructured":"Birkhoff, G.: Rings of sets. Duke Mathematical Journal 3(3), 443\u2013454 (1937)","journal-title":"Duke Mathematical Journal"},{"key":"80_CR4","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Bousquet, N.: Recoloring bounded treewidth graphs. In: Proceedings of the 7th Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS) (2013)","DOI":"10.1016\/j.endm.2013.10.040"},{"key":"80_CR5","unstructured":"Bose, P., Lubiw, A., Pathak, V., Verdonschot, S.: Flipping edge-labelled triangulations (2013). CoRR, abs\/1310.1166"},{"issue":"56","key":"80_CR6","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 308(56), 913\u2013919 (2008)","journal-title":"Discrete Mathematics"},{"key":"80_CR7","doi-asserted-by":"crossref","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity classifications of boolean constraint satisfaction problems. SIAM (2001)","DOI":"10.1137\/1.9780898718546"},{"issue":"1","key":"80_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(82)90083-7","volume":"15","author":"K Culik II","year":"1982","unstructured":"Culik II, K., Wood, D.: A note on some tree similarity measures. Inform. Process. Lett. 15(1), 39\u201342 (1982)","journal-title":"Inform. Process. Lett."},{"key":"80_CR9","unstructured":"Eppstein, D., Falmagne, J.-C., Ovchinnikov, S.: Media theory - interdisciplinary applied mathematics. Springer (2008)"},{"issue":"3","key":"80_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.7151\/dmgt.1562","volume":"31","author":"G Fricke","year":"2011","unstructured":"Fricke, G., Hedetniemi, S.M., Hedetniemi, S.T., Hutson, K.R.: $$\\gamma $$-Graphs of Graphs. Discussiones Mathematicae Graph Theory 31(3), 517\u2013531 (2011)","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"6","key":"80_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 Journal on Computing 38(6), 2330\u20132355 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"12\u201314","key":"80_CR12","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 412(12\u201314), 1054\u20131065 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"15","key":"80_CR13","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 160(15), 2199\u20132207 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"80_CR14","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. Theor. Comput. Sci. 439, 9\u201315 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"80_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0012-365X(72)90093-3","volume":"3","author":"CL Lawson","year":"1972","unstructured":"Lawson, C.L.: Transforming triangulations. Discrete Mathematics 3(4), 365\u2013372 (1972)","journal-title":"Discrete Mathematics"},{"key":"80_CR16","doi-asserted-by":"crossref","unstructured":"A. E. Mouawad, N. Nishimura, and V. Raman. Vertex cover reconfiguration and beyond, 2014. arXiv:1402.4926","DOI":"10.1007\/978-3-319-13075-0_36"},{"key":"80_CR17","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":"80_CR18","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226. New York, NY, ACM (1978)","DOI":"10.1145\/800133.804350"},{"key":"80_CR19","unstructured":"Schwerdtfeger, K.W.: A computational trichotomy for connectivity of boolean satisfiability (2013). CoRR, abs\/1312.4524"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:15:55Z","timestamp":1676945755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}