{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:21:11Z","timestamp":1756682471517,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319292205"},{"type":"electronic","value":"9783319292212"}],"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-29221-2_4","type":"book-chapter","created":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T12:02:54Z","timestamp":1455278574000},"page":"37-48","source":"Crossref","is-referenced-by-count":1,"title":["Color Spanning Objects: Algorithms and Hardness Results"],"prefix":"10.1007","author":[{"given":"Sandip","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","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. Technical report (2006)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"7","key":"4_CR3","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2011.12.075","volume":"508","author":"D Chen","year":"2013","unstructured":"Chen, D., Misiolek, E.: Algorithms for interval structures with applications. Theor. Comput. Sci. 508, 41\u201353 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR5","doi-asserted-by":"publisher","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 objects revisited. Int. J. Comput. Geom. Appl. 19, 457\u2013478 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"4_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"4_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"4_CR8","doi-asserted-by":"publisher","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. Discrete Comput. Geom. 9, 267\u2013291 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, M., Wang, H.: Shortest color spanning intervals. Theoretical Computer Sci. (2015, in Press)","DOI":"10.1007\/978-3-319-08783-2_25"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-642-45030-3_59","volume-title":"Algorithms and Computation","author":"P Khanteimouri","year":"2013","unstructured":"Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Computing the smallest color-spanning axis-parallel square. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 634\u2013643. Springer, Heidelberg (2013)"},{"key":"4_CR11","unstructured":"Khanteimouri, P., Mohades, A., Abam, M., Kazemi, M.: Spanning colored points with intervals. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG), pp. 265\u2013270 (2013)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 378\u2013389. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29221-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:59:11Z","timestamp":1559383151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29221-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319292205","9783319292212"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29221-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}