Parameterized Algorithm Design and Complexity Analysis: New Methods and Strategic Applications in the FPT Algorithmic Server Project. A fundamental discovery of the first decades of computer science is that completely efficient (polynomial time) algorithms probably do not exist for thousands of natural computational problems. The project will result in new methods for designing and analyzing algorithms for hard problems with natural parameters, and in improved
algorithms for these problems.