{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:24:22Z","timestamp":1758587062637,"version":"3.44.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_4","type":"book-chapter","created":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T08:46:34Z","timestamp":1758530794000},"page":"45-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reconfiguring Planar Perfect Matchings via\u00a0Bounded Length Alternating Cycles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5207-0375","authenticated-orcid":false,"given":"Robert D.","family":"Barish","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1514-5766","authenticated-orcid":false,"given":"Tetsuo","family":"Shibuya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"4_CR1","unstructured":"Bonamy, M., et al.: The perfect matching reconfiguration problem. In: Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 80:1\u201380:14 (2019)"},{"key":"4_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, 1st edn. Macmillan Press, New York, NY (1976)","edition":"1"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Hatanaka, T., Ito, T., M\u00fchlenthaler, M.: Shortest reconfiguration of matchings. In: Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 162\u2013174 (2019)","DOI":"10.1007\/978-3-030-30786-8_13"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s00453-015-0014-x","volume":"75","author":"Y Cao","year":"2016","unstructured":"Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. Algorithmica 75(1), 118\u2013137 (2016)","journal-title":"Algorithmica"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Comb. Theory. Ser. B 18(2), 138\u2013154 (1975)","journal-title":"J. Comb. Theory. Ser. B"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Burlingham, L.S.: Complement reducible graphs. Discret. Appl. Math. 3(3), 163\u2013174 (1981)","journal-title":"Discret. Appl. Math."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Curticapean, R., Xia, M.: Parameterizing the permanent: genus, apices, minors, evaluation mod 2k. In: Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 994\u20131009 (2015)","DOI":"10.1109\/FOCS.2015.65"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 5th edn. Springer-Verlag, Heidelberg (2017).","DOI":"10.1007\/978-3-662-53622-3"},{"issue":"1\u20133","key":"4_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0166-218X(99)00149-3","volume":"99","author":"FF Dragan","year":"2000","unstructured":"Dragan, F.F.: Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs. Discret. Appl. Math. 99(1\u20133), 427\u2013442 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"KP Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5(4), 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0893-9659(94)90045-0","volume":"7","author":"K Fukuda","year":"1994","unstructured":"Fukuda, K., Matsui, T.: Finding all the perfect matchings in bipartite graphs. Appl. Math. Lett. 7(1), 15\u201318 (1994)","journal-title":"Appl. Math. Lett."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Galluccio, A., Loebl, M.: On the theory of Pfaffian orientations. I. Perfect matchings and permanents. Electron. J. Comb. 6(R6), 1\u201318 (1999)","DOI":"10.37236\/1438"},{"issue":"1\u20132","key":"4_CR14","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. Theor. Comput. Sci. 343(1\u20132), 72\u201396 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR15","unstructured":"Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y.: Shortest reconfiguration of perfect matchings via alternating cycles. In: Proceedings of the 27th Annual European Symposium on Algorithms (ESA), pp. 61:1\u201361:15 (2019)"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1137\/20M1364370","volume":"36","author":"T Ito","year":"2022","unstructured":"Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y.: Shortest reconfiguration of perfect matchings via alternating cycles. SIAM J. Discret. Math. 36(2), 1102\u20131123 (2022)","journal-title":"SIAM J. Discret. Math."},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput. 28(5), 1906\u20131922 (1999)","journal-title":"SIAM J. Comput."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Kasteleyn, P.W.: The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice. Physica 27(12), 1209\u20131225 (1961)","DOI":"10.1016\/0031-8914(61)90063-5"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1063\/1.1703953","volume":"4","author":"PW Kasteleyn","year":"1963","unstructured":"Kasteleyn, P.W.: Dimer statistics and phase transitions. J. Math. Phys. 4(2), 287\u2013293 (1963)","journal-title":"J. Math. Phys."},{"key":"4_CR20","first-page":"43","volume-title":"Graph Theory and Theoretical Physics","author":"PW Kasteleyn","year":"1967","unstructured":"Kasteleyn, P.W.: Graph theory and crystal physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 43\u2013110. Academic Press, London, UK (1967)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Kurita, K., Wasa, K.: Polynomial-delay and polynomial-space enumeration of large maximal matchings. In: Proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 342\u2013355 (2022)","DOI":"10.1007\/978-3-031-15914-5_25"},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1137\/0208049","volume":"8","author":"MS Krishnamoorthy","year":"1979","unstructured":"Krishnamoorthy, M.S., Deo, N.: Node-deletion NP-complete problems. SIAM J. Comput. 8(4), 619\u2013625 (1979)","journal-title":"SIAM J. Comput."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Lewis, J.M.: On the complexity of the maximum subgraph problem. In: Proceedings of the 10th Annual Symposium on Theory of Computing (STOC), pp. 265\u2013274 (1978)","DOI":"10.1145\/800133.804356"},{"key":"4_CR24","unstructured":"Papadimitriou, C.H.: Computational Complexity, 1st edn. Addison Wesley, Reading, MA (1994)"},{"issue":"4","key":"4_CR25","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1088\/0305-4470\/33\/4\/308","volume":"33","author":"T Regge","year":"2000","unstructured":"Regge, T., Zecchina, R.: Combinatorial and topological approach to the 3D Ising model. J. Phys. A: Math. Gen. 33(4), 741\u2013761 (2000)","journal-title":"J. Phys. A: Math. Gen."},{"issue":"4","key":"4_CR26","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"CD Savage","year":"1997","unstructured":"Savage, C.D.: A survey of combinatorial Gray codes. SIAM Rev. 39(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"4_CR28","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","volume":"59","author":"J Spinrad","year":"1995","unstructured":"Spinrad, J., Sritharan, R.: Algorithms for weakly triangulated graphs. Discret. Appl. Math. 59(2), 181\u2013191 (1995)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0020-0190(91)90184-J","volume":"39","author":"JP Spinrad","year":"1991","unstructured":"Spinrad, J.P.: Finding large holes. Inf. Process. Lett. 39(4), 227\u2013229 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"68","key":"4_CR30","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1080\/14786436108243366","volume":"6","author":"HNV Temperley","year":"1961","unstructured":"Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics - an exact result. Philos. Mag. 6(68), 1061\u20131063 (1961)","journal-title":"Philos. Mag."},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1006\/jctb.1999.1941","volume":"78","author":"G Tesler","year":"2000","unstructured":"Tesler, G.: Matchings in graphs on non-orientable surfaces. J. Comb. Theory Ser. B 78(2), 198\u2013231 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Uno, T.: Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs. In: Leong, H.W., Imai, H., Jain, S. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 92\u2013101. Springer, Heidelberg (1997).","DOI":"10.1007\/3-540-63890-3_11"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Uno, T.: A fast algorithm for enumerating bipartite perfect matchings. In: Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC), pp. 367\u2013379 (2001)","DOI":"10.1007\/3-540-45678-3_32"},{"key":"4_CR34","first-page":"89","volume":"3","author":"T Uno","year":"2001","unstructured":"Uno, T.: A fast algorithm for enumerating non-bipartite maximal matchings. NII J. 3, 89\u201397 (2001)","journal-title":"NII J."},{"issue":"2","key":"4_CR35","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8(2), 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR36","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"4_CR37","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/0890-5401(89)90017-5","volume":"80","author":"VV Vazirani","year":"1989","unstructured":"Vazirani, V.V.: NC algorithms for computing the number of perfect matchings in $${K}_{3,3}$$-free graphs and related problems. Inf. Comput. 80(2), 152\u2013164 (1989)","journal-title":"Inf. Comput."},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the 10th Annual Symposium on Theory of Computing (STOC), pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"},{"key":"4_CR39","unstructured":"van\u00a0der Zanden, T.C.: Parameterized complexity of graph constraint logic. In: Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC), pp. 282\u2013293 (2015)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T08:46:45Z","timestamp":1758530805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}