Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.
Parameterized inapproximability of target set selection and generalizations
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
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 winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
citing papers explorer
-
Multi-Source Reachability in Near-Optimal Time
Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.
-
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.