{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:57:43Z","timestamp":1743094663469,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_17","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"213-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Flips in Planar Matchings"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Milich","sequence":"first","affiliation":[]},{"given":"Torsten","family":"M\u00fctze","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Pergel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Asinowski, A., Miltzow, T.: Disjoint compatibility graph of non-crossing matchings of points in convex position. Electron. J. Combin. 22(1), 53 (2015). https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i1p65. Paper 1.65","DOI":"10.37236\/4403"},{"issue":"5","key":"17_CR2","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s00373-007-0750-z","volume":"23","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.: Gray code enumeration of plane straight-line graphs. Graphs Combin. 23(5), 467\u2013479 (2007). https:\/\/doi.org\/10.1007\/s00373-007-0750-z","journal-title":"Graphs Combin."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-030-30786-8_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"O Aichholzer","year":"2019","unstructured":"Aichholzer, O., et al.: Flip distances between graph orientations. In: Sau, I., Thilikos, D.M. (eds.) WG 2019. LNCS, vol. 11789, pp. 120\u2013134. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30786-8_10"},{"key":"17_CR4","unstructured":"Berry, L.A., Reed, B., Scott, A., Wood, D.R.: A logarithmic bound for the chromatic number of the associahedron. arXiv:1811.08972 (2018)"},{"issue":"5","key":"17_CR5","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00493-014-2959-9","volume":"35","author":"C Ceballos","year":"2014","unstructured":"Ceballos, C., Santos, F., Ziegler, G.M.: Many non-equivalent realizations of the associahedron. Combinatorica 35(5), 513\u2013551 (2014). https:\/\/doi.org\/10.1007\/s00493-014-2959-9","journal-title":"Combinatorica"},{"issue":"16","key":"17_CR6","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.ipl.2009.04.023","volume":"109","author":"S Cleary","year":"2009","unstructured":"Cleary, S., St. John, K.: Rotation distance is fixed-parameter tractable. Inf. Process. Lett. 109(16), 918\u2013922 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2009.04.023","journal-title":"Inf. Process. Lett."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Cleary, S., St. John, K.: A linear-time approximation for rotation distance. J. Graph Algorithms Appl. 14(2), 385\u2013390 (2010). http:\/\/dx.doi.org\/10.7155\/jgaa.00212","DOI":"10.7155\/jgaa.00212"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Fabila-Monroy, R., et al.: On the chromatic number of some flip graphs. Discr. Math. Theor. Comput. Sci. 11(2), 47\u201356 (2009). http:\/\/dmtcs.episciences.org\/460","DOI":"10.46298\/dmtcs.460"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/18M1216456","volume":"34","author":"S Felsner","year":"2020","unstructured":"Felsner, S., Kleist, L., M\u00fctze, T., Sering, L.: Rainbow cycles in flip graphs. SIAM J. Discr. Math. 34(1), 1\u201339 (2020). https:\/\/doi.org\/10.1137\/18M1216456","journal-title":"SIAM J. Discr. Math."},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s003730200038","volume":"18","author":"C Hernando","year":"2002","unstructured":"Hernando, C., Hurtado, F., Noy, M.: Graphs of non-crossing perfect matchings. Graphs Combin. 18(3), 517\u2013532 (2002). https:\/\/doi.org\/10.1007\/s003730200038","journal-title":"Graphs Combin."},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s00373-005-0615-2","volume":"21","author":"ME Houle","year":"2005","unstructured":"Houle, M.E., Hurtado, F., Noy, M., Rivera-Campo, E.: Graphs of triangulations and perfect matchings. Graphs Combin. 21(3), 325\u2013331 (2005). https:\/\/doi.org\/10.1007\/s00373-005-0615-2","journal-title":"Graphs Combin."},{"issue":"7","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1016\/j.dam.2008.06.018","volume":"157","author":"C Huemer","year":"2009","unstructured":"Huemer, C., Hurtado, F., Noy, M., Oma\u00f1a-Pulido, E.: Gray codes for non-crossing partitions and dissections of a convex polygon. Discr. Appl. Math. 157(7), 1509\u20131520 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.06.018","journal-title":"Discr. Appl. Math."},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0925-7721(99)00016-4","volume":"13","author":"F Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M.: Graph of triangulations of a convex polygon and tree of triangulations. Comput. Geom. 13(3), 179\u2013188 (1999). https:\/\/doi.org\/10.1016\/S0925-7721(99)00016-4","journal-title":"Comput. Geom."},{"key":"17_CR14","unstructured":"Knuth, D.E.: The Art of Computer Programming. Vol. 4A. Combinatorial Algorithms. Part 1. Addison-Wesley, Upper Saddle River, NJ (2011)"},{"issue":"6","key":"17_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/S0195-6698(89)80072-1","volume":"10","author":"CW Lee","year":"1989","unstructured":"Lee, C.W.: The associahedron and triangulations of the $$n$$-gon. Eur. J. Combin. 10(6), 551\u2013560 (1989). https:\/\/doi.org\/10.1016\/S0195-6698(89)80072-1","journal-title":"Eur. J. Combin."},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-68535-9_12","volume-title":"Computing and Combinatorics","author":"M Li","year":"1998","unstructured":"Li, M., Zhang, L.: Better approximation of diagonal-flip transformation and rotation transformation. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol. 1449, pp. 85\u201394. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68535-9_12"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1006\/jagm.1993.1045","volume":"15","author":"JM Lucas","year":"1993","unstructured":"Lucas, J.M., van Baronaigien, D.R., Ruskey, F.: On rotations and the generation of binary trees. J. Algorithms 15(3), 343\u2013366 (1993). https:\/\/doi.org\/10.1006\/jagm.1993.1045","journal-title":"J. Algorithms"},{"key":"17_CR18","unstructured":"Milich, M.: Kreise f\u00fcr planare Matchings. Bachelor\u2019s thesis, TU Berlin, German (2018)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Milich, M., M\u00fctze, T., Pergel, M.: On flips in planar matchings. arXiv:2002.02290. Preprint version of the present paper with full proofs (2020)","DOI":"10.1007\/978-3-030-60440-0_17"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00454-017-9922-7","volume":"59","author":"H Parlier","year":"2018","unstructured":"Parlier, H., Petri, B.: The genus of curve, pants and flip graphs. Discr. Comput. Geom. 59(1), 1\u201330 (2018). https:\/\/doi.org\/10.1007\/s00454-017-9922-7","journal-title":"Discr. Comput. Geom."},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1112\/blms.12231","volume":"51","author":"V Pilaud","year":"2019","unstructured":"Pilaud, V., Santos, F.: Quotientopes. Bull. Lond. Math. Soc. 51(3), 406\u2013420 (2019). https:\/\/doi.org\/10.1112\/blms.12231","journal-title":"Bull. Lond. Math. Soc."},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.aim.2014.02.035","volume":"259","author":"L Pournin","year":"2014","unstructured":"Pournin, L.: The diameter of associahedra. Adv. Math. 259, 13\u201342 (2014). https:\/\/doi.org\/10.1016\/j.aim.2014.02.035","journal-title":"Adv. Math."},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/jgt.22443","volume":"92","author":"L Pournin","year":"2019","unstructured":"Pournin, L.: Eccentricities in the flip-graphs of convex polygons. J. Graph Theor. 92(2), 111\u2013129 (2019). https:\/\/doi.org\/10.1002\/jgt.22443","journal-title":"J. Graph Theor."},{"key":"17_CR24","series-title":"Progress in Mathematics","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-0348-0405-9_15","volume-title":"Associahedra, Tamari Lattices and Related Structures","author":"N Reading","year":"2012","unstructured":"Reading, N.: From the Tamari lattice to Cambrian lattices and beyond. In: M\u00fcller-Hoissen, F., Pallo, J., Stasheff, J. (eds.) Associahedra, Tamari Lattices and Related Structures. Progress in Mathematics, vol. 299, pp. 293\u2013322. Birkh\u00e4user\/Springer, Basel (2012). https:\/\/doi.org\/10.1007\/978-3-0348-0405-9_15"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-319-44236-5_9","volume-title":"Computing and Combinatorics","author":"N Reading","year":"2016","unstructured":"Reading, N.: Lattice theory of the poset of regions. In: Gr\u00e4tzer, G., Wehrung, F. (eds.) COCOON 1998. LNCS, vol. 1449, pp. 399\u2013487. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44236-5_9"},{"key":"17_CR26","unstructured":"Rogers, R.O.: On finding shortest paths in the rotation graph of binary trees. In: Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, 1999, vol. 137, pp. 77\u201395 (1999)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E., Thurston, W.P.: Rotation distance, triangulations, and hyperbolic geometry. J. Amer. Math. Soc. 1(3), 647\u2013681 (1988). http:\/\/www.jstor.org\/stable\/1990951","DOI":"10.1090\/S0894-0347-1988-0928904-4"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:01:35Z","timestamp":1710266495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","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":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"94","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":"32","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":"34% - 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.7","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":"2.1","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}