{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T15:40:15Z","timestamp":1772466015650,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE40-0032"],"award-info":[{"award-number":["ANR-18-CE40-0032"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00454-025-00785-8","type":"journal-article","created":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T17:06:49Z","timestamp":1760116009000},"page":"431-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reconfiguration of Plane Trees in Convex Geometric Graphs"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0170-0503","authenticated-orcid":false,"given":"Nicolas","family":"Bousquet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5865-4697","authenticated-orcid":false,"given":"Lucas","family":"De Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5586-5613","authenticated-orcid":false,"given":"Th\u00e9o","family":"Pierron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4841-5937","authenticated-orcid":false,"given":"Alexandra","family":"Wesolek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,10]]},"reference":[{"key":"785_CR1","doi-asserted-by":"crossref","unstructured":"Ackerman, E., Allen, M. M., Barequet, G., L\u00f6ffler, M., Mermelstein, J., Souvaine, D. L., T\u00f3th, C. D.: The flip diameter of rectangulations and convex subdivisions. Discrete Mathematics & Theoretical Computer Science, 18(Combinatorics), 2016","DOI":"10.46298\/dmtcs.646"},{"issue":"1","key":"785_CR2","first-page":"224","volume":"15","author":"O Aichholzer","year":"2024","unstructured":"Aichholzer, O., Ballinger, B., Biedl, T., Damian, M., Demaine, E.D., Korman, M., Lubiw, A., Lynch, J., Tkadlec, J., Uno, Y.: Reconfiguration of non-crossing spanning trees. J. Comput. Geom. 15(1), 224\u2013253 (2024)","journal-title":"J. Comput. Geom."},{"issue":"6\u20137","key":"785_CR3","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.comgeo.2008.12.005","volume":"42","author":"O Aichholzer","year":"2009","unstructured":"Aichholzer, O., Bereg, S., Dumitrescu, A., Garc\u00eda, A., Huemer, C., Hurtado, F., Kano, M., M\u00e1rquez, A., Rappaport, D., Smorodinsky, S., Souvaine, D., Urrutia, J., Wood, D.R.: Compatible geometric matchings. Comput. Geom. 42(6\u20137), 617\u2013626 (2009)","journal-title":"Comput. Geom."},{"key":"785_CR4","doi-asserted-by":"crossref","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math., 65(1-3):21\u201346, 1996. First International Colloquium on Graphs and Optimization (GOI), 1992 (Grimentz)","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"785_CR5","doi-asserted-by":"crossref","unstructured":"Bjerkevik, H. B., Kleist, L., Ueckerdt, T., Vogtenhuber, B.: Flipping non-crossing spanning trees. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2313\u20132325, Society for Industrial and Applied Mathematics, (2025)","DOI":"10.1137\/1.9781611978322.77"},{"issue":"1","key":"785_CR6","first-page":"8","volume":"2","author":"N Bousquet","year":"2023","unstructured":"Bousquet, N., Gledel, V., Narboni, J., Pierron, T.: A note on the flip distance between non-crossing spanning trees. Comput. Geom. Topology 2(1), 8\u20131 (2023)","journal-title":"Comput. Geom. Topology"},{"key":"785_CR7","unstructured":"Bousquet, N., Ito, T., Kobayashi, Y., Mizuta, H., Ouvrard, P., Suzuki, A, Wasa, K.: Reconfiguration of spanning trees with many or few leaves. In 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), pages 24:1\u201324:15, (2020)"},{"issue":"9","key":"785_CR8","doi-asserted-by":"publisher","first-page":"2779","DOI":"10.1007\/s00453-023-01117-z","volume":"85","author":"N Bousquet","year":"2023","unstructured":"Bousquet, N., Ito, T., Kobayashi, Y., Mizuta, H., Ouvrard, P., Suzuki, A., Wasa, K.: Reconfiguration of spanning trees with degree constraints or diameter constraints. Algorithmica 85(9), 2779\u20132816 (2023)","journal-title":"Algorithmica"},{"key":"785_CR9","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 and Combinatorics 18, 517\u2013532 (2002)","journal-title":"Graphs and Combinatorics"},{"key":"785_CR10","doi-asserted-by":"crossref","unstructured":"Hernando, M.C., Hurtado, F., M\u00e1rquez, A., Mora, M., Noy, M.: Geometric tree graphs of points in convex position. Discrete Applied Mathematics, 93(1):51\u201366, 1999. 13th European Workshop on Computational Geometry CG \u201997","DOI":"10.1016\/S0166-218X(99)00006-2"},{"key":"785_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 and Combinatorics 21, 325\u2013331 (2005)","journal-title":"Graphs and Combinatorics"},{"issue":"3","key":"785_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/PL00009464","volume":"22","author":"F Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M., Urrutia, J.: Flipping edges in triangulations. Discrete & Computational Geometry 22(3), 333\u2013346 (1999)","journal-title":"Discrete & Computational Geometry"},{"key":"785_CR13","unstructured":"Kobayashi, Y., Mahara, R., Schwarcz, T.: Reconfiguration of the union of arborescences. CoRR, abs\/2304.13217, (2023)"},{"key":"785_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.comgeo.2014.11.001","volume":"49","author":"A Lubiw","year":"2015","unstructured":"Lubiw, A., Pathak, V.: Flip distance between two triangulations of a point set is np-complete. Comput. Geom. 49, 17\u201323 (2015)","journal-title":"Comput. Geom."},{"issue":"8","key":"785_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111929","volume":"343","author":"TL Nichols","year":"2020","unstructured":"Nichols, T.L., Pilz, A., T\u00f3th, C.D., Zehmakan, A.N.: Transition operations over plane trees. Discret. Math. 343(8), 111929 (2020)","journal-title":"Discret. Math."},{"issue":"4","key":"785_CR16","first-page":"52","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018)","journal-title":"Introduction to reconfiguration. Algorithms"},{"issue":"5","key":"785_CR17","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)","journal-title":"Comput. Geom."},{"key":"785_CR18","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)","journal-title":"Adv. Math."},{"key":"785_CR19","doi-asserted-by":"crossref","unstructured":"Sleator, D.\u00a0D., Tarjan, R.\u00a0E., Thurston, W.\u00a0P.: Rotation distance, triangulations, and hyperbolic geometry. Journal of the American Mathematical Society, pages 647\u2013681, (1988)","DOI":"10.1090\/S0894-0347-1988-0928904-4"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00785-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-025-00785-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00785-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T14:49:32Z","timestamp":1772462972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-025-00785-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["785"],"URL":"https:\/\/doi.org\/10.1007\/s00454-025-00785-8","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,10]]},"assertion":[{"value":"23 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}