Completion to chordal distance-hereditary graphs: a quartic vertex-kernel

Related Items (1)

A survey of parameterized algorithms and the complexity of edge modification

Cites Work

Polynomial kernels for proper interval completion and related problems
New results on Ptolemaic graphs
Polynomial kernels for 3-leaf power graph modification problems
Cover-incomparability graphs of posets
Laminar structure of ptolemaic graphs with applications
Decomposition by clique separators
Distance-hereditary graphs
The center and the distance center of a Ptolemaic graph
On metric properties of certain clique graphs
On the complexity of DNA physical mapping
Fixed-parameter tractability of graph modification problems for hereditary properties
Two edge modification problems without polynomial kernels
An introduction to clique minimal separator decomposition
A polynomial kernel for trivially perfect editing
On the (non-)existence of polynomial kernels for $P _{l }$-free edge modification problems
On the threshold of intractability
Incompressibility of $H$-free edge modification problems: towards a dichotomy
Incompressibility of $H$-free edge modification problems
Degrees of acyclicity for hypergraphs and relational database schemes
The complexity of some edge deletion problems
A characterization of ptolemaic graphs
Computing the Minimum Fill-In is NP-Complete
Graph Classes: A Survey
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
Kernelization
Dichotomy Results on the Hardness of $H$-free Edge Modification Problems
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
Ptolemaic Graphs and Interval Graphs Are Leaf Powers
A Characterization of Certain Ptolemaic Graphs
Complexity classification of some edge modification problems

This page was built for publication: Completion to chordal distance-hereditary graphs: a quartic vertex-kernel