The following pages link to (Q5075825):
Displaying 7 items.
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- Connected feedback vertex set on AT-free graphs (Q6658085) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)