Parameterized Complexity
Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002
Min Cut Linear Arrangement, Independet Set, Vertex Cover and Dominating Set.The last two problems are de ned
Cited by 2,836 works. doi:10.1016/s1571-0661(04)00301-9 Open-access PDF
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Parameterized Complexity
- Checking that finite state concurrent programs satisfy their linear specification
- Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Parameterized complexity: A framework for systematically confronting computational intractability
- A New Implementation and Detailed Study of Breakpoint Analysis
- Vertex Cover: Further Observations and Further Improvements
- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems