A witness-sensitive algorithm detects induced diamonds in Õ(min(n^{2.425}/t^{0.25} + n², n^ω)) time with high probability, improving on the prior O(n^ω log n) bound when t ≥ n^{(3-ω)/3}.
Schulman and Aravind Srinivasan , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
DSQ is W[1]-hard on degeneracy-2 and K_{3,3}-free graphs but FPT parameterized by solution size plus treewidth, FPT on nowhere dense classes, and admits subexponential algorithms on apex-minor-free graphs via bidimensionality.
citing papers explorer
-
Witness-Sensitive Detection of Induced Diamonds
A witness-sensitive algorithm detects induced diamonds in Õ(min(n^{2.425}/t^{0.25} + n², n^ω)) time with high probability, improving on the prior O(n^ω log n) bound when t ≥ n^{(3-ω)/3}.
-
Dominating Set with Quotas: Balancing Coverage and Constraints
DSQ is W[1]-hard on degeneracy-2 and K_{3,3}-free graphs but FPT parameterized by solution size plus treewidth, FPT on nowhere dense classes, and admits subexponential algorithms on apex-minor-free graphs via bidimensionality.