Search

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

Search Constraints

Start Over You searched for: Descriptor "W[1]-hard" Remove constraint Descriptor: "W[1]-hard"
29 results on '"W[1]-hard"'

Search Results

1. On Structural Parameterizations of the Harmless Set Problem.

2. On the Harmless Set Problem Parameterized by Treewidth

Catalog

Books, media, physical & digital resources

3. Parameterized Intractability of Defensive Alliance Problem

4. On Structural Parameterizations of the Offensive Alliance Problem

5. The Balanced Satisfactory Partition Problem

6. Parameterized Complexity of Defensive and Offensive Alliances in Graphs

7. Further parameterized algorithms for the [formula omitted]-free edge deletion problem.

8. Defensive alliances in graphs.

9. The Small Set Vertex Expansion Problem

10. Parameterized Complexity of Satisfactory Partition Problem

11. On the Parameterized Complexity of the Expected Coverage Problem

12. Parameterized Complexity of Fair Feedback Vertex Set Problem

14. On the Parameterized Complexity of the Expected Coverage Problem.

15. On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem.

16. Parameterized complexity of satisfactory partition problem.

17. The Small Set Vertex Expansion Problem.

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

19. Parameterized complexity of fair feedback vertex set problem.

20. Parameterized Complexity of Conflict-Free Matchings and Paths.

21. Offensive alliances in graphs.

22. The Complexity of Induced Tree Reconfiguration Problems

23. On the Parameterized Complexity of Relaxations of Clique

24. Tractability, hardness, and kernelization lower bound for and/or graph solution.

25. Ruling out FPT algorithms for Weighted Coloring on forests.

26. Width Parameterizations for Knot-Free Vertex Deletion on Digraphs

27. Parameterized Complexity of Conflict-Free Matchings and Paths

28. Ruling out FPT algorithms for Weighted Coloring on forests

29. Routing with Congestion in Acyclic Digraphs