Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes

Related Items (1)

Counting Small Induced Subgraphs with Hereditary Properties

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Fundamentals of parameterized complexity
Sparsity. Graphs, structures, and algorithms
Parameterized complexity of induced graph matching on claw-free graphs
Fixed-parameter tractability and completeness II: On completeness for W[1]
Parameterized leaf power recognition via embedding into graph products
Counting induced subgraphs: an algebraic approach to $\#$W[1-hardness]
On the parameterized complexity of multiple-interval graph problems
The node-deletion problem for hereditary properties is NP-complete
Unit disk graphs
Fixed-parameter tractability of graph modification problems for hereditary properties
Parameterized complexity of finding subgraphs with hereditary properties.
The parameterised complexity of counting connected subgraphs and graph motifs
FPT and kernelization algorithms for the induced tree problem
Vertex Cover: Further Observations and Further Improvements
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
Parameterized Complexity of Independence and Domination on Geometric Graphs
Nondeterminism within $P^ * $
Subgraph Isomorphism in Planar Graphs and Related Problems
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Parameterized Complexity of Independent Set in H-Free Graphs.
Planar Induced Subgraphs of Sparse Graphs
Listing All Maximal Cliques in Large Sparse Real-World Graphs
Theory and Applications of Satisfiability Testing
Algorithms – ESA 2005
Parameterized Algorithms
Improved Parameterized Upper Bounds for Vertex Cover

This page was built for publication: Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes