{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:33Z","timestamp":1750307373851,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1810959.1810988","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"156-165","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Finding shortest non-trivial cycles in directed graphs on surfaces"],"prefix":"10.1145","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[{"name":"University of Ljubljana, Ljubljana, Slovenia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Colin de Verdi\u00e8re","sequence":"additional","affiliation":[{"name":"CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis","family":"Lazarus","sequence":"additional","affiliation":[{"name":"CNRS, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502798"},{"key":"e_1_3_2_1_3_1","first-page":"89","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Cabello S.","year":"2007","unstructured":"S. Cabello and E. W. Chambers . Multiple source shortest paths in a genus g graph . In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 89 -- 97 , 2007 . S. Cabello and E. W. Chambers. Multiple source shortest paths in a genus g graph. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 89--97, 2007."},{"key":"e_1_3_2_1_4_1","volume-title":"These Proceedings","author":"Cabello S.","year":"2010","unstructured":"S. Cabello , \u00c9. Colin de Verdi\u00e8re, and F. Lazarus. Output-sensitive algorithm for the edge-width of an embedded graph . In These Proceedings , 2010 . S. Cabello, \u00c9. Colin de Verdi\u00e8re, and F. Lazarus. Output-sensitive algorithm for the edge-width of an embedded graph. In These Proceedings, 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1292-5"},{"key":"e_1_3_2_1_6_1","first-page":"828","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Chalermsook P.","year":"2004","unstructured":"P. Chalermsook , J. Fakcharoenphol , and D. Nanongkai . A deterministic near-linear time algorithm for finding minimum cuts in planar graphs . In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 828 -- 829 , 2004 . P. Chalermsook, J. Fakcharoenphol, and D. Nanongkai. A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 828--829, 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542362.1542426"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.10.010"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536453"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109580"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921665"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/261226"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_14_1","first-page":"599","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Eppstein D.","year":"2003","unstructured":"D. Eppstein . Dynamic generators of topologically embedded graphs . In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 599 -- 608 , 2003 . D. Eppstein. Dynamic generators of topologically embedded graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 599--608, 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873666"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2948-z"},{"key":"e_1_3_2_1_17_1","first-page":"1038","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Erickson J.","year":"2005","unstructured":"J. Erickson and K. Whittlesey . Greedy optimal homotopy and homology generators . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1038 -- 1046 , 2005 . J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1038--1046, 2005."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115964.3116089"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.007"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_21_1","volume-title":"Algebraic topology","author":"Hatcher A.","year":"2002","unstructured":"A. Hatcher . Algebraic topology . Cambridge University Press , 2002 . Available at http:\/\/www.math.cornell.edu\/~hatcher\/. A. Hatcher. Algebraic topology. Cambridge University Press, 2002. Available at http:\/\/www.math.cornell.edu\/~hatcher\/."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"issue":"1","key":"e_1_3_2_1_23_1","first-page":"37","article-title":"Minimum cut in directed planar networks","volume":"28","author":"Janiga L.","year":"1992","unstructured":"L. Janiga and V. Koubek . Minimum cut in directed planar networks . Kybernetica , 28 ( 1 ): 37 -- 49 , 1992 . L. Janiga and V. Koubek. Minimum cut in directed planar networks. Kybernetica, 28(1):37--49, 1992.","journal-title":"Kybernetica"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721846"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137919"},{"key":"e_1_3_2_1_26_1","series-title":"Graduate Texts in Mathematics","volume-title":"Algebraic Topology: An Introduction","author":"Massey W. S.","year":"1977","unstructured":"W. S. Massey . Algebraic Topology: An Introduction , volume 56 of Graduate Texts in Mathematics . Springer-Verlag , 1977 . W. S. Massey. Algebraic Topology: An Introduction, volume 56 of Graduate Texts in Mathematics. Springer-Verlag, 1977."},{"key":"e_1_3_2_1_27_1","volume-title":"Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences","author":"Mohar B.","year":"2001","unstructured":"B. Mohar and C. Thomassen . Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences . John Hopkins University Press , 2001 . B. Mohar and C. Thomassen. Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. John Hopkins University Press, 2001."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212005"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-0110-3"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90115-G"}],"event":{"name":"SoCG '10: Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Snowbird Utah USA","acronym":"SoCG '10"},"container-title":["Proceedings of the twenty-sixth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1810988","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810959.1810988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:01Z","timestamp":1750245781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1810988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":31,"alternative-id":["10.1145\/1810959.1810988","10.1145\/1810959"],"URL":"https:\/\/doi.org\/10.1145\/1810959.1810988","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}