{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:34Z","timestamp":1750307374047,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"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.1810987","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"147-155","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Output-sensitive algorithm for the edge-width of an embedded graph"],"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","volume-title":"The design and analysis of computer programs","author":"Aho A. V.","year":"1974","unstructured":"A. V. Aho , J. E. Hopcroft , and J. D. Ullman . The design and analysis of computer programs . Addison-Wesley , 1974 . A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer programs. Addison-Wesley, 1974."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1977-0437372-X"},{"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 , E. Colin de Verdiere, and F. Lazarus. Finding shortest non-trivial cycles in directed graphs on surfaces . In These Proceedings , 2010 . S. Cabello, E. Colin de Verdiere, and F. Lazarus. Finding shortest non-trivial cycles in directed graphs on surfaces. In These Proceedings, 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824781"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1292-5"},{"key":"e_1_3_2_1_7_1","unstructured":"E. Colin de Verdi`ere. Algorithms for graphs on surfaces. Course notes available at http:\/\/www.di.ens.fr\/~colin\/cours\/algo-graphs-surfaces.pdf 2008.  E. Colin de Verdi`ere. Algorithms for graphs on surfaces. Course notes available at http:\/\/www.di.ens.fr\/~colin\/cours\/algo-graphs-surfaces.pdf 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/261226"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.01.003"},{"key":"e_1_3_2_1_10_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_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2948-z"},{"key":"e_1_3_2_1_12_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_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190200305"},{"key":"e_1_3_2_1_14_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_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401020"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374443"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250848"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496894"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137919"},{"key":"e_1_3_2_1_20_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_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2001.2036"},{"key":"e_1_3_2_1_22_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 . Johns Hopkins University Press , 2001 . B. Mohar and C. Thomassen. Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, 2001."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(88)90070-6"},{"key":"e_1_3_2_1_24_1","first-page":"293","volume-title":"Representativity of surface embeddings","author":"Robertson N.","year":"1990","unstructured":"N. Robertson and R. P. Vitray . Representativity of surface embeddings . In B. Korte, L. Lovasz, and Promel, editors, Paths, flows, and VLSI-layout, pages 293 -- 328 . Springer-Verlag , Berlin, 1990 . N. Robertson and R. P. Vitray. Representativity of surface embeddings. In B. Korte, L. Lovasz, and Promel, editors, Paths, flows, and VLSI-layout, pages 293--328. Springer-Verlag, Berlin, 1990."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-0110-3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90115-G"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1993.1057"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-97-01830-8"}],"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.1810987","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810959.1810987","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.1810987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":28,"alternative-id":["10.1145\/1810959.1810987","10.1145\/1810959"],"URL":"https:\/\/doi.org\/10.1145\/1810959.1810987","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"}}]}}