The densest packing of equal circles into a parallel strip (Q756140)

Given an infinite strip S of width w in the euclidean plane one can ask for the densest packing of points in S for which any two distinct points have distance at least 1. The exact answer has been known for \(\omega\leq \sqrt{2}\) and for \(w=n\sqrt{3}/2\) with n an integer. The author determines the maximal density for the case \(\sqrt{3}/2<w\leq \sqrt{3}\).