{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:09:51Z","timestamp":1726409391689},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_35","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"431-442","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Width Color Spanning Annulus"],"prefix":"10.1007","author":[{"given":"Ankush","family":"Acharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-44676-1_23","volume-title":"Algorithms - ESA 2001","author":"M Abellanas","year":"2001","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: Smallest color-spanning objects. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 278\u2013289. Springer, Heidelberg (2001)"},{"key":"35_CR2","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: The farthest color Voronoi diagram and related problems. In: 17th EuroCG, pp. 113\u2013116 (2001)"},{"key":"35_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.tcs.2011.12.075","volume":"508","author":"DZ Chen","year":"2013","unstructured":"Chen, D.Z., Misiolek, E.: Algorithms for interval structures with applications. Theor. Comput. Sci. 508, 41\u201353 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S0218195909003076","volume":"19","author":"S Das","year":"2009","unstructured":"Das, S., Goswami, P.P., Nandy, S.C.: Smallest color-spanning object revisited. Int. J. Comput. Geom. Appl. 19, 457\u2013478 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.orl.2009.02.007","volume":"37","author":"ON Gluchshenko","year":"2009","unstructured":"Gluchshenko, O.N., Hamacher, H.W., Tamir, A.: An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. Oper. Res. Lett. 37, 168\u2013170 (2009)","journal-title":"Oper. Res. Lett."},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"DP Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discret. Comput. Geom. 9, 267\u2013291 (1993)","journal-title":"Discret. Comput. Geom."},{"key":"35_CR8","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 80\u201386 (1983)","DOI":"10.1145\/800061.808735"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:44:16Z","timestamp":1498329856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}