{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:40:15Z","timestamp":1742920815305,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0566-5_13","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"163-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Short Flip Sequences to\u00a0Untangle Segments in\u00a0the\u00a0Plane"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9807-028X","authenticated-orcid":false,"given":"Guilherme D.","family":"da Fonseca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2664-0650","authenticated-orcid":false,"given":"Yan","family":"Gerard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5985-2169","authenticated-orcid":false,"given":"Bastien","family":"Rivier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"13_CR1","unstructured":"Aichholzer, O., et al.: Reconfiguration of non-crossing spanning trees. arXiv preprint (2022). https:\/\/arxiv.org\/abs\/2206.03879"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., et al.: Flipping plane spanning paths. In: International Conference and Workshops on Algorithms and Computation (WALCOM) (2023). https:\/\/doi.org\/10.1007\/978-3-031-27051-2_5, https:\/\/arxiv.org\/abs\/2202.10831","DOI":"10.1007\/978-3-031-27051-2_5"},{"issue":"2","key":"13_CR3","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. Discrete Comput. Geom. 54(2), 368\u2013389 (2015). https:\/\/doi.org\/10.1007\/s00454-015-9709-7","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2007.05.009","volume":"104","author":"SG Akl","year":"2007","unstructured":"Akl, S.G., Islam, M.K., Meijer, H.: On planar path transformation. Inf. Process. Lett. 104(2), 59\u201364 (2007). https:\/\/doi.org\/10.1016\/j.ipl.2007.05.009","journal-title":"Inf. Process. Lett."},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Bereg, S., Ito, H.: Transforming graphs with the same degree sequence. In: Computational Geometry and Graph Theory, pp. 25\u201332 (2008). https:\/\/doi.org\/10.1007\/978-3-540-89550-3_3","DOI":"10.1007\/978-3-540-89550-3_3"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"627","DOI":"10.2197\/ipsjjip.25.627","volume":"25","author":"S Bereg","year":"2017","unstructured":"Bereg, S., Ito, H.: Transforming graphs with the same graphic sequence. J. Inf. Process. 25, 627\u2013633 (2017). https:\/\/doi.org\/10.2197\/ipsjjip.25.627","journal-title":"J. Inf. Process."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Biniaz, A., Maheshwari, A., Smid, M.: Flip distance to some plane configurations. Comput. Geom. 81, 12\u201321 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.01.008, https:\/\/arxiv.org\/abs\/1905.00791","DOI":"10.1016\/j.comgeo.2019.01.008"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Bonamy, M., et al.: The perfect matching reconfiguration problem. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS). LIPIcs, vol. 138, pp. 80:1\u201380:14 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.80","DOI":"10.4230\/LIPIcs.MFCS.2019.80"},{"key":"13_CR9","unstructured":"Bonnet, \u00c9., Miltzow, T.: Flip distance to a non-crossing perfect matching. arXiv 1601.05989 (2016). http:\/\/arxiv.org\/abs\/1601.05989"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Bousquet, N., Joffard, A.: Approximating shortest connected graph transformation for trees. In: Theory and Practice of Computer Science, pp. 76\u201387 (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_7","DOI":"10.1007\/978-3-030-38919-2_7"},{"issue":"8","key":"13_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ipl.2008.12.017","volume":"109","author":"JM Chang","year":"2009","unstructured":"Chang, J.M., Wu, R.Y.: On the diameter of geometric path graphs of points in convex position. Inf. Process. Lett. 109(8), 409\u2013413 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2008.12.017","journal-title":"Inf. Process. Lett."},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Das, A.K., Das, S., da Fonseca, G.D., Gerard, Y., Rivier, B.: Complexity results on untangling red-blue matchings. Comput. Geom. 111, 101974 (2023). https:\/\/doi.org\/10.1016\/j.comgeo.2022.101974, https:\/\/arxiv.org\/abs\/2202.11857","DOI":"10.1016\/j.comgeo.2022.101974"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/s00453-013-9801-4","volume":"68","author":"M Englert","year":"2014","unstructured":"Englert, M., R\u00f6glin, H., V\u00f6cking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. Algorithmica 68(1), 190\u2013264 (2014). https:\/\/doi.org\/10.1007\/s00453-013-9801-4","journal-title":"Algorithmica"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1017\/S0963548313000096","volume":"22","author":"PL Erd\u0151s","year":"2013","unstructured":"Erd\u0151s, P.L., Kir\u00e1ly, Z., Mikl\u00f3s, I.: On the swap-distances of different realizations of a graphical degree sequence. Comb. Probab. Comput. 22(3), 366\u2013383 (2013). https:\/\/doi.org\/10.1017\/S0963548313000096","journal-title":"Comb. Probab. Comput."},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"da Fonseca, G.D., Gerard, Y., Rivier, B.: On the longest flip sequence to untangle segments in the plane. In: Lin, CC., Lin, B.M.T., Liotta, G. (eds.) WALCOM: Algorithms and Computation. WALCOM 2023. LNCS, vol. 13973. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27051-2_10","DOI":"10.1007\/978-3-031-27051-2_10"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph. I. J. Soc. Ind. Appl. Math. 10(3), 496\u2013506 (1962)","DOI":"10.1137\/0110037"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph II. uniqueness. J. Soc. Ind. Appl. Math. 11(1), 135\u2013147 (1963)","DOI":"10.1137\/0111010"},{"key":"13_CR18","first-page":"127","volume":"409","author":"J van den Heuvel","year":"2013","unstructured":"van den Heuvel, J.: The complexity of change. Surv. Comb. 409, 127\u2013160 (2013)","journal-title":"Surv. Comb."},{"issue":"3","key":"13_CR19","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 Comput. Geom. 22(3), 333\u2013346 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR20","unstructured":"Joffard, A.: Graph domination and reconfiguration problems. Ph.D. thesis, Universit\u00e9 Claude Bernard Lyon 1 (2020)"},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0012-365X(72)90093-3","volume":"3","author":"CL Lawson","year":"1972","unstructured":"Lawson, C.L.: Transforming triangulations. Discret. Math. 3(4), 365\u2013372 (1972)","journal-title":"Discret. Math."},{"key":"13_CR22","unstructured":"van Leeuwen, J., Schoone, A.A.: Untangling a traveling salesman tour in the plane. In: 7th Workshop on Graph-Theoretic Concepts in Computer Science (1981)"},{"key":"13_CR23","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). https:\/\/doi.org\/10.1016\/j.comgeo.2014.11.001","journal-title":"Comput. Geom."},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018). https:\/\/doi.org\/10.3390\/a11040052","DOI":"10.3390\/a11040052"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Oda, Y., Watanabe, M.: The number of flips required to obtain non-crossing convex cycles. In: Kyoto International Conference on Computational Geometry and Graph Theory, pp. 155\u2013165 (2007)","DOI":"10.1007\/978-3-540-89550-3_17"},{"issue":"5","key":"13_CR26","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). https:\/\/doi.org\/10.1016\/j.comgeo.2014.01.001","journal-title":"Comput. Geom."},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/S0895480197331156","volume":"12","author":"TG Will","year":"1999","unstructured":"Will, T.G.: Switching distance between graphs with the same degrees. SIAM J. Discret. Math. 12(3), 298\u2013306 (1999). https:\/\/doi.org\/10.1137\/S0895480197331156","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR28","unstructured":"Wu, R., Chang, J., Lin, J.: On the maximum switching number to obtain non-crossing convex cycles. In: 26th Workshop on Combinatorial Mathematics and Computation Theory, pp. 266\u2013273 (2009)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0566-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:08:42Z","timestamp":1709654922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","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":"80","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":"28","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":"35% - 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","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","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)"}}]}}