{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:45:35Z","timestamp":1648554335592},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2012,1,1]]},"DOI":"10.1093\/comjnl\/bxr076","type":"journal-article","created":{"date-parts":[[2011,8,16]],"date-time":"2011-08-16T20:57:34Z","timestamp":1313528254000},"page":"69-81","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the Range for k-Covered Paths on Sensor Networks"],"prefix":"10.1093","volume":"55","author":[{"given":"M.","family":"Abellanas","sequence":"first","affiliation":[]},{"given":"A. L.","family":"Bajuelos","sequence":"additional","affiliation":[]},{"given":"I.","family":"Matos","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2011,8,16]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/55\/1\/69\/1374189\/bxr076.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T23:56:42Z","timestamp":1503446202000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxr076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,16]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,12,22]]},"published-print":{"date-parts":[[2012,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxr076","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,16]]}}}