{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:07:54Z","timestamp":1709831274313},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1016\/j.jalgor.2009.01.001","type":"journal-article","created":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T13:18:15Z","timestamp":1234531095000},"page":"79-88","source":"Crossref","is-referenced-by-count":14,"title":["Bichromatic separability with two boxes: A general approach"],"prefix":"10.1016","volume":"64","author":[{"given":"C.","family":"Cort\u00e9s","sequence":"first","affiliation":[]},{"given":"J.M.","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"additional","affiliation":[]},{"given":"P.","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[]},{"given":"C.","family":"Seara","sequence":"additional","affiliation":[]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[]},{"given":"I.","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.jalgor.2009.01.001_bib001","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1137\/060669474","article-title":"On approximating the depth and related problems","volume":"38","author":"Aronov","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jalgor.2009.01.001_bib002","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1145\/358234.381162","article-title":"Programming pearls: Algorithm design techniques","volume":"27","author":"Bentley","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/j.jalgor.2009.01.001_bib003","unstructured":"J.L. Bentley, M.I. Shamos, A problem in multivariate statistics: Algorithms, data structure and applications, in: Proceedings of the 15th Annual Allerton Conference on Communications, Control, and Computing, 1977, pp. 193\u2013201"},{"key":"10.1016\/j.jalgor.2009.01.001_bib004","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0020-0190(00)00093-4","article-title":"Covering a set of points by two axis-parallel boxes","volume":"75","author":"Bespamyatnikh","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.jalgor.2009.01.001_bib005","unstructured":"C. Cort\u00e9s, J.M. D\u00edaz-B\u00e1\u00f1ez, J. Urrutia, Finding enclosing boxes with empty intersection, in: 23rd European Workshop on Computational Geometry, 2006, pp. 185\u2013188"},{"key":"10.1016\/j.jalgor.2009.01.001_bib006","series-title":"ISAAC 2004","first-page":"294","article-title":"On the range maximum-sum segment query problem","volume":"vol. 3341","author":"Chen","year":"2004"},{"issue":"3","key":"10.1016\/j.jalgor.2009.01.001_bib007","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1006\/jcss.1996.0034","article-title":"Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning","volume":"52","author":"Dobkin","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jalgor.2009.01.001_bib008","series-title":"Pattern Classification","author":"Duda","year":"2001"},{"key":"10.1016\/j.jalgor.2009.01.001_bib009","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1020546910706","article-title":"The maximum box problem and its applications to data analysis","volume":"23","author":"Eckstein","year":"2002","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.jalgor.2009.01.001_bib010","unstructured":"P.L. Hammer, T. Bonates, Logical analysis of data: From combinatorial optimization to medical applications, Rutcor Research Report, RRR 10-2005, Rutger University, NJ, USA, 2005"},{"key":"10.1016\/j.jalgor.2009.01.001_bib011","series-title":"Principles of Data Mining","author":"Hand","year":"2001"},{"key":"10.1016\/j.jalgor.2009.01.001_bib012","series-title":"Sorting and Searching. The Art of Computer Programming","author":"Knuth","year":"2000"},{"key":"10.1016\/j.jalgor.2009.01.001_bib013","unstructured":"Y. Liu, M. Nediak, Planar case of the maximum box and related problems, in: Proc. 15th Canad. Conf. Comp. Geom., Halifax, Nova Scotia, 2003"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677409000029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677409000029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T21:51:50Z","timestamp":1545429110000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677409000029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["S0196677409000029"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.jalgor.2009.01.001","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2009,4]]}}}
