{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:26:19Z","timestamp":1737177979032,"version":"3.33.0"},"reference-count":10,"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":[[1992,1]]},"DOI":"10.1080\/00207169208804057","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:17:59Z","timestamp":1182817079000},"page":"137-156","source":"Crossref","is-referenced-by-count":0,"title":["covering grid points in a convex polygon with straight lines<sup>\u2217<\/sup>"],"prefix":"10.1080","volume":"42","author":[{"given":"H.S.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.C.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"volume-title":"A Guide to the Theory of NP- Completeness","year":"1979","author":"Garey M.R.","key":"CIT0001"},{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"Greene, D.H. and Yao, F.F. Finite-resolution computational geometry. Proc. 27th Symposium on Foundations of Computer Science. pp.143\u2013152.","DOI":"10.1109\/SFCS.1986.19"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(91)90011-K"},{"volume-title":"The Art of Computer Programming","year":"1981","author":"Knuth D.E.","key":"CIT0004"},{"volume-title":"Weber problem on a grid","year":"1991","author":"Lee H.S.","key":"CIT0005"},{"volume-title":"Fundamentals of Number Theory","year":"1977","author":"LeVeque W.J.","key":"CIT0006"},{"key":"CIT0007","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Numbers, Graphs and Complexity","author":"Lovasz L.","year":"1986"},{"key":"CIT0008","unstructured":"Mehta, S., Mukherjeel, M. and Nagy, G. Constrained integer approximation to 2-D line intersections. Second Canadian Conf on Computational Geometry. August, pp.302\u2013305. Canada"},{"key":"CIT0009","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-642-83539-1_5","volume-title":"Theoretical Foundations for Computer Graphics and CAD","author":"Overmars M.H.","year":"1988"},{"key":"CIT0010","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry:An Introduction","author":"Preparata F.P.","year":"1985"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169208804057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T21:38:50Z","timestamp":1737149930000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169208804057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":10,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1080\/00207169208804057"],"URL":"https:\/\/doi.org\/10.1080\/00207169208804057","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"type":"print","value":"0020-7160"},{"type":"electronic","value":"1029-0265"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}