{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:43:01Z","timestamp":1743144181568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031270505"},{"type":"electronic","value":"9783031270512"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27051-2_10","type":"book-chapter","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:03:35Z","timestamp":1678665815000},"page":"102-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Longest Flip Sequence 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":[[2023,3,13]]},"reference":[{"issue":"2","key":"10_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. Discrete Comput. Geom. 54(2), 368\u2013389 (2015). https:\/\/doi.org\/10.1007\/s00454-015-9709-7","journal-title":"Discrete Comput. Geom."},{"key":"10_CR2","volume-title":"The Traveling Salesman Problem","author":"DL Applegate","year":"2011","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem. Princeton University Press, Princeton (2011)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: 37th Conference on Foundations of Computer Science, pp. 2\u201311 (1996)","DOI":"10.1109\/SFCS.1996.548458"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-89550-3_3","volume-title":"Computational Geometry and Graph Theory","author":"S Bereg","year":"2008","unstructured":"Bereg, S., Ito, H.: Transforming graphs with the same degree sequence. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds.) KyotoCGGT 2007. LNCS, vol. 4535, pp. 25\u201332. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89550-3_3"},{"key":"10_CR5","first-page":"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)","journal-title":"J. Inf. Process."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Biniaz, A., Maheshwari, A., Smid, M.: Flip distance to some plane configurations. Comput. Geom. 81, 12\u201321 (2019). https:\/\/arxiv.org\/abs\/1905.00791","DOI":"10.1016\/j.comgeo.2019.01.008"},{"key":"10_CR7","unstructured":"Bonamy, M., et al.: The perfect matching reconfiguration problem. In: 44th International Symposium on Mathematical Foundations of Computer Science. LIPIcs, vol. 138, pp. 80:1\u201380:14 (2019)"},{"key":"10_CR8","unstructured":"Bonnet, \u00c9., Miltzow, T.: Flip distance to a non-crossing perfect matching (2016). https:\/\/arxiv.org\/abs\/1601.05989"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-030-38919-2_7","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"N Bousquet","year":"2020","unstructured":"Bousquet, N., Joffard, A.: Approximating shortest connected graph transformation for trees. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 76\u201387. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_7"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"101842","DOI":"10.1016\/j.comgeo.2021.101842","volume":"102","author":"M Buchin","year":"2022","unstructured":"Buchin, M., Kilgus, B.: Fr\u00e9chet distance between two point sets. Comput. Geom. 102, 101842 (2022)","journal-title":"Comput. Geom."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-26176-4_10","volume-title":"Computing and Combinatorics","author":"M Chleb\u00edk","year":"2019","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of travelling salesman via weighted amplifiers. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 115\u2013127. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_10"},{"key":"10_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. In: 15th Latin American Theoretical Informatics Symposium (LATIN 2022). LNCS, vol. 13568. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20624-5_44, https:\/\/arxiv.org\/abs\/2202.11857","DOI":"10.1007\/978-3-031-20624-5_44"},{"key":"10_CR13","doi-asserted-by":"publisher","DOI":"10.5772\/547","volume-title":"Traveling Salesman Problem: Theory and Applications","author":"D Davendra","year":"2010","unstructured":"Davendra, D.: Traveling Salesman Problem: Theory and Applications. BoD-Books on Demand, Norderstedt (2010)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/s00453-013-9801-4","volume":"68","author":"M Englert","year":"2013","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 (2013). https:\/\/doi.org\/10.1007\/s00453-013-9801-4","journal-title":"Algorithmica"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P., Lov\u00e1sz, L., Simmons, A., Straus, E.G.: Dissection graphs of planar point sets. In: A Survey of Combinatorial Theory, pp. 139\u2013149. Elsevier (1973)","DOI":"10.1016\/B978-0-7204-2262-7.50018-1"},{"issue":"3","key":"10_CR16","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)","journal-title":"Comb. Probab. Comput."},{"key":"10_CR17","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2006","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations, vol. 12. Springer Science & Business Media, Berlin (2006)"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"SL Hakimi","year":"1962","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)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0111010","volume":"11","author":"SL Hakimi","year":"1963","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)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10_CR20","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":"10_CR21","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":"10_CR22","unstructured":"Joffard, A.: Graph domination and reconfiguration problems. Ph.D. thesis, Universit\u00e9 Claude Bernard Lyon 1 (2020)"},{"issue":"4","key":"10_CR23","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":"10_CR24","unstructured":"van Leeuwen, J.: Untangling a traveling salesman tour in the plane. In: 7th Workshop on Graph-Theoretic Concepts in Computer Science (1981)"},{"key":"10_CR25","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":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"JS Mitchell","year":"1999","unstructured":"Mitchell, J.S.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-mst, and related problems. SIAM J. Comput. 28(4), 1298\u20131309 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR27","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018)","journal-title":"Algorithms"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-89550-3_17","volume-title":"Computational Geometry and Graph Theory","author":"Y Oda","year":"2008","unstructured":"Oda, Y., Watanabe, M.: The number of flips required to obtain non-crossing convex cycles. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds.) KyotoCGGT 2007. LNCS, vol. 4535, pp. 155\u2013165. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89550-3_17"},{"issue":"5","key":"10_CR29","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":"10_CR30","doi-asserted-by":"crossref","unstructured":"Rao, S.B., Smith, W.D.: Approximating geometrical graphs via \"spanners\" and \"banyans\". In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 540\u2013550 (1998)","DOI":"10.1145\/276698.276868"},{"issue":"3","key":"10_CR31","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)","journal-title":"SIAM J. Discret. Math."},{"key":"10_CR32","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-3-031-27051-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T06:13:02Z","timestamp":1729059182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27051-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031270505","9783031270512"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27051-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 March 2023","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":"Hsinchu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.walcom2023.conf.nycu.edu.tw\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"30","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":"40% - 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":"10","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":"This proceeding includes 2 invited papers.","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)"}}]}}