{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T03:34:46Z","timestamp":1772508886816,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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":[[1985,9]]},"DOI":"10.1016\/0196-6774(85)90011-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"430-433","source":"Crossref","is-referenced-by-count":47,"title":["Partitioning with two lines in the plane"],"prefix":"10.1016","volume":"6","author":[{"given":"Nimrod","family":"Megiddo","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90011-2_BIB1","series-title":"Proceedings of the 16th Annual ACM Symposium on Theory of Computing","first-page":"154","article-title":"On k-hulls and related problems","author":"Cole","year":"1984"},{"key":"10.1016\/0196-6774(85)90011-2_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","article-title":"Linear time algorithms for two- and three-variable linear programs","volume":"13","author":"Dyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90011-2_BIB3","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":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(85)90011-2_BIB4","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90011-2_BIB5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(85)90011-2_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0211012","article-title":"Polygon retrieval","volume":"11","author":"Willard","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90011-2_BIB7","series-title":"Proceedings of the 15th Annual ACM Symposium on Theory of Computing","first-page":"258","article-title":"A 3-space partition and its applications","author":"Yao","year":"1983"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:01Z","timestamp":1548743161000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0196677485900112"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90011-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}