Pages that link to "Item:Q507431"
From MaRDI portal
The following pages link to Improved kernel results for some FPT problems based on simple observations (Q507431):
Displaying 10 items.
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- An improved linear kernel for the cycle contraction problem (Q2274484) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- Faster deterministic algorithm for \textsc{Co-Path Set} (Q2680227) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← links)