Pages that link to "Item:Q1274918"
From MaRDI portal
The following pages link to Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918):
Displayed 16 items.
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- Threshold dominating cliques in random graphs and interval routing (Q1044044) (← links)
- Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Continuous facility location on graphs (Q2118124) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Surfing with Rod (Q2973715) (← links)
- An analysis of the W*-hierarchy (Q5294024) (← links)
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642) (← links)
- Parameterized Algorithms for Generalized Domination (Q5505650) (← links)