{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:38:44Z","timestamp":1772908724789,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642219306","type":"print"},{"value":"9783642219313","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21931-3_7","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T14:11:35Z","timestamp":1308319895000},"page":"84-93","source":"Crossref","is-referenced-by-count":7,"title":["k-Enclosing Axis-Parallel Square"],"prefix":"10.1007","author":[{"given":"Priya Ranjan Sinha","family":"Mahapatra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arindam","family":"Karmakar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha P.","family":"Goswami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_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. Journal of Algorithms\u00a012, 38\u201356 (1991)","journal-title":"Journal of Algorithms"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1006\/jagm.1994.1038","volume":"17","author":"P.K. Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M., Toledo, S.: Applications of parametric searching in geometric optimization. Journal of Algorithms\u00a017, 292\u2013318 (1994)","journal-title":"Journal of Algorithms"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.comgeo.2010.10.002","volume":"44","author":"H.-K. Ahn","year":"2011","unstructured":"Ahn, H.-K., Won, B.S., Demaine, E.D., Demaine, M.L., Kim, S.-S., Korman, M., Reinbacher, I., Son, W.: Covering points by disjoint boxes with outliers. Computational Geometry: Theory and Applications\u00a044, 178\u2013190 (2011)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"7_CR4","volume-title":"Introduction to mathematical techniques in pattern recognition","author":"H.C. Andrews","year":"1972","unstructured":"Andrews, H.C.: Introduction to mathematical techniques in pattern recognition. Wiley-Intersciences, New York (1972)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Asano, T., Bhattacharya, B., Keil, M., Yao, F.: Clustering algorithms based on maximum and minimum spanning trees. In: Proc. 4th Annual Symposium on Computational Geometry, pp. 252\u2013257 (1988)","DOI":"10.1145\/73393.73419"},{"key":"7_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (1997)"},{"key":"7_CR7","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 Computational Geometry\u00a022, 547\u2013567 (1999)","journal-title":"Discrete Computational Geometry"},{"key":"7_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., Goswami, P.P., Nandy, S.C.: Smallest k-point enclosing rectangle and square of arbitrary orientation. Information Processing Letters\u00a094, 259\u2013266 (2005)","journal-title":"Information Processing Letters"},{"key":"7_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility Location: Applications and Theory","author":"Z. Drezner","year":"2002","unstructured":"Drezner, Z., Hamacher, H.: Facility Location: Applications and Theory. Springer, Berlin (2002)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-57155-8_254","volume-title":"Algorithms and Data Structures","author":"A. Datta","year":"1993","unstructured":"Datta, A., Lenhof, H.E., Schwarz, C., Smid, M.: Static and dynamic algorithms for k-point clustering problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol.\u00a0709, pp. 265\u2013276. Springer, Heidelberg (1993)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1006\/jagm.1995.1048","volume":"19","author":"A. Datta","year":"1995","unstructured":"Datta, A., Lenhof, H.E., Schwarz, C., Smid, M.: Static and Dynamic Algorithms for k-point Clustering Problems. Journal of Algorithms\u00a019, 474\u2013503 (1995)","journal-title":"Journal of Algorithms"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discrete Computational Geometry\u00a011, 321\u2013350 (1994)","journal-title":"Discrete Computational Geometry"},{"key":"7_CR13","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1995","unstructured":"Megiddo, N.: Linear-Time Algorithms for Linear Programming in \u211d3 and Related Problems. SIAM Journal Computing\u00a012, 759\u2013776 (1995)","journal-title":"SIAM Journal Computing"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J. Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discrete Computational Geometry\u00a014, 365\u2013384 (1995)","journal-title":"Discrete Computational Geometry"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ipl.2008.02.011","volume":"107","author":"S. Majumder","year":"2008","unstructured":"Majumder, S., Bhattacharya, B.B.: Density or Discrepancy: A VLSI Designer\u2019s Dilemma in Hot Spot Analysis. Information Processing Letter\u00a0107, 177\u2013182 (2008)","journal-title":"Information Processing Letter"},{"key":"7_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data structures and algorithms 3: multi-dimensional searching and computational geometry","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data structures and algorithms 3: multi-dimensional searching and computational geometry. Springer, New York (1984)"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0196-6774(86)90007-6","volume":"7","author":"J. O\u2019Rourke","year":"1986","unstructured":"O\u2019Rourke, J., Aggarwal, A., Maddila, S., Baldwin, M.: An optimal algorithm for finding minimal enclosing triangles. Journal of Algorithms\u00a07, 258\u2013269 (1986)","journal-title":"Journal of Algorithms"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF00991005","volume":"14","author":"J. O\u2019Rourke","year":"1985","unstructured":"O\u2019Rourke, J.: Finding minimal enclosing boxes. International Journal of Computer and Information Sciences\u00a014, 183\u2013199 (1985)","journal-title":"International Journal of Computer and Information Sciences"},{"key":"7_CR20","volume-title":"Computational Geometry: an Introduction","author":"F.P. Preparata","year":"1990","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: an Introduction. Springer, Berlin (1990)"},{"key":"7_CR21","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. Information Processing Letter\u00a065, 95\u201399 (1998)","journal-title":"Information Processing Letter"},{"key":"7_CR22","unstructured":"Smid, M.: Finding k Points with a Smallest Enclosing Square, Report MPI-92-152, Max-Plank-Institute fur Informatik, Saarbriucken (1992)"},{"key":"7_CR23","unstructured":"Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proc. IEEE MELECON (1983)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E. Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipses). In: Maurer, H.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol.\u00a0555, pp. 359\u2013370. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21931-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T19:35:01Z","timestamp":1553801701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21931-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219306","9783642219313"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21931-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}