{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:56Z","timestamp":1760441096194},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T00:00:00Z","timestamp":1349222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00454-012-9466-9","type":"journal-article","created":{"date-parts":[[2012,10,2]],"date-time":"2012-10-02T09:51:18Z","timestamp":1349171478000},"page":"89-131","source":"Crossref","is-referenced-by-count":12,"title":["Disjoint Compatible Geometric Matchings"],"prefix":"10.1007","volume":"49","author":[{"given":"Mashhood","family":"Ishaque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diane L.","family":"Souvaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,3]]},"reference":[{"key":"9466_CR1","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.comgeo.2008.12.005","volume":"42","author":"O. Aichholzer","year":"2009","unstructured":"Aichholzer, O., Bereg, S., Dumitrescu, A., Garc\u00eda, A., Huemer, C., Hurtado, F., Kano, M., M\u00e1rquez, A., Rappaport, D., Smorodinsky, S., Souvaine, D., Urrutia, J., Wood, D.: Compatible geometric matchings. Comput. Geom. 42, 617\u2013626 (2009)","journal-title":"Comput. Geom."},{"issue":"3","key":"9466_CR2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10878-010-9310-1","volume":"22","author":"M. Al-Jubeh","year":"2010","unstructured":"Al-Jubeh, M., Ishaque, M., Hoffmann, M., Souvaine, D.L., T\u00f3th, C.D.: Convex partitions with 2-edge connected dual graphs. J. Comb. Optim. 22(3), 409\u2013425 (2010)","journal-title":"J. Comb. Optim."},{"key":"9466_CR3","doi-asserted-by":"crossref","unstructured":"Al-Jubeh, M., Barequet, G., Ishaque, M., Souvaine, D.L., T\u00f3th, C.D., Winslow, A.: Constrained tri-connected planar straight line graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Algorithms and Combinatorics, vol. 29. Springer, Berlin (2013, to appear)","DOI":"10.1007\/978-1-4614-0110-0_5"},{"key":"9466_CR4","first-page":"13","volume-title":"Proc. 19th Canadian Conf. Comp. Geom","author":"N.M. Benbernou","year":"2007","unstructured":"Benbernou, N.M., Demaine, E.D., Demaine, M.L., Hoffmann, M., Ishaque, M., Souvaine, D.L., T\u00f3th, C.D.: Disjoint segments have a convex partition with a 2-edge connected dual graph. In: Proc. 19th Canadian Conf. Comp. Geom, Ottawa, ON, pp. 13\u201316 (2007). Erratum in Proc. 20th Canadian Conf. Comp. Geom., Montreal, QC, 2008, p.\u00a0223"},{"issue":"3","key":"9466_CR5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s00454-001-0042-y","volume":"26","author":"P. Bose","year":"2001","unstructured":"Bose, P., Houle, M.E., Toussaint, G.T.: Every set of disjoint line segments admits a binary tree. Discrete Comput. Geom. 26(3), 387\u2013410 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"9466_CR6","series-title":"LNCS","first-page":"97","volume-title":"Proc. 13th COCOON","author":"K. Buchin","year":"2007","unstructured":"Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. In: Proc. 13th COCOON. LNCS, vol. 4598, pp. 97\u2013107. Springer, Berlin (2007)"},{"key":"9466_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-642-30347-0_9","volume-title":"Proc. 6th Conf. on Fun with Algorithms","author":"S. Cannon","year":"2012","unstructured":"Cannon, S., Ishaque, M., T\u00f3th, C.D.: Even orientations with forbidden pairs and demands. In: Proc. 6th Conf. on Fun with Algorithms. LNCS, vol.\u00a07288, pp.\u00a057\u201368. Springer, Berlin (2012)"},{"issue":"2","key":"9466_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01303201","volume":"13","author":"R. Cordovil","year":"1993","unstructured":"Cordovil, R., Moreira, M.L.: Bases\u2013cobases graphs and polytopes of matroids. Combinatorica 13(2), 157\u2013165 (1993)","journal-title":"Combinatorica"},{"key":"9466_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/jgt.3190090303","volume":"8","author":"M. Farber","year":"1985","unstructured":"Farber, M., Richter, B., Shank, H.: Edge-disjoint spanning trees: a connectedness theorem. J. Graph Theory 8, 319\u2013324 (1985)","journal-title":"J. Graph Theory"},{"key":"9466_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","volume":"16","author":"A. Garc\u00eda","year":"2000","unstructured":"Garc\u00eda, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of K N . Comput. Geom. Theory Appl. 16, 211\u2013221 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"9466_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.comgeo.2006.12.005","volume":"43","author":"M. Hoffmann","year":"2010","unstructured":"Hoffmann, M., Speckmann, B., T\u00f3th, C.D.: Pointed binary encompassing trees: simple and optimal. Comput. Geom. Theory Appl. 43(1), 35\u201341 (2010)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9466_CR12","series-title":"LNCS","first-page":"524","volume-title":"Proc. WADS","author":"M. Hoffmann","year":"2011","unstructured":"Hoffmann, M., Sharir, M., Sheffer, A., T\u00f3th, Cs.D., Welzl, E.: Counting plane graphs: flippability and its applications. In: Proc. WADS. LNCS, vol. 6844, pp. 524\u2013535. Springer, Berlin (2011)"},{"key":"9466_CR13","doi-asserted-by":"crossref","unstructured":"Hurtado, F., T\u00f3th, C.D.: Plane geometric graph augmentation: a generic perspective. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Algorithms and Combinatorics, vol. 29. Springer, Berlin (2013, to appear)","DOI":"10.1007\/978-1-4614-0110-0_17"},{"key":"9466_CR14","doi-asserted-by":"crossref","DOI":"10.1090\/chel\/367","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. AMS Chelsea, New York (2009)"},{"key":"9466_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.St.-J.A. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.St.-J.A.: Edge-disjoint spanning trees in finite graphs. J. Lond. Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."},{"key":"9466_CR16","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, London (1987)"},{"key":"9466_CR17","first-page":"115","volume-title":"Abstracts of the 24th European Workshop on Comput. Geom","author":"A. Razen","year":"2008","unstructured":"Razen, A.: A lower bound for the transformation of compatible perfect matchings. In: Abstracts of the 24th European Workshop on Comput. Geom, pp. 115\u2013118 (2008)"},{"key":"9466_CR18","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/050636036","volume":"36","author":"M. Sharir","year":"2006","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings, cycles, and partitions. SIAM J. Comput. 36, 695\u2013720 (2006)","journal-title":"SIAM J. Comput."},{"key":"9466_CR19","first-page":"189","volume-title":"Proc. 28th Sympos. Comput. Geom.","author":"M. Sharir","year":"2012","unstructured":"Sharir, M., Sheffer, A., Welzl, E.: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn\u2019s technique. In: Proc. 28th Sympos. Comput. Geom., pp.\u00a0189\u2013198. ACM, New York (2012)"},{"key":"9466_CR20","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/3-540-47738-1_35","volume-title":"Discrete and Computational Geometry","author":"C.D. T\u00f3th","year":"2001","unstructured":"T\u00f3th, C.D.: Illuminating both sides of line segments. In: Akiyama, J., Kano, M., Urabe, M. (eds.) Discrete and Computational Geometry. LNCS, vol. 2098, pp. 370\u2013380. Springer, Berlin (2001)"},{"issue":"3","key":"9466_CR21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0925-7721(01)00057-8","volume":"21","author":"C.D. T\u00f3th","year":"2002","unstructured":"T\u00f3th, C.D.: Illumination in the presence of opaque line segments in the plane. Comput. Geom. Theory Appl. 21(3), 193\u2013204 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9466_CR22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. 36, 221\u2013230 (1961)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9466-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9466-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9466-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:50:36Z","timestamp":1559073036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9466-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9466"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9466-9","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,3]]}}}