Optimizing squares covering a set of points

We propose different techniques to solve the above problems in cases where squares are axis-parallel or of arbitrary orientation, disjoint or overlapping. All the algorithms we use run in time that is a low-order polynomial in n, and improve upon the previous algorithms, if any.