{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:57:00Z","timestamp":1725796620610},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_25","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"288-299","source":"Crossref","is-referenced-by-count":3,"title":["Shortest Color-Spanning Intervals"],"prefix":"10.1007","author":[{"given":"Minghui","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","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.\u00a02161, pp. 278\u2013289. Springer, Heidelberg (2001)"},{"key":"25_CR2","unstructured":"Barba, L., Durocher, S., Fraser, R., Hurtado, F., Mehrabi, S., Mondal, D., Morrison, J., Skala, M., Wahid, M.A.: On k-enclosing objects in a coloured point set. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), pp. 229\u2013234 (2013)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2011.12.075","volume":"508","author":"D.Z. Chen","year":"2013","unstructured":"Chen, D.Z., Misiolek, E.: Algorithms for interval structures with applications. Theoretical Computer Science\u00a0508, 41\u201353 (2013)","journal-title":"Theoretical Computer Science"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/s00454-011-9338-8","volume":"46","author":"D.Z. Chen","year":"2011","unstructured":"Chen, D.Z., Wang, C., Wang, H.: Representing a functional curve by curves with fewer peaks. Discrete and Computational Geometry\u00a046, 334\u2013360 (2011)","journal-title":"Discrete and Computational Geometry"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"6982","DOI":"10.1016\/j.tcs.2011.09.010","volume":"412","author":"M. Cygan","year":"2011","unstructured":"Cygan, M., Philip, G., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Dominating set is fixed parameter tractable in claw-free graphs. Theoretical Computer Science\u00a0412, 6982\u20137000 (2011)","journal-title":"Theoretical Computer Science"},{"key":"25_CR6","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. International Journal of Computational Geometry and Applications\u00a019, 457\u2013478 (2009)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"25_CR7","first-page":"590","volume-title":"Algorithms and Computation","author":"Chenglin Fan","year":"2013","unstructured":"Fan, C., Luo, J., Zhu, B.: Tight approximation bounds for connectivity with a color-spanning set. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol.\u00a08283, pp. 590\u2013600. Springer, Heidelberg (2013)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science\u00a0410, 53\u201361 (2009)","journal-title":"Theoretical Computer Science"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-14553-7_27","volume-title":"Frontiers in Algorithmics","author":"R. Fleischer","year":"2010","unstructured":"Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 285\u2013292. Springer, Heidelberg (2010)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.ipl.2011.07.015","volume":"111","author":"R. Fleischer","year":"2011","unstructured":"Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets is hard. Information Processing Letters\u00a0111, 1054\u20131056 (2011)","journal-title":"Information Processing Letters"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1089\/cmb.2011.0097","volume":"18","author":"M. Jiang","year":"2011","unstructured":"Jiang, M.: The zero exemplar distance problem. Journal of Computational Biology\u00a018, 1077\u20131086 (2011)","journal-title":"Journal of Computational Biology"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/s10878-012-9458-y","volume":"26","author":"W. Ju","year":"2013","unstructured":"Ju, W., Fan, C., Luo, J., Zhu, B., Daescu, O.: On some geometric problems of color-spanning sets. Journal of Combinatorial Optimization\u00a026, 266\u2013283 (2013)","journal-title":"Journal of Combinatorial Optimization"},{"key":"25_CR13","unstructured":"Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Spanning colored points with intervals. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), pp. 265\u2013270 (2013)"},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1007\/978-3-642-45030-3_59","volume-title":"Algorithms and Computation","author":"Payam 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.) ISAAC 2013. LNCS, vol.\u00a08283, pp. 634\u2013643. Springer, Heidelberg (2013)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal\u00a051, 60\u201378 (2008)","journal-title":"The Computer Journal"}],"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-08783-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T22:45:06Z","timestamp":1539384306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}