{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:23:37Z","timestamp":1760441017839,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,13]],"date-time":"2011-06-13T00:00:00Z","timestamp":1307923200000},"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":[[2011,6,13]]},"DOI":"10.1145\/1998196.1998216","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"125-134","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Disjoint compatible geometric matchings"],"prefix":"10.1145","author":[{"given":"Mashhood","family":"Ishaque","sequence":"first","affiliation":[{"name":"Tufts University, Medford, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diane L.","family":"Souvaine","sequence":"additional","affiliation":[{"name":"Tufts University, Medford, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"Toth","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2008.12.005"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9310-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1974-0370599-7"},{"key":"e_1_3_2_1_4_1","first-page":"223","volume-title":"in Proc. CCCG, 2007, pp. 13--16.Erratum in Proc. CCCG","author":"Benbernou N. M.","year":"2008","unstructured":"N. M. Benbernou , E. D. Demaine , M. L. Demaine , M. Hoffmann , M. Ishaque , D. L. Souvaine , and Cs. D. T\u00f3th ,Disjoint segments have a convex partition with a 2-edge connected dual graph , in Proc. CCCG, 2007, pp. 13--16.Erratum in Proc. CCCG , 2008 , p. 223 . N. M. Benbernou, E. D. Demaine, M. L. Demaine, M. Hoffmann, M. Ishaque, D. L. Souvaine, and Cs. D. T\u00f3th,Disjoint segments have a convex partition with a 2-edge connected dual graph,in Proc. CCCG, 2007, pp. 13--16.Erratum in Proc. CCCG, 2008, p. 223."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0042-y"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"97","volume-title":"Proc. 13th COCOON","author":"Buchin K.","year":"2007","unstructured":"K. Buchin , C. Knauer , K. Kriegel , A. Schulz , and R. Seidel , On the number of cycles in planargraphs , in Proc. 13th COCOON , vol. 4598 of LNCS ,Springer, 2007 , pp. 97 -- 107 . K. Buchin, C. Knauer, K. Kriegel, A. Schulz, and R. Seidel, On the number of cycles in planargraphs, in Proc. 13th COCOON, vol. 4598 of LNCS,Springer, 2007, pp. 97--107."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-87806-9.50009-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01303201"},{"key":"e_1_3_2_1_9_1","unstructured":"A.\n      Dumitrescu A.\n      Schulz A.\n      Sheffer and \n      Cs. D.\n      T\u00f3th Bounds\n     on the maximum multiplicity of some common geometric graphs in Proc. 28th Sympos.\n  on Theor. Aspects of Comp. Sci\n  . vol. \n  9\n   of \n  LIPIcs 2011 pp. \n  637\n  --\n  648\n  .  A. Dumitrescu A. Schulz A. Sheffer and Cs. D. T\u00f3th Bounds on the maximum multiplicity of some common geometric graphs in Proc. 28th Sympos. on Theor. Aspects of Comp. Sci. vol. 9 of LIPIcs 2011 pp. 637--648."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090303"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00213-X"},{"key":"e_1_3_2_1_12_1","volume-title":"Graph orientations with edge-connection and parity constraints Combinatorica 22 (1)","author":"Frank A.","year":"2002","unstructured":"A. Frank and Z. Kir\u00e1ly , Graph orientations with edge-connection and parity constraints Combinatorica 22 (1) ( 2002 ), 47--70. A. Frank and Z. Kir\u00e1ly,Graph orientations with edge-connection and parity constraints Combinatorica 22 (1) (2002), 47--70."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"Ghosh S. K.","year":"2007","unstructured":"S. K. Ghosh , Visibility Algorithms in the Plane , Cambridge Univ. Press , 2007 . S. K. Ghosh, Visibility Algorithms in the Plane,Cambridge Univ. Press, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482537-7\/50012-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195902000803"},{"key":"e_1_3_2_1_16_1","volume-title":"AMS Chelsea","author":"Plummer Lov\u00e1sz","year":"2009","unstructured":". Lov\u00e1sz and M. D. Plummer , Matching Theory , AMS Chelsea , 2009 . . Lov\u00e1sz and M. D. Plummer, Matching Theory, AMS Chelsea, 2009."},{"key":"e_1_3_2_1_17_1","first-page":"445","article-title":"Nash-Williams, Edge-disjoint spanning trees in finite graphs","volume":"36","author":"C. St.-J.","year":"1961","unstructured":"C. St.-J. A . Nash-Williams, Edge-disjoint spanning trees in finite graphs , J. London Math. Soc. 36 ( 1961 ), 445 -- 450 . C. St.-J. A. Nash-Williams, Edge-disjoint spanning trees in finite graphs, J. London Math. Soc. 36 (1961), 445--450.","journal-title":"J. London Math. Soc."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.221"}],"event":{"name":"SoCG '11: 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":"Paris France","acronym":"SoCG '11"},"container-title":["Proceedings of the twenty-seventh annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998196.1998216","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1998196.1998216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:27Z","timestamp":1750244787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998196.1998216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,13]]},"references-count":18,"alternative-id":["10.1145\/1998196.1998216","10.1145\/1998196"],"URL":"https:\/\/doi.org\/10.1145\/1998196.1998216","relation":{},"subject":[],"published":{"date-parts":[[2011,6,13]]},"assertion":[{"value":"2011-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}