On the Parameterized Complexity of Compact Set Packing
{{output}}
The Set Packing problem is, given a collection of sets S over a ground set U, to find a maximum collection of sets that are pairwise disjoint. The problem is among the most fundamental NP-hard optimization problems that have been studied extensively in various... ...