1 citations · 1 across the 10 of their papers we have counts for
1 paper · 1 filter
Marco Caoduro, András Sebő
Given a finite family of squares in the plane, the packing problem asks for the maximum number ν of pairwise disjoint squares among them, while the hitting problem for the minimu…