{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:52:48Z","timestamp":1725493968572},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_16","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"187-198","source":"Crossref","is-referenced-by-count":0,"title":["Dynamically Maintaining the Widest k-Dense Corridor"],"prefix":"10.1007","author":[{"given":"Subhas C.","family":"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":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0167-8655(90)90080-L","volume":"11","author":"S. Chattopadhyay","year":"1990","unstructured":"S. Chattopadhyay and P. P. Das, The k-dense corridor problems, Pattern Recog-nition Letters, vol. 11, pp. 463\u2013469, 1990.","journal-title":"Pattern Recog-nition Letters"},{"key":"16_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987."},{"key":"16_CR3","volume-title":"Report SOCS-88.11","author":"M. Houle","year":"1988","unstructured":"M. Houle and A. Maciel, Finding the widest empty corridor through a set of points, Report SOCS-88.11, McGill University, Montreal, Quebec, 1988."},{"key":"16_CR4","first-page":"231","volume":"1","author":"R. Janardan","year":"1994","unstructured":"R. Janardan and F. P. Preparata, Widest-corridor problems, Nordic J. Comput., vol. 1, pp. 231\u2013245, 1994.","journal-title":"Nordic J. Comput."},{"key":"16_CR5","unstructured":"E. M. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, N.J., 1977."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(98)00130-6","volume":"68","author":"C.-S. Shin","year":"1998.","unstructured":"C.-S. Shin, S. Y. Shin and K.-Y. Chwa, The widest k-dense corridor problems, Information Processing Letters, vol. 68, pp. 25\u201331, 1998.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T18:08:06Z","timestamp":1551031686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}