Pages that link to "Item:Q4586151"
From MaRDI portal
The following pages link to Approximation and Kernelization for Chordal Vertex Deletion (Q4586151):
Displaying 19 items.
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← 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)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
- (Q5089163) (← links)
- (Q5874519) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- (Q6065472) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)
