{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:26Z","timestamp":1740109586268,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"ANR","award":["ANR-17-CE40-0033"],"award-info":[{"award-number":["ANR-17-CE40-0033"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00454-023-00580-3","type":"journal-article","created":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T18:01:25Z","timestamp":1698861685000},"page":"783-830","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Short Topological Decompositions of Non-orientable Surfaces"],"prefix":"10.1007","volume":"72","author":[{"given":"Niloufar","family":"Fuladi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3178-6144","authenticated-orcid":false,"given":"Alfredo","family":"Hubard","sequence":"additional","affiliation":[]},{"given":"Arnaud","family":"de Mesmay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,1]]},"reference":[{"issue":"4","key":"580_CR1","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1002\/1097-0118(200104)36:4<198::AID-JGT1006>3.0.CO;2-H","volume":"36","author":"D Archdeacon","year":"2001","unstructured":"Archdeacon, D., Bonnington, C.P.: Two maps on one surface. J. Graph Theory 36(4), 198\u2013216 (2001)","journal-title":"J. Graph Theory"},{"key":"580_CR2","doi-asserted-by":"crossref","unstructured":"Bergeron, A.: A very elementary presentation of the Hannenhalli\u2013Pevzner theory. In Annual Symposium on Combinatorial Pattern Matching, pp. 106\u2013117. Springer, Berlin (2001)","DOI":"10.1007\/3-540-48194-X_9"},{"key":"580_CR3","unstructured":"Bura, A.C., Chen, R.X.F., Reidys, C.M.: On a lower bound for sorting signed permutations by reversals. arXiv Preprint (2016). arXiv:1602.00778"},{"key":"580_CR4","unstructured":"Colin de Verdi\u00e8re, \u00c9.: Topological algorithms for graphs on surfaces. Habilitation thesis (2012). http:\/\/www.di.ens.fr\/~colin\/"},{"key":"580_CR5","unstructured":"Colin de Verdi\u00e8re, \u00c9.: Computational topology of graphs on surfaces. In: Goodman, J.E., O\u2019Rourke, J., Toth, C. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn., pp. 605\u2013636. CRC Press, Boca Raton (2018)"},{"key":"580_CR6","doi-asserted-by":"crossref","unstructured":"Colin de Verdi\u00e8re, \u00c9., Erickson, J.: Tightening nonsimple paths and cycles on surfaces. SIAM J. Comput. 39(8), 3784\u20133813 (2010)","DOI":"10.1137\/090761653"},{"key":"580_CR7","unstructured":"Comment rendre g\u00e9od\u00e9sique une triangulation d\u2019une surface: Colin de Verdi\u00e8re, Y.: L\u2019Enseignement Math\u00e9matique 37, 201\u2013212 (1991)"},{"key":"580_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2201-7","volume-title":"Riemannian Geometry","author":"MP Do Carmo","year":"1992","unstructured":"Do Carmo, M.P., Francis, J.F.: Riemannian Geometry, vol. 6. Springer, Berlin (1992)"},{"issue":"1","key":"580_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00454-003-2948-z","volume":"31","author":"J Erickson","year":"2004","unstructured":"Erickson, J., Har-Peled, S.: Optimally cutting a surface into a disk. Discrete Comput. Geom. 31(1), 37\u201359 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"580_CR10","unstructured":"Erickson, J., Whittlesey, K.: Greedy optimal homotopy and homology generators. In: SODA, vol. 5, pp. 1038\u20131046 (2005)"},{"key":"580_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.jctb.2018.03.004","volume":"132","author":"J Geelen","year":"2018","unstructured":"Geelen, J., Huynh, T., Richter, R.B.: Explicit bounds for graph minors. J. Combin. Theory Ser. B 132, 80\u2013106 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"580_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1090\/S0273-0979-07-01191-3","volume":"45","author":"R Ghrist","year":"2008","unstructured":"Ghrist, R.: Barcodes: the persistent topology of data. Bull. Am. Math. Soc. 45(1), 61\u201375 (2008)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"580_CR13","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)","journal-title":"J. ACM (JACM)"},{"key":"580_CR14","volume-title":"Algebraic Topology","author":"A Hatcher","year":"2002","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)"},{"issue":"5","key":"580_CR15","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1511\/2007.67.386","volume":"95","author":"B Hayes","year":"2007","unstructured":"Hayes, B.: Computing science: Sorting Out The Genome. Am. Sci. 95(5), 386\u2013391 (2007)","journal-title":"Am. Sci."},{"key":"580_CR16","doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u1ef3, P., Salazar, G.: On hardness of the joint crossing number. In: International Symposium on Algorithms and Computation, pp. 603\u2013613. Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-48971-0_51"},{"issue":"9","key":"580_CR17","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1016\/j.disc.2017.03.019","volume":"340","author":"FWD Huang","year":"2017","unstructured":"Huang, F.W.D., Reidys, C.M.: A topological framework for signed permutations. Discret. Math. 340(9), 2161\u20132182 (2017)","journal-title":"Discret. Math."},{"issue":"4","key":"580_CR18","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s00454-017-9898-3","volume":"58","author":"A Hubard","year":"2017","unstructured":"Hubard, A., Kalu\u017ea, V., De Mesmay, A., Tancer, M.: Shortest path embeddings of graphs on surfaces. Discrete Comput. Geom. 58(4), 921\u2013945 (2017)","journal-title":"Discrete Comput. Geom."},{"key":"580_CR19","unstructured":"Lazarus, F.: Combinatorial graphs and surfaces from the computational and topological viewpoint followed by some notes on the isometric embedding of the square flat torus. M\u00e9moire d\u2019HDR (2014). http:\/\/www.gipsa-lab.grenoble-inp.fr\/~francis.lazarus\/Documents\/hdr-Lazarus.pdf"},{"key":"580_CR20","doi-asserted-by":"crossref","unstructured":"Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In Proceedings of the 17th Annual Symposium on Computational Geometry, pp. 80\u201389 (2001)","DOI":"10.1145\/378583.378630"},{"key":"580_CR21","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J., Sedgwick, E., Tancer, M., Wagner, U.: Untangling two systems of noncrossing curves. In: International Symposium on Graph Drawing, pp. 472\u2013483. Springer, Berlin (2013)","DOI":"10.1007\/978-3-319-03841-4_41"},{"issue":"2","key":"580_CR22","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. Contemp. 2(2), 157\u2013162 (2009)","journal-title":"ARS Math. Contemp."},{"key":"580_CR23","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":"1","key":"580_CR24","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1002\/1097-0118(200101)36:1<8::AID-JGT2>3.0.CO;2-O","volume":"36","author":"S Negami","year":"2001","unstructured":"Negami, S.: Crossing numbers of graph embedding pairs on closed surfaces. J. Graph Theory 36(1), 8\u201323 (2001)","journal-title":"J. Graph Theory"},{"issue":"3","key":"580_CR25","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1002\/jgt.20109","volume":"50","author":"RB Richter","year":"2005","unstructured":"Richter, R.B., Salazar, G.: Two maps with large representativity on one surface. J. Graph Theory 50(3), 234\u2013245 (2005)","journal-title":"J. Graph Theory"},{"key":"580_CR26","doi-asserted-by":"crossref","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Block additivity of $${\\mathbb{Z}}_2$$-embeddings. In: International Symposium on Graph Drawing, pp. 185\u2013195. Springer, Berlin (2013)","DOI":"10.1007\/978-3-319-03841-4_17"},{"issue":"1","key":"580_CR27","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."},{"key":"580_CR28","unstructured":"Sethna, J.P.: Order parameters, broken symmetry, and topology. In: 1991 Lectures in Complex Systems. Addison-Wesley, Reading (1992)"},{"key":"580_CR29","doi-asserted-by":"crossref","unstructured":"Sheffer, A., Hormann, K., Levy, B., Desbrun, M., Zhou, K., Praun, E., Hoppe, H.: Mesh parameterization: theory and practice. In: ACM SIGGRAPPH, Course Notes, 10, 1281500.1281510 (2007)","DOI":"10.1145\/1281500.1281510"},{"key":"580_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4372-4","volume-title":"Classical Topology and Combinatorial Group Theory","author":"J Stillwell","year":"1993","unstructured":"Stillwell, J.: Classical Topology and Combinatorial Group Theory, vol. 72. Springer, New York (1993)"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00580-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00580-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00580-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T23:05:35Z","timestamp":1727391935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00580-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["580"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00580-3","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2023,11,1]]},"assertion":[{"value":"31 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}