{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:54:27Z","timestamp":1648893267850},"reference-count":14,"publisher":"Informa UK Limited","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1080\/00207169008803871","type":"journal-article","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T20:16:37Z","timestamp":1182802597000},"page":"129-144","source":"Crossref","is-referenced-by-count":1,"title":["Ranking intervals under visibility constraints<sup>\u2217<\/sup>"],"prefix":"10.1080","volume":"34","author":[{"given":"Herbert","family":"Edelsbrunner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irith Ben-Arroyo","family":"Hartman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack A.","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","volume-title":"Optimal interval visibility","author":"Ben-Arroyo Hartman I.","year":"1989"},{"key":"CIT0002","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"Bondy J. A.","year":"1976"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1080\/00207168308803364"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1137\/0204043"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934088"},{"key":"CIT0007","first-page":"116","volume":"38","author":"K\u00f6nig D.","year":"1931","journal-title":"Mat. Fiz. Lapok"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1979.1084650"},{"key":"CIT0010","volume-title":"Efficient algorithms for enumerating intersecting intervals and rectangles","author":"McCreight E. M.","year":"1980"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/0214021"},{"key":"CIT0012","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry\u2014An Introduction","author":"Preparata F. P.","year":"1985"},{"key":"CIT0013","volume-title":"Techn. Rept.","author":"Raghavan R.","year":"1981"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90075-3"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90020-5"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169008803871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T15:20:07Z","timestamp":1497712807000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169008803871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":14,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["10.1080\/00207169008803871"],"URL":"https:\/\/doi.org\/10.1080\/00207169008803871","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}