Pages that link to "Item:Q5236287"

The following pages link to Interval Vertex Deletion Admits a Polynomial Kernel (Q5236287):

Displaying 13 items.

• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
• Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
• (Q5089163) (← links)
• (Q5874519) (← links)
• Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
• A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
• (Q6065472) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• A polynomial kernel for proper Helly circular-arc vertex deletion (Q6547958) (← links)
• Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
• A constant-factor approximation for weighted bond cover (Q6671673) (← links)