{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:17:03Z","timestamp":1772914623869,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1016\/0020-0190(94)00190-a","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:53:20Z","timestamp":1027612400000},"page":"217-221","source":"Crossref","is-referenced-by-count":39,"title":["On enclosing k points by a circle"],"prefix":"10.1016","volume":"53","author":[{"given":"Ji\u0159\u00ed","family":"Matou\u0161ek","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00190-A_BIB1","series-title":"Proc. 10th Ann. ACM Symp. on Computational Geometry","article-title":"Constructing levels in arrangements and higher order Voronoi diagrams","author":"Agarwal","year":"1994"},{"key":"10.1016\/0020-0190(94)00190-A_BIB2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","article-title":"Finding k points with minimum diameter and related problems","volume":"12","author":"Aggarwal","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)00190-A_BIB3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02573973","article-title":"Diameter, width, closest line pair, and parametric searching","volume":"10","author":"Chazelle","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(94)00190-A_BIB4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(94)00190-A_BIB5","series-title":"Proc. 3rd Workshop on Algorithms and Data Structures","article-title":"Static and dynamic algorithms for k-point clustering problems","author":"Datta","year":"1993"},{"key":"10.1016\/0020-0190(94)00190-A_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195992000020","article-title":"A randomized algorithm for slope selection","volume":"2","author":"Dillencourt","year":"1992","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0020-0190(94)00190-A_BIB7","series-title":"Proc. 4th ACM\u2014SIAM Symp. on Discrete Algorithms","first-page":"64","article-title":"Iterated nearest neighbors and finding minimal polytopes","author":"Eppstein","year":"1993"},{"key":"10.1016\/0020-0190(94)00190-A_BIB8","series-title":"Proc. Workshop on Algorithms and Data Structures","article-title":"Computing the smallest k-enclosing circle and related problems","author":"Efrat","year":"1993"},{"key":"10.1016\/0020-0190(94)00190-A_BIB9","series-title":"Proc. 9th Ann. ACM Symp. on Computational Geometry","first-page":"198","article-title":"An expander-based approach to geometric optimization","author":"Katz","year":"1993"},{"key":"10.1016\/0020-0190(94)00190-A_BIB10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(91)90177-J","article-title":"Randomized optimal algorithm for slope selection","volume":"39","author":"Matou\u0161ek","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00190-A_BIB11","series-title":"Proc. 10th Ann. ACM Symp. on Computational Geometry","article-title":"On geometric optimization with few violated constraints","author":"Matou\u0161ek","year":"1994"},{"key":"10.1016\/0020-0190(94)00190-A_BIB12","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00190-A_BIB13","series-title":"Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"580","article-title":"A fast planar partition algorithm, I","author":"Mulmuley","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400190A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400190A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:51:37Z","timestamp":1556301097000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400190A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["002001909400190A"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00190-a","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}