{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:24:46Z","timestamp":1648513486934},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":[[1994,2]]},"DOI":"10.1016\/0020-0190(94)90087-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"117-121","source":"Crossref","is-referenced-by-count":1,"title":["The range co-minima problem"],"prefix":"10.1016","volume":"49","author":[{"given":"Sung","family":"Kwon Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90087-6_BIB1","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","article-title":"An optimal worst case algorithm for reporting intersections of rectangles","volume":"29","author":"Bentley","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(94)90087-6_BIB2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","article-title":"Fractional cascading I: a data structuring technique","volume":"1","author":"Chazelle","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(94)90087-6_BIB3","first-page":"135","article-title":"Scaling and related techniques for geometry problems","author":"Gabow","year":"1984","journal-title":"Proc. 16th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90087-6_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0020-0190(90)90046-Z","article-title":"Parallel algorithms for the segment dragging problem","volume":"36","author":"Kim","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90087-6_BIB5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0196-6774(82)90016-5","article-title":"Rectilinear line segment intersection, layered segment trees, and dynamization","volume":"3","author":"Vaisnavi","year":"1982","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900876?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900876?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:22:04Z","timestamp":1555132924000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0020019094900876"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90087-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}