Tight bounds for chordal/interval vertex deletion parameterized by treewidth
From MaRDI portal
Cites work
- (Meta) kernelization
- A c^k n 5-approximation algorithm for treewidth
- A characterisation of rigid circuit graphs
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
- A near-optimal planarization algorithm
- A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
- A tight lower bound for vertex planarization on graphs of bounded treewidth
- A unified approach to approximating resource allocation and scheduling
- Approximation and kernelization for chordal vertex deletion
- Chordal editing is fixed-parameter tractable
- Clifford algebras meet tree decompositions
- Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth
- Computing the Minimum Fill-In is NP-Complete
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Erdös-Pósa Property of Obstructions to Interval Graphs
- Erdős-Pósa property of chordless cycles and its applications
- Fast Hamiltonicity checking via bases of perfect matchings
- Feedback vertex set inspired kernel for chordal vertex deletion
- Finding Hamiltonian circuits in interval graphs
- Finding small separators in linear time via treewidth reduction
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- Graph Classes: A Survey
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. XIII: The disjoint paths problem
- Graph structure and monadic second-order logic. A language-theoretic approach
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- 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 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 7489399 (Why is no real title available?)
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- scientific article; zbMATH DE number 5047784 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Incidence matrices, interval graphs and seriation in archeology
- Interval deletion is fixed-parameter tractable
- Interval graphs and searching
- Interval vertex deletion admits a polynomial kernel
- Known algorithms on graphs of bounded treewidth are probably optimal
- Largest chordal and interval subgraphs faster than \(2^n\)
- Linear recognition of almost interval graphs
- Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
- Mixing Color Coding-Related Techniques
- On directed feedback vertex set parameterized by treewidth
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
- Parameterized algorithms
- Parameterized complexity of vertex colouring
- Parameterized complexity of vertex deletion into perfect graph classes
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Proper interval vertex deletion
- Representative families of product families
- Representative families: a unified tradeoff-based approach
- Slightly superexponential parameterized problems
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Structural parameterizations with modulator oblivion
- Subexponential parameterized algorithm for minimum fill-in
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- Treewidth. Computations and approximations
- Vertex deletion parameterized by elimination distance and even less
- Which problems have strongly exponential complexity?
This page was built for publication: Tight bounds for chordal/interval vertex deletion parameterized by treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6980436)
