A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
This survey reviews the basic notions of parameterized complexity, and describes some new approaches to designing FPT algorithms and problem reductions for graph problems.
doi:10.1007/978-3-540-39890-5_1
fatcat:jojjzpn4fffedjarzcwieynllm