{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:15:54Z","timestamp":1743012954905,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492716"},{"type":"electronic","value":"9783031492723"}],"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-49272-3_7","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"95-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degenerate Crossing Number and\u00a0Signed Reversal Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5870-2504","authenticated-orcid":false,"given":"Niloufar","family":"Fuladi","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"Hubard","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7301-3799","authenticated-orcid":false,"given":"Arnaud","family":"de Mesmay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,1]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1109\/SFCS.1993.366872","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272\u2013289 (1996). https:\/\/doi.org\/10.1109\/SFCS.1993.366872","journal-title":"SIAM J. Comput."},{"key":"7_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2004.04.010","volume-title":"CPM 2001","author":"A Bergeron","year":"2001","unstructured":"Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. In: Amir, A. (ed.) CPM 2001. LNCS, vol. pp, pp. 106\u2013117. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1016\/j.dam.2004.04.010"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-27801-6_29","volume-title":"Combinatorial Pattern Matching","author":"A Bergeron","year":"2004","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: Reversal distance without hurdles and fortresses. In: Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 388\u2013399. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27801-6_29"},{"key":"7_CR4","volume-title":"Bioinformatics Algorithms: An Active Learning Approach","author":"P Compeau","year":"2015","unstructured":"Compeau, P., Pevzner, P.: Bioinformatics Algorithms: An Active Learning Approach. Active Learning Publishers La Jolla, California (2015)"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-11805-0_7","volume":"15","author":"CA Duncan","year":"2011","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planar drawings of higher-genus graphs. J. Graph Algorithms Appl. 15(1), 7\u201332 (2011). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_7","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of Genome Rearrangements","author":"G Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Vialette, S., Tannier, E.: Combinatorics of Genome Rearrangements. MIT press, Cambridge (2009)"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Fuladi, N., Hubard, A., de Mesmay, A.: Short topological decompositions of non-orientable surfaces. In: 38th International Symposium on Computational Geometry (SoCG 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2022.41","DOI":"10.4230\/LIPIcs.SoCG.2022.41"},{"key":"7_CR8","unstructured":"Fuladi, N., Hubard, A., de Mesmay, A.: Degenerate crossing number and signed reversal distance (2023). https:\/\/arxiv.org\/pdf\/2308.10666v1.pdf"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM (JACM) 46(1), 1\u201327 (1999). https:\/\/doi.org\/10.1145\/300515.300516","journal-title":"J. ACM (JACM)"},{"issue":"9","key":"7_CR10","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1016\/j.disc.2017.03.019","volume":"340","author":"FW Huang","year":"2017","unstructured":"Huang, F.W., Reidys, C.M.: A topological framework for signed permutations. Discret. Math. 340(9), 2161\u20132182 (2017). https:\/\/doi.org\/10.1016\/j.disc.2017.03.019","journal-title":"Discret. Math."},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, pp. 80\u201389 (2001). https:\/\/doi.org\/10.1145\/378583.378630","DOI":"10.1145\/378583.378630"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.26493\/1855-3974.21.157","volume":"2","author":"B Mohar","year":"2009","unstructured":"Mohar, B.: The genus crossing number. ARS Math. Contemporanea 2(2), 157\u2013162 (2009). https:\/\/doi.org\/10.26493\/1855-3974.21.157","journal-title":"ARS Math. Contemporanea"},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces, vol. 10. JHU press, Baltimore (2001)"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/s00454-009-9141-y","volume":"41","author":"J Pach","year":"2009","unstructured":"Pach, J., T\u00f3th, G.: Degenerate crossing numbers. Discrete Comput. Geom. 41(3), 376\u2013384 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9141-y","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.7155\/jgaa.00580","volume":"26","author":"M Schaefer","year":"2022","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: The degenerate crossing number and higher-genus embeddings. J. Graph Algorithms Appl. 26(1), 35\u201358 (2022). https:\/\/doi.org\/10.7155\/jgaa.00580","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49272-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:06:01Z","timestamp":1704963961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49272-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492716","9783031492723"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49272-3_7","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":"1 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"100","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":"31","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":"7","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":"31% - 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":"13","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":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}