Search

Your search keyword '"W[1]-hard"' showing total 11 results

Search Constraints

Start Over You searched for: Descriptor "W[1]-hard" Remove constraint Descriptor: "W[1]-hard" Publisher springer international publishing Remove constraint Publisher: springer international publishing
11 results on '"W[1]-hard"'

Search Results

1. On the Harmless Set Problem Parameterized by Treewidth

2. Parameterized Intractability of Defensive Alliance Problem

3. On Structural Parameterizations of the Offensive Alliance Problem

4. The Balanced Satisfactory Partition Problem

5. Parameterized Complexity of Defensive and Offensive Alliances in Graphs

6. The Small Set Vertex Expansion Problem

7. Parameterized Complexity of Satisfactory Partition Problem

8. On the Parameterized Complexity of the Expected Coverage Problem

9. Parameterized Complexity of Fair Feedback Vertex Set Problem

10. Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion – A Deadlock Resolution Graph Problem

11. The Complexity of Induced Tree Reconfiguration Problems

Catalog

Books, media, physical & digital resources