Algorithms and Data Structures

Volume 2748 of the series Lecture Notes in Computer Science pp 505-519

New Directions and New Challenges in Algorithm Design and Complexity, Parameterized

  • Michael R. FellowsAffiliated withSchool of Electrical Engineering and Computer Science, University of Newcastle, University Drive

* Final gross prices may vary according to local VAT.

Get Access


The goals of this survey are to:

(1) Motivate the basic notions of parameterized complexity and give some examples to introduce the toolkits of FPT and W-hardness as concretely as possible for those who are new to these ideas.

(2) Describe some new research directions, new techniques and challenging open problems in this area.