parameterized algorithms for geometric set cover
The paper D. Marx: Efficient approximation schemes for geometric problems?, in ESA 2005, gives W1-hardness for covering points with unit squares. A draft is here.