URL Source: https://erich-friedman.github.io/papers/squares/squares.html
kept by lunawispy
The paper surveys results on packing n unit squares into the smallest containing square and presents new constructions that improve the best-known upper bounds for several values of n.