{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:30Z","timestamp":1760440950139},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174575"},{"type":"electronic","value":"9783642174582"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_5","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T11:12:57Z","timestamp":1292411577000},"page":"41-50","source":"Crossref","is-referenced-by-count":5,"title":["NP-Completeness of Spreading Colored Points"],"prefix":"10.1007","author":[{"given":"Ovidiu","family":"Daescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqi","family":"Ju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/MPRV.2003.1186725","volume":"2","author":"A.R. Beresford","year":"2003","unstructured":"Beresford, A.R., Stajano, F.: Location Privacy in pervasive Computing. IEEE Pervasive Computing\u00a02(1), 46\u201355 (2003)","journal-title":"IEEE Pervasive Computing"},{"key":"5_CR2","unstructured":"Gedik, B., Liu, L.: A customizable k-anonymity model for protecting location privacy. In: ICDCS, pp. 620\u2013629 (2004)"},{"key":"5_CR3","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.: The farthest color Voronoi diagram and related problems. In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG 2001), pp. 113\u2013116 (2001)"},{"issue":"5","key":"5_CR4","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-spaning Object Revisited. International Journal of Computational Geometry and Applications (IJCGA)\u00a019(5), 457\u2013478 (2009)","journal-title":"International Journal of Computational Geometry and Applications (IJCGA)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Pfoser, D., Jensen, C.: Capturing the uncertainty of moving-objects representations. In: Proc. SSDBM, pp. 111\u2013132 (1999)","DOI":"10.1007\/3-540-48482-5_9"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Sistla, P.A., Wolfson, O., Chamberlain, S., Dao, S.: Querying the uncertain position of moving objects. In: Temporal Databases: Research and Practice, pp. 310\u2013337 (1998)","DOI":"10.1007\/BFb0053708"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00453-008-9174-2","volume":"56","author":"M. L\u00f6ffler","year":"2008","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica\u00a056(2), 235\u2013269 (2008)","journal-title":"Algorithmica"},{"key":"5_CR8","unstructured":"Ju, W., Luo, J.: New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model. In: CCCG 2009, pp. 1\u20134 (2009)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, S., Gu, Y., Hui, M., Li, F., Liu, C., Liu, L., Ooi, B.C., Yang, X., Zhang, D., Zhou, Y.: MarcoPolo: A community system for sharing and integrating travel information on maps. In: Proceedings of the 12th International Conference on Extending Database Technology (EDBT 2009), pp. 1148\u20131151 (2009)","DOI":"10.1145\/1516360.1516500"},{"key":"5_CR10","doi-asserted-by":"crossref","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. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14553-7_27"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.jda.2008.08.001","volume":"7","author":"M.G. Borgelt","year":"2009","unstructured":"Borgelt, M.G., van Kreveld, M., L\u00f6ffler, M., Luo, J., Merrick, D., Silveira, R.I., Vahedi, M.: Planar bichromatic minimum spanning trees. J. Discrete Algorithms\u00a07(4), 469\u2013478 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.: Smallest Color-Spanning Objects. In: Proc. 9th Annu. European Sympos. Algorithms, pp. 278\u2013289 (2001)","DOI":"10.1007\/3-540-44676-1_23"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K.H., Kitsuregawa, M.: Keyword search in spatial databases: Towards searching by document. In: Proceedings of the 25th IEEE International Conference on Data Engineering (ICDE 2009), pp. 688\u2013699 (2009)","DOI":"10.1109\/ICDE.2009.77"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T02:57:22Z","timestamp":1559876242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}