view: Given a set S of n translates of an object in Rd, find a set of k lines with the property
that every object in S is “stabbed”(intersected) by at least one line. We show that when S
consists of axis-parallel unit squares in R2 the (decision) problem of stabbing S with axis-
parallel lines is W [1]-hard with respect to k (and thus, not fixed-parameter tractable unless
FPT= W [1]) while it becomes fixed-parameter tractable when the squares are disjoint. We …