{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:58:21Z","timestamp":1769561901159,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030307851","type":"print"},{"value":"9783030307868","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-30786-8_13","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:22:57Z","timestamp":1568236977000},"page":"162-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Shortest Reconfiguration of Matchings"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bousquet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuhiko","family":"Hatanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takehiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"M\u00fchlenthaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s00454-015-9709-7","volume":"54","author":"O Aichholzer","year":"2015","unstructured":"Aichholzer, O., Mulzer, W., Pilz, A.: Flip distance between triangulations of a simple polygon is NP-complete. Discret. Comput. Geom. 54(2), 368\u2013389 (2015). \n                    https:\/\/doi.org\/10.1007\/s00454-015-9709-7","journal-title":"Discret. Comput. Geom."},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: fast subset convolution. In: Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, pp. 67\u201374. ACM (2007). \n                    https:\/\/doi.org\/10.1145\/1250790.1250801","DOI":"10.1145\/1250790.1250801"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ejc.2017.10.010","volume":"69","author":"M Bonamy","year":"2018","unstructured":"Bonamy, M., Bousquet, N.: Recoloring graphs via tree decompositions. Eur. J. Comb. 69, 200\u2013213 (2018). \n                    https:\/\/doi.org\/10.1016\/j.ejc.2017.10.010","journal-title":"Eur. J. Comb."},{"key":"13_CR4","unstructured":"Bousquet, N., Hatanaka, T., Ito, T., M\u00fchlenthaler, M.: Shortest reconfiguration of matchings. CoRR abs\/1812.05419 (2018)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M Charikar","year":"1999","unstructured":"Charikar, M., et al.: Approximation algorithms for directed Steiner problems. J. Algorithms 33(1), 73\u201391 (1999). \n                    https:\/\/doi.org\/10.1006\/jagm.1999.1042","journal-title":"J. Algorithms"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., Eisenstat, S., Rudoy, M.: Solving the Rubik\u2019s cube optimally is NP-complete. In: 35th Symposium on Theoretical Aspects of Computer Science. STACS, vol. 96, pp. 24:1\u201324:13 (2018). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2018.24","DOI":"10.4230\/LIPIcs.STACS.2018.24"},{"key":"13_CR7","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 624\u2013633. ACM, New York (2014). \n                    https:\/\/doi.org\/10.1145\/2591796.2591884","DOI":"10.1145\/2591796.2591884"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971). \n                    https:\/\/doi.org\/10.1002\/net.3230010302","journal-title":"Networks"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1002\/jgt.22000","volume":"83","author":"C Feghali","year":"2016","unstructured":"Feghali, C., Johnson, M., Paulusma, D.: A reconfigurations analogue of Brooks\u2019 theorem and its consequences. J. Graph Theory 83(4), 340\u2013358 (2016)","journal-title":"J. Graph Theory"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01206636","volume":"4","author":"AM Frieze","year":"1994","unstructured":"Frieze, A.M., Teng, S.H.: On the complexity of computing the diameter of a polytope. Comput. Complex. 4(3), 207\u2013219 (1994). \n                    https:\/\/doi.org\/10.1007\/BF01206636","journal-title":"Comput. Complex."},{"issue":"6","key":"13_CR12","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1137\/07070440X","volume":"38","author":"Parikshit 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. 2330\u20132355 (2009). \n                    https:\/\/doi.org\/10.1137\/07070440X","journal-title":"SIAM Journal on Computing"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-10801-4_18","volume-title":"SOFSEM 2019: Theory and Practice of Computer Science","author":"M Gupta","year":"2019","unstructured":"Gupta, M., Kumar, H., Misra, N.: On the complexity of optimal matching reconfiguration. In: Catania, B., Kr\u00e1lovi\u010d, R., Nawrocki, J., Pighizzini, G. (eds.) SOFSEM 2019. LNCS, vol. 11376, pp. 221\u2013233. Springer, Cham (2019). \n                    https:\/\/doi.org\/10.1007\/978-3-030-10801-4_18"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"van den Heuvel, J.: The complexity of change. In: Surveys in Combinatorics 2013, pp. 127\u2013160. Cambridge University Press (2013)","DOI":"10.1017\/CBO9781139506748.005"},{"issue":"12\u201314","key":"13_CR15","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., et al.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2010.12.005","journal-title":"Theor. Comput. Sci."},{"key":"13_CR16","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). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2012.03.004","journal-title":"Theor. Comput. Sci."},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Li, S., Feng, Q., Meng, X., Wang, J.: An improved FPT algorithm for the flip distance problem. In: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), vol. 83, pp. 65:1\u201365:13 (2017). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2017.65","DOI":"10.4230\/LIPIcs.MFCS.2017.65"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/1.9781611975031.13","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Daniel Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Mouawad, A.E.: The complexity of independent set reconfiguration on bipartite graphs. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 185\u2013195. SIAM (2018)"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"2185","DOI":"10.1137\/16M1065288","volume":"31","author":"AE Mouawad","year":"2017","unstructured":"Mouawad, A.E., Nishimura, N., Pathak, V., Raman, V.: Shortest reconfiguration paths in the solution space of Boolean formulas. SIAM J. Discret. Math. 31(3), 2185\u20132200 (2017). \n                    https:\/\/doi.org\/10.1137\/16M1065288","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"13_CR20","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"Naomi Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4:52) (2018). \n                    https:\/\/doi.org\/10.3390\/a11040052","journal-title":"Algorithms"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of facets (and some facets of complexity). J. Comput. Syst. Sci. 28(2), 244\u2013259 (1984). \n                    https:\/\/doi.org\/10.1016\/0022-0000(84)90068-0","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"13_CR22","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.comgeo.2014.01.001","volume":"47","author":"A Pilz","year":"2014","unstructured":"Pilz, A.: Flip distance between triangulations of a planar point set is APX-hard. Comput. Geom. 47(5), 589\u2013604 (2014). \n                    https:\/\/doi.org\/10.1016\/j.comgeo.2014.01.001","journal-title":"Comput. Geom."},{"key":"13_CR23","volume-title":"Combinatorial Optimization - Polyhedra and Efficiency, Algorithms and Combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-30139-6_19","volume-title":"WALCOM: Algorithms and Computation","author":"T Yamada","year":"2016","unstructured":"Yamada, T., Uehara, R.: Shortest reconfiguration of sliding tokens on a caterpillar. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 236\u2013248. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-30139-6_19"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:24:33Z","timestamp":1568237073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"87","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}