The following pages link to (Q5275384):
Displayed 9 items.
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)