Optimizing squares covering a set of points

Ackerman, 2006, The number of guillotine partitions in d dimensions, Inform. Process. Lett., 98, 162, 10.1016/j.ipl.2006.01.011 Agarwal, 1994, Planar geometric locations problems, Algorithmica, 11, 185, 10.1007/BF01182774 Blum, 1973, Time bounds for selection, J. Comput. System Sci., 7, 448, 10.1016/S0022-0000(73)80033-9 Cabello, 2008, Covering point sets with two disjoint disks or squares, Comput. Geom., 40, 195, 10.1016/j.comgeo.2007.10.001 Chandran, 1992, A parallel algorithm for enclosed and enclosing triangles, Internat. J. Comput. Geom. Appl., 2, 191, 10.1142/S0218195992000123 Chazelle, 1996, On linear-time deterministic algorithms for optimization problems in fixed dimension, J. Algorithms, 21, 579, 10.1006/jagm.1996.0060 Chazelle, 1986, On a circle placement problem, Computing, 36, 1, 10.1007/BF02238188 Christofides, 1995, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, European J. Oper. Res., 83, 21, 10.1016/0377-2217(93)E0277-5 Das, 2005, Smallest k-point enclosing rectangle and square of arbitrary orientation, Inform. Process. Lett., 94, 259, 10.1016/j.ipl.2005.02.013 Fournier, 2011, Fitting a step function to a point set, Algorithmica, 60, 95, 10.1007/s00453-009-9342-z Frederickson, 1991, Parametric search and locating supply centers in trees, vol. 519, 299 Frederickson, 1982, The complexity of selection and ranking in X+Y and matrices with sorted columns, J. Comput. Syst. Sci., 24, 197, 10.1016/0022-0000(82)90048-4 Frederickson, 1983, Finding kth paths and p-centers by generating and searching good data structures, J. Algorithms, 4, 61, 10.1016/0196-6774(83)90035-4 Frederickson, 1984, Generalized selection and ranking: sorted matrices, SIAM J. Comput., 13, 14, 10.1137/0213002 Hoffmann, 2001, Robustness in geometric computations, J. Comput. Inform. Sci. Eng., 1, 143, 10.1115/1.1375815 Hurtado, 1998 Hurtado, 2000, Constrained facility location, Stud. Locat. Anal., 15 Jaromczyk, 1996, Orientation independent covering of point sets in R2 with pairs of rectangles or optimal squares, vol. 871, 71 Katz, 2000, Discrete rectilinear 2-center problems, Comput. Geom., 15, 203, 10.1016/S0925-7721(99)00052-8 Kim, 2011, Covering a point set by two disjoint rectangles, Internat. J. Comput. Geom. Appl., 21, 313, 10.1142/S0218195911003676 Klee, 1985, Finding the smallest triangles containing a given convex polygon, J. Algorithms, 6, 359, 10.1016/0196-6774(85)90005-7 Kleinberg, 2006 Matoušek, 1996, A subexponential bound for linear programming and related problems, Algorithmica, 16, 498, 10.1007/BF01940877 Megiddo, 1983, Linear-time algorithms for linear programming in R3 and related problems, SIAM J. Comput., 12, 759, 10.1137/0212052 Melkman, 1987, On-line construction of the convex hull of a simple polyline, Inform. Process. Lett., 25, 11, 10.1016/0020-0190(87)90086-X Nussbaum, 1997, Rectilinear p-piercing problems, 316 O'Rourke, 1985, Finding minimal enclosing boxes, Int. J. Comput. Inform. Sci., 14, 183, 10.1007/BF00991005 O'Rourke, 1986, An optimal algorithm for finding minimal enclosing triangles, J. Algorithms, 7, 258, 10.1016/0196-6774(86)90007-6 Overmars, 1991, New upper bounds in Klee's measure problem, J. Comput., 20, 1034 Preparata, 1990 Roy, 2009, Constrained minimum enclosing circle with center on a query line, Comput. Geom., Theory Appl., 42, 632, 10.1016/j.comgeo.2009.01.002 Saha, 2009, Covering a set of points in a plane using two parallel rectangles, Inform. Process. Lett., 109, 907, 10.1016/j.ipl.2009.04.017 Segal, 1997, On piercing of axis-parallel rectangles and rings, vol. 1284, 430 Segal, 2002, Lower bounds for covering problems, J. Math. Model. Algorithms, 1, 17, 10.1023/A:1015670603203 Sharir, 1996, Rectilinear and polygonal p-piercing and p-center problems, 122 Sinha Mahapatra, 2007, Covering points by isothetic unit squares, 169 Sinha Mahapatra, 2008, Maximal covering by two isothetic unit squares, 103 Toussaint, 1983, Solving geometric problems with the rotating calipers Wang, 2014, Line-constrained k-median, k-means and k-center problems in the plane, vol. 8889, 3 Welzl, 1991, Smallest enclosing disks (balls and ellipses), vol. 555, 359