{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T20:10:21Z","timestamp":1667419821119},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0167-6377(97)00051-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:07:44Z","timestamp":1027588064000},"page":"229-233","source":"Crossref","is-referenced-by-count":2,"title":["Finding minimum area simple pentagons"],"prefix":"10.1016","volume":"21","author":[{"given":"Jean-Fran\u00e7ois","family":"H\u00eache","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas M.","family":"Liebling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(97)00051-5_BIB1","doi-asserted-by":"crossref","unstructured":"D.P. Dobkin, H. Edelsbrunner, M.H. Overmars, Searching for empty convex polygons, in Proc. 4th ACM Symp. on Computational Geometry, 1988, pp. 224\u2013228.","DOI":"10.1145\/73393.73416"},{"key":"10.1016\/S0167-6377(97)00051-5_BIB2","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"10.1016\/S0167-6377(97)00051-5_BIB3","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, L.J. Guibas, Topologically sweeping in an arrangement, in Proc. 18th ACM Symp. on Theory of Computing, 1986, pp. 389\u2013403.","DOI":"10.1145\/12130.12171"},{"key":"10.1016\/S0167-6377(97)00051-5_BIB4","unstructured":"D. Eppstein, New algorithms for minimum areak-gons, in Proc. 3rd ACM\/SIAM Symp. on Discrete Algorithms, 1992, pp. 83\u201388."},{"key":"10.1016\/S0167-6377(97)00051-5_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02187823","article-title":"Finding minimum areak-gons","volume":"7","author":"Eppstein","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0167-6377(97)00051-5_BIB6","unstructured":"S.P. Fekete, Geometry and the Travelling Salesman Problem, Ph.D. Thesis, University of Waterloo, 1992."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000515?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000515?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T17:28:17Z","timestamp":1556558897000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637797000515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0167637797000515"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00051-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}