{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:51:48Z","timestamp":1770479508644,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,5]],"date-time":"2006-06-05T00:00:00Z","timestamp":1149465600000},"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":[[2006,6,5]]},"DOI":"10.1145\/1137856.1137918","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"421-429","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Splitting (complicated) surfaces is hard"],"prefix":"10.1145","author":[{"given":"Erin W.","family":"Chambers","sequence":"first","affiliation":[{"name":"University of Illinois"}]},{"given":"\u00c9ric Colin","family":"de Verdi\u00e8re","sequence":"additional","affiliation":[{"name":"CNRS, \u00e8cole normale sup\u00e9rieure, Paris, France"}]},{"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[{"name":"University of Illinois"}]},{"given":"Francis","family":"Lazarus","sequence":"additional","affiliation":[{"name":"CNRS, Laboratoire des Images et des Signaux, Grenoble, France"}]},{"given":"Kim","family":"Whittlesey","sequence":"additional","affiliation":[{"name":"University of Illinois"}]}],"member":"320","published-online":{"date-parts":[[2006,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01769706"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185434"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109691"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_14"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195996000095"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. 17th Annu. ACM-SIAM Sympos. Discrete Algorithms, 192--201","year":"2006","unstructured":"\u00e8. Colin de Verdi\u00e8re and J. Erickson. Tightening non-simple paths and cycles on surfaces . Proc. 17th Annu. ACM-SIAM Sympos. Discrete Algorithms, 192--201 , 2006 .]] \u00e8. Colin de Verdi\u00e8re and J. Erickson. Tightening non-simple paths and cycles on surfaces. Proc. 17th Annu. ACM-SIAM Sympos. Discrete Algorithms, 192--201, 2006.]]"},{"key":"e_1_3_2_1_7_1","volume-title":"Optimal pants decompositions and shortest homotopic cycles on an orientable surface. Proc. 11th Sympos. Graph Drawing, 478--490","author":"de Verdi\u00e8re Colin","year":"2003","unstructured":"\u00e8. Colin de Verdi\u00e8re and F. Lazarus . Optimal pants decompositions and shortest homotopic cycles on an orientable surface. Proc. 11th Sympos. Graph Drawing, 478--490 , 2003 . Lecture Notes Comput. Sci. 2912, Springer-Verlag .]] \u00e8. Colin de Verdi\u00e8re and F. Lazarus. Optimal pants decompositions and shortest homotopic cycles on an orientable surface. Proc. 11th Sympos. Graph Drawing, 478--490, 2003. Lecture Notes Comput. Sci. 2912, Springer-Verlag.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1150-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(93)90140-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392203"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2948-z"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. 16th Annu. ACM-SIAM Sympos. Discrete Algorithms, 1038--1046","author":"Erickson J.","year":"2005","unstructured":"J. Erickson and K. Whittlesey . Greedy optimal homotopy and homology generators . Proc. 16th Annu. ACM-SIAM Sympos. Discrete Algorithms, 1038--1046 , 2005 .]] J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. Proc. 16th Annu. ACM-SIAM Sympos. Discrete Algorithms, 1038--1046, 2005.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772960"},{"key":"e_1_3_2_1_16_1","volume-title":"Cambridge University Press","author":"Hatcher A.","year":"2002","unstructured":"A. Hatcher . Algebraic Topology . Cambridge University Press , 2002 . (http:\/\/www.math.cornell.edu\/~hatcher\/).]] A. Hatcher. Algebraic Topology. Cambridge University Press, 2002. (http:\/\/www.math.cornell.edu\/~hatcher\/).]]"},{"key":"e_1_3_2_1_17_1","volume-title":"Computational complexity and the traveling salesman problem. The Traveling Salesman Problem, 68--74","author":"Johnson D. S.","year":"1985","unstructured":"D. S. Johnson and C. H. Papadimitriou . Computational complexity and the traveling salesman problem. The Traveling Salesman Problem, 68--74 , 1985 . John Wiley & Sons .]] D. S. Johnson and C. H. Papadimitriou. Computational complexity and the traveling salesman problem. The Traveling Salesman Problem, 68--74, 1985. John Wiley & Sons.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137919"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/378583.378630"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216045"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"Mohar B.","year":"2001","unstructured":"B. Mohar and C. Thomassen . Graphs on Surfaces . Johns Hopkins University Press , 2001 .]] B. Mohar and C. Thomassen. Graphs on Surfaces. Johns Hopkins University Press, 2001.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4372-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01955681"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1050943"}],"event":{"name":"SoCG06: 22nd Annual Symposium on Computational Geometry","location":"Sedona Arizona USA","acronym":"SoCG06","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-second annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1137856.1137918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1137856.1137918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:32Z","timestamp":1750259672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1137856.1137918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,5]]},"references-count":24,"alternative-id":["10.1145\/1137856.1137918","10.1145\/1137856"],"URL":"https:\/\/doi.org\/10.1145\/1137856.1137918","relation":{},"subject":[],"published":{"date-parts":[[2006,6,5]]},"assertion":[{"value":"2006-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}