Pages that link to "Item:Q2692722"
From MaRDI portal
The following pages link to FPT and kernelization algorithms for the induced tree problem (Q2692722):
Displaying 8 items.
- The three-in-a-tree problem (Q653792) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Optimal tree decompositions revisited: a simpler linear-time FPT algorithm (Q2056889) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- (Q5273088) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
