The following pages link to Wheel-Free Deletion Is W[2]-Hard (Q3503585):
Displaying 19 items.
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- (Q5743380) (← links)
- Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- (Q6089665) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
