{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:15:51Z","timestamp":1742966151513,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_31","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"365-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect"],"prefix":"10.1007","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert A.","family":"Hearn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"issue":"1","key":"31_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(1), 132\u2013143 (2014)","journal-title":"J. Comb. Optim."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.09.012","volume":"510","author":"PS Bonsma","year":"2013","unstructured":"Bonsma, P.S.: The complexity of rerouting shortest paths. Theor. Comput. Sci. 510, 1\u201312 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"50","key":"31_CR3","doi-asserted-by":"publisher","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","volume":"410","author":"PS Bonsma","year":"2009","unstructured":"Bonsma, P.S., Cereceda, L.: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci. 410(50), 5215\u20135226 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR4","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"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-13524-3_10","volume-title":"Parameterized and Exact Computation","author":"P Bonsma","year":"2014","unstructured":"Bonsma, P., Mouawad, A.E., Nishimura, N., Raman, V.: The complexity of bounded length graph recoloring and CSP reconfiguration. In: Cygan, M., Heggernes, P. (eds.) IPEC 2014. LNCS, vol. 8894, pp. 110\u2013121. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13524-3_10"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/jgt.21992","volume":"83","author":"PS Bonsma","year":"2016","unstructured":"Bonsma, P.S.: Independent set reconfiguration in cographs and their generalizations. J. Graph Theory 83(2), 164\u2013195 (2016)","journal-title":"J. Graph Theory"},{"issue":"1","key":"31_CR7","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-colorings. J. Graph Theory 67(1), 69\u201382 (2011)","journal-title":"J. Graph Theory"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2015.07.037","volume":"600","author":"ED Demaine","year":"2015","unstructured":"Demaine, E.D., Demaine, M.L., Fox-Epstein, E., Hoang, D.A., Ito, T., Ono, H., Otachi, Y., Uehara, R., Yamada, T.: Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600, 132\u2013142 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"31_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. 38(6), 2330\u20132355 (2009)","journal-title":"SIAM J. Comput."},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2016.08.016","volume":"651","author":"A Haddadan","year":"2016","unstructured":"Haddadan, A., Ito, T., Mouawad, A.E., Nishimura, N., Ono, H., Suzuki, A., Tebbal, Y.: The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651, 37\u201349 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"31_CR11","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RE Hearn","year":"2005","unstructured":"Hearn, R.E., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1\u20132), 72\u201386 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR12","doi-asserted-by":"crossref","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, & Computation","author":"RE Hearn","year":"2009","unstructured":"Hearn, R.E., Demaine, E.D.: Games, Puzzles, & Computation. A. K. Peters\/CRC Press, Boca Raton (2009)"},{"key":"31_CR13","unstructured":"van den Heuvel, J.: The complexity of change. In: Blackburn, S.R., Gerke, S., Wildon, M. (eds.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series (2013)"},{"key":"31_CR14","unstructured":"Hoang, D.A., Uehara, R.: Sliding tokens on a cactus. In: 27th International Symposium on Algorithms and Computation (ISAAC), pp. 37:1\u201337:26 (2016)"},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10878-012-9562-z","volume":"28","author":"T Ito","year":"2014","unstructured":"Ito, T., Demaine, E.D.: Approximability of the subset sum reconfiguration problem. J. Comb. Optim. 28(3), 639\u2013654 (2014)","journal-title":"J. Comb. Optim."},{"key":"31_CR16","first-page":"154","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. Theor. Comput. Sci. 412, 154\u2013165 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"15","key":"31_CR17","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., Kaminski, M., Demaine, E.D.: Reconfiguration of list edge-colorings in a graph. Discrete Appl. Math. 160(15), 2199\u20132207 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"31_CR18","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1587\/transinf.2015FCP0010","volume":"99\u2013D","author":"T Ito","year":"2016","unstructured":"Ito, T., Nooka, H., Zhou, X.: Reconfiguration of vertex covers in a graph. IEICE Trans. 99\u2013D(3), 598\u2013606 (2016)","journal-title":"IEICE Trans."},{"issue":"39","key":"31_CR19","doi-asserted-by":"publisher","first-page":"5205","DOI":"10.1016\/j.tcs.2011.05.021","volume":"412","author":"M Kaminski","year":"2011","unstructured":"Kaminski, M., Medvedev, P., Milanic, M.: Shortest paths between shortest paths. Theor. Comput. Sci. 412(39), 5205\u20135210 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","volume":"439","author":"M Kaminski","year":"2012","unstructured":"Kaminski, M., Medvedev, P., Milanic, M.: Complexity of independent set reconfigurability problems. Theor. Comput. Sci. 439, 9\u201315 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar satisfiability and its uses. SIAM J. Comput. 11, 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"18","key":"31_CR22","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1016\/j.dam.2010.08.019","volume":"158","author":"K Makino","year":"2010","unstructured":"Makino, K., Tamaki, S., Yamamoto, M.: On the Boolean connectivity problem for Horn relations. Discrete Appl. Math. 158(18), 2024\u20132030 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"35","key":"31_CR23","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. Theor. Comput. Sci. 412(35), 4613\u20134618 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-44543-4_13","volume-title":"Combinatorial Algorithms","author":"H Mizuta","year":"2016","unstructured":"Mizuta, H., Ito, T., Zhou, X.: Reconfiguration of Steiner trees in an unweighted graph. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 163\u2013175. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44543-4_13"},{"issue":"2","key":"31_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/49097.49099","volume":"19","author":"BME Moret","year":"1988","unstructured":"Moret, B.M.E.: Planar NAE3SAT is in P. ACM SIGACT News 19(2), 51\u201354 (1988)","journal-title":"ACM SIGACT News"},{"key":"31_CR26","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1007\/978-3-662-47672-7_80","volume-title":"Automata, Languages, and Programming","author":"Amer E. Mouawad","year":"2015","unstructured":"Mouawad, A.E., Nishimura, N., Pathak, V., Raman, V.: Shortest reconfiguration paths in the solution space of Boolean formulas. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 985\u2013996 (2015)"},{"key":"31_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-22177-9_10","volume-title":"Fundamentals of Computation Theory","author":"P Scharpfenecker","year":"2015","unstructured":"Scharpfenecker, P.: On the structure of solution-graphs for Boolean formulas. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 118\u2013130. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22177-9_10"},{"issue":"3\/4","key":"31_CR28","first-page":"173","volume":"8","author":"KW Schwerdtfeger","year":"2014","unstructured":"Schwerdtfeger, K.W.: A computational trichotomy for connectivity of Boolean satisfiability. JSAT 8(3\/4), 173\u2013195 (2014)","journal-title":"JSAT"},{"key":"31_CR29","unstructured":"Slocum, J., Sonneveld, D.: The 15 puzzle: how it drove the world crazy. The Slocum Puzzle Foundation (2006)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:35:29Z","timestamp":1710347729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}