FPT at work: Using fixed parameter tractability to solve larger instances of hard problems
When dealing with hard computational problems (NP-complete or worse), Scientists, Engineers and other users of software provided by Computer Scientists care most about how large a problem instance a particular method is able to solve in reasonable time. In this talk, we discuss the contributions and deficiencies of current fixed parameter tractability methods within this context.
Dehne, F. (2006). FPT at work: Using fixed parameter tractability to solve larger instances of hard problems.