Presents parameterized approximation schemes (PAS) for maximum independent set of rectangles and 2D geometric knapsack with rotations, plus W[1]-hardness proofs for the exact versions.
Parameterized inapproximability of target set selection and generalizations
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
citing papers explorer
-
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
Presents parameterized approximation schemes (PAS) for maximum independent set of rectangles and 2D geometric knapsack with rotations, plus W[1]-hardness proofs for the exact versions.
-
The Normal Domination Partizan Game in Stars
The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.