{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:12:41Z","timestamp":1648627961337},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8082,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0012-365x(91)90124-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"313-314","source":"Crossref","is-referenced-by-count":0,"title":["Tight bounds on a problem of lines and intersections"],"prefix":"10.1016","volume":"89","author":[{"given":"Micha","family":"Sharir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven S.","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90124-K_BIB1","first-page":"151","article-title":"A problem of lines and intersections with an application to switching networks","volume":"26","author":"Du","year":"1985"},{"key":"10.1016\/0012-365X(91)90124-K_BIB2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02579194","article-title":"Extremal problems in discrete geometry","volume":"3","author":"Szemer\u00e9di","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(91)90124-K_BIB3","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/SFCS.1988.21973","article-title":"Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces","author":"Clarkson","year":"1988","journal-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190124K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190124K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:17:39Z","timestamp":1580901459000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190124K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["0012365X9190124K"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90124-k","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}