{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:53:00Z","timestamp":1656373980282},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T00:00:00Z","timestamp":1266883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9301-2","type":"journal-article","created":{"date-parts":[[2010,2,22]],"date-time":"2010-02-22T19:11:05Z","timestamp":1266865865000},"page":"517-530","source":"Crossref","is-referenced-by-count":3,"title":["The Maximum Box Problem for moving points in\u00a0the\u00a0plane"],"prefix":"10.1007","volume":"22","author":[{"given":"S.","family":"Bereg","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":"I.","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,23]]},"reference":[{"key":"9301_CR1","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B Aronov","year":"2008","unstructured":"Aronov B, Har-Peled S (2008) On approximating the depth and related problems. SIAM J Comput 38:899\u2013921","journal-title":"SIAM J Comput"},{"key":"9301_CR2","doi-asserted-by":"crossref","unstructured":"Bonnet P, Gehrke J, Seshadri P (2001) Towards sensor database systems. In: Proc of the second international conf on mobile data management, Hong Kong. Lecture notes comp sci, vol 1987, pp 3\u201314","DOI":"10.1007\/3-540-44498-X_1"},{"key":"9301_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B Chazelle","year":"1986","unstructured":"Chazelle B, Guibas LJ (1986) Fractional cascading: a data structuring technique. Algorithmica 1:133\u2013162","journal-title":"Algorithmica"},{"issue":"5","key":"9301_CR4","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/TKDE.2005.80","volume":"17","author":"A Civilis","year":"2005","unstructured":"Civilis A, Jensen CS, Pakalnis S (2005) Techniques for efficient road-network-based tracking of moving objects. IEEE Trans Knowl Data Eng 17(5):698\u2013712","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9301_CR5","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge","edition":"2"},{"issue":"2\u20133","key":"9301_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jalgor.2009.01.001","volume":"64","author":"C Cort\u00e9s","year":"2009","unstructured":"Cort\u00e9s C, D\u00edaz-B\u00e1\u00f1ez JM, P\u00e9rez-Lantero P, Seara C, Urrutia J, Ventura I (2009) Bichromatic separability with two boxes: a general approach. J Algorithms, Cogn, Inf Log 64(2\u20133):79\u201388","journal-title":"J Algorithms, Cogn, Inf Log"},{"key":"9301_CR7","volume-title":"Pattern classification","author":"R Duda","year":"2001","unstructured":"Duda R, Hart P, Stork D (2001) Pattern classification. Wiley, New York"},{"key":"9301_CR8","first-page":"191","volume-title":"Robotics: the algorithmic perspective","author":"LJ Guibas","year":"1998","unstructured":"Guibas LJ (1998) Kinetic data structures: a state of the art report. In: Robotics: the algorithmic perspective. AK Peters, Wellesley, pp 191\u2013209"},{"key":"9301_CR9","unstructured":"Liu Y, Nediak M (2003) Planar case of the Maximum Box and related problems. In: Proc Canad conf comp geom, Halifax, Nova Scotia, August 11\u201313 (2003)"},{"key":"9301_CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/B:JMMA.0000026707.29260.82","volume":"3","author":"M Segal","year":"2004","unstructured":"Segal M (2004) Planar Maximum Box Problem. J Math Modeling Algorithms 3:31\u201338","journal-title":"J Math Modeling Algorithms"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9301-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9301-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9301-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9301-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,23]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9301"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9301-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,23]]}}}