{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:19:33Z","timestamp":1760440773983},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_64","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T21:38:06Z","timestamp":1228858686000},"page":"728-739","source":"Crossref","is-referenced-by-count":2,"title":["Covering a Point Set by Two Disjoint Rectangles"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Sang Won","family":"Bae","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P. Agarwal","year":"1998","unstructured":"Agarwal, P., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surveys\u00a030, 412\u2013458 (1998)","journal-title":"ACM Comput. Surveys"},{"key":"64_CR2","doi-asserted-by":"crossref","unstructured":"Bae, S.W., Lee, C., Ahn, H.-K., Choi, S., Chwa, K.-Y.: Maintaining extremal points and its applications to deciding optimal orientations. In: Proc. 18th Int. Sympos. Alg. Comput. (ISAAC), pp. 788\u2013799 (2007)","DOI":"10.1007\/978-3-540-77120-3_68"},{"key":"64_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0020-0190(00)00093-4","volume":"75","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S., Segal, M.: Covering a set of points by two axis-parallel boxes. Inform. Process. Lett.\u00a075, 95\u2013100 (2000)","journal-title":"Inform. Process. Lett."},{"key":"64_CR4","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: Proc. 43rd Annu. Found. Comput. Sci. (FOCS), pp. 617\u2013626 (2002)","DOI":"10.1109\/SFCS.2002.1181985"},{"key":"64_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G. Frederickson","year":"1984","unstructured":"Frederickson, G., Johnson, D.: Generalized selection and ranking: sorted matrices. SIAM J. on Comput.\u00a013, 14\u201330 (1984)","journal-title":"SIAM J. on Comput."},{"issue":"2","key":"64_CR6","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1137\/S0097539799348670","volume":"31","author":"F. Hoffmann","year":"2001","unstructured":"Hoffmann, F., Icking, C., Klein, R., Kriegel, K.: The polygon exploration problem. SIAM J. Comput.\u00a031(2), 577\u2013600 (2001)","journal-title":"SIAM J. Comput."},{"key":"64_CR7","unstructured":"Jaromczyk, J.W., Kowaluk, M.: Orientation indenpendent covering of point sets in R\n                  2 with pairs of rectangles or optimal squares. In: Proc. 12th Euro. Workshop Comput. Geom. (EuroCG), pp. 54\u201361 (1996)"},{"key":"64_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0925-7721(99)00052-8","volume":"15","author":"M. Kats","year":"2000","unstructured":"Kats, M., Kedem, K., Segal, M.: Discrete rectilinear 2-center problem. Comput. Geom.: Theory and Applications\u00a015, 203\u2013214 (2000)","journal-title":"Comput. Geom.: Theory and Applications"},{"key":"64_CR9","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1137\/S0097539794268649","volume":"26","author":"M. Katz","year":"1997","unstructured":"Katz, M., Sharir, M.: An expander-based approach to geometric optimization. SIAM J. on Comput.\u00a026, 1384\u20131408 (1997)","journal-title":"SIAM J. on Comput."},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM\u00a030, 852\u2013865 (1983)","journal-title":"J. ACM"},{"key":"64_CR11","doi-asserted-by":"crossref","unstructured":"Saha, C., Das, S.: Covering a set of points in a plane using two parallel rectangles. In: Proc. 17th Int. Conf. Comput.: Theory and Appl (ICCTA), pp. 214\u2013218 (2007)","DOI":"10.1109\/ICCTA.2007.45"},{"key":"64_CR12","unstructured":"Segal, M.: Covering point sets and accompanying problems. PhD thesis, Ben-Gurion University, Israel (1999)"},{"key":"64_CR13","unstructured":"Toussaint, G.: Solving geometric problems with the rotating calipers. In: Proc. IEEE MELECON 1983, Athens, Greece (1983)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T04:44:08Z","timestamp":1551674648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}