{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:43:04Z","timestamp":1648734184739},"reference-count":9,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(01)00202-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:10:32Z","timestamp":1027613432000},"page":"291-298","source":"Crossref","is-referenced-by-count":1,"title":["On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane"],"prefix":"10.1016","volume":"113","author":[{"given":"Kiyoshi","family":"Hosono","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00202-5_BIB1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","article-title":"Approximation algorithms for the geometric covering salesman problem","volume":"55","author":"Arkin","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00202-5_BIB2","series-title":"Computational Geometry Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0166-218X(01)00202-5_BIB3","doi-asserted-by":"crossref","unstructured":"K. Hosono, H. Meijer, D. Rappaport, On the visibility graph of convex translates, Discrete Appl. Math., to appear.","DOI":"10.1016\/S0166-218X(00)00270-5"},{"key":"10.1016\/S0166-218X(01)00202-5_BIB4","doi-asserted-by":"crossref","unstructured":"A. Mirzaian, Hamiltonian triangulations and circumscribing polygons of disjoint line segments, Comput. Geom. 2 (1) (1992) 15\u201330 (for further reading).","DOI":"10.1016\/0925-7721(92)90018-N"},{"key":"10.1016\/S0166-218X(01)00202-5_BIB5","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S0166-218X(01)00202-5_BIB6","series-title":"Handbook of Discrete and Computational Geometry","first-page":"467","article-title":"Visibility","author":"O'Rourke","year":"1997"},{"issue":"6","key":"10.1016\/S0166-218X(01)00202-5_BIB7","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1137\/0218075","article-title":"Computing simple circuits from a set of line segments is NP-complete","volume":"18","author":"Rappaport","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0166-218X(01)00202-5_BIB8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02187791","article-title":"Computing simple circuits from a set of line segments","volume":"5","author":"Rappaport","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0166-218X(01)00202-5_BIB9","unstructured":"D. Rappaport, private communication, 2000."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002025?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002025?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T09:52:55Z","timestamp":1556272375000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":9,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X01002025"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00202-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}