Hitting forbidden induced subgraphs on bounded treewidth graphs
From MaRDI portal
Publication:2051840
Recommendations
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Hitting minors on bounded treewidth graphs. III. Lower bounds
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Hitting forbidden subgraphs in graphs of bounded treewidth
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- A near-optimal planarization algorithm
- A tight lower bound for vertex planarization on graphs of bounded treewidth
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dynamic programming for graphs on surfaces
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Faster parameterized algorithms for minor containment
- Fundamentals of parameterized complexity
- Graph theory
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
- Hitting minors on bounded treewidth graphs. III. Lower bounds
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Linear-time algorithms for eliminating claws in graphs
- Lower bounds based on the exponential time hypothesis
- On the complexity of k-SAT
- Parameterized algorithms
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The node-deletion problem for hereditary properties is NP-complete
- Treewidth. Computations and approximations
- Which problems have strongly exponential complexity?
Cited in
(15)- On the forbidden induced subgraph probe and sandwich problems
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- Streaming deletion problems parameterized by vertex cover
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Streaming deletion problems Parameterized by vertex cover
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
- Kernelization dichotomies for hitting subgraphs under structural parameterizations
- Compound logics for modification problems
- Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
- Metric dimension and geodetic set parameterized by vertex cover
- Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
This page was built for publication: Hitting forbidden induced subgraphs on bounded treewidth graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051840)
