{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:46Z","timestamp":1725534106536},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022692"},{"type":"electronic","value":"9783642022708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_15","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T05:17:47Z","timestamp":1245388667000},"page":"132-140","source":"Crossref","is-referenced-by-count":0,"title":["Square and Rectangle Covering with Outliers"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Sang Won","family":"Bae","sequence":"additional","affiliation":[]},{"given":"Sang-Sub","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Iris","family":"Reinbacher","sequence":"additional","affiliation":[]},{"given":"Wanbin","family":"Son","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A. Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Algorithms\u00a012, 38\u201356 (1991)","journal-title":"J. Algorithms"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1007\/978-3-540-92182-0_64","volume-title":"ISAAC 2008","author":"H.-K. Ahn","year":"2008","unstructured":"Ahn, H.-K., Bae, S.W.: Covering a point set by two disjoint rectangles. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 728\u2013739. Springer, Heidelberg (2008)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Atanassov, R., Bose, P., Couture, M., Maheshwari, A., Morin, P., Paquette, M., Smid, M., Wuhrer, S.: Algorithms for optimal outlier removal. J. Discrete Alg. (to appear)","DOI":"10.1016\/j.jda.2008.12.002"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bespamyatnikh, S., Segal, M.: Covering a set of points by two axis\u2013parallel boxes. Inform. Proc. Lett, 95\u2013100 (2000)","DOI":"10.1016\/S0020-0190(00)00093-4"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/PL00009478","volume":"22","author":"T.M. Chan","year":"1999","unstructured":"Chan, T.M.: Geometric applications of a randomized optimization technique. Discrete Comput. Geom.\u00a022(4), 547\u2013567 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01762115","volume":"3","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: An algorithm for segment-dragging and its implementation. Algorithmica\u00a03, 205\u2013221 (1988)","journal-title":"Algorithmica"},{"key":"15_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"6","key":"15_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ipl.2005.02.013","volume":"94","author":"S. Das","year":"2005","unstructured":"Das, S., Goswamib, P.P., Nandy, S.C.: Smallest k-point enclosing rectangle and square of arbitrary orientation. Inform. Proc. Lett.\u00a094(6), 259\u2013266 (2005)","journal-title":"Inform. Proc. Lett."},{"key":"15_CR9","unstructured":"Jaromczyk, J.W., Kowaluk, M.: Orientation independent covering of point sets in R\n                    2 with pairs of rectangles or optimal squares. In: Abstracts 12th European Workshop Comput. Geom., pp. 77\u201384. Universit\u00e4t M\u00fcnster (1996)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0925-7721(99)00052-8","volume":"15","author":"M.J. Katz","year":"2000","unstructured":"Katz, M.J., Kedem, K., Segal, M.: Discrete rectilinear 2-center problems. Comput. Geom. Theory Appl.\u00a015, 203\u2013214 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"key":"15_CR11","first-page":"365","volume":"16","author":"J. Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Welzl, E., Sharir, M.: A subexponential bound for linear programming and related problems. Algorithmica\u00a016, 365\u2013384 (1996)","journal-title":"Algorithmica"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Saha, C., Das, S.: Covering a set of points in a plane using two parallel rectangles. In: ICCTA 2007: Proceedings of the International Conference on Computing: Theory and Applications, pp. 214\u2013218 (2007)","DOI":"10.1109\/ICCTA.2007.45"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1015670603203","volume":"1","author":"M. Segal","year":"2002","unstructured":"Segal, M.: Lower bounds for covering problems. Journal of Mathematical Modelling and Algorithms\u00a01, 17\u201329 (2002)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0020-0190(97)00212-3","volume":"65","author":"M. Segal","year":"1998","unstructured":"Segal, M., Kedem, K.: Enclosing k points in the smallest axis parallel rectangle. Inform. Process. Lett.\u00a065, 95\u201399 (1998)","journal-title":"Inform. Process. Lett."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Sharir, M., Welzl, E.: Rectilinear and polygonal p-piercing and p-center problems. In: Proc. 12th Annu. ACM Sympos. Comput. Geom, pp. 122\u2013132 (1996)","DOI":"10.1145\/237218.237255"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T22:38:42Z","timestamp":1552084722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}