{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:04:00Z","timestamp":1648782240523},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(00)00370-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:54Z","timestamp":1027633914000},"page":"627-639","source":"Crossref","is-referenced-by-count":3,"title":["Dynamically maintaining the widest k-dense corridor"],"prefix":"10.1016","volume":"255","author":[{"given":"Subhas","family":"C. Nandy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomohiro","family":"Harayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuo","family":"Asano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00370-4_BIB1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/0167-8655(90)90080-L","article-title":"The k-dense corridor problems","volume":"11","author":"Chattopadhyay","year":"1990","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0304-3975(00)00370-4_BIB2","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0304-3975(00)00370-4_BIB3","first-page":"119","article-title":"Overlaying simply connected planar subdivisions in linear time","author":"Finke","year":"1995","journal-title":"Proc. 11th. ACM Symp. on Computational Geometry"},{"key":"10.1016\/S0304-3975(00)00370-4_BIB4","series-title":"Finding the widest empty corridor through a set of points, Report SOCS-88.11","author":"Houle","year":"1988"},{"key":"10.1016\/S0304-3975(00)00370-4_BIB5","first-page":"231","article-title":"Widest-corridor problems","volume":"1","author":"Janardan","year":"1994","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0304-3975(00)00370-4_BIB6","series-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/S0304-3975(00)00370-4_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0020-0190(98)00130-6","article-title":"The widest k-dense corridor problems","volume":"68","author":"Shin","year":"1998","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003704?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003704?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T20:59:43Z","timestamp":1555707583000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397500003704"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00370-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}