Fundamentals of Parameterized Complexity

Parameterized complexity is a multivariant view of complexity seeking to utilize the order present in natural problems to establish practical tractability, or to provide tools that such a methodology won't work. Since the original work in the early 1990's, there has been a clearly defined set of techniques tunes to this idea.

In this pair of tutorial lectures I will discuss the basic mathods used for the construction of parameterized algorithms, and some of the methods for showing parameterized intractability and optimality of the computational classes.

This method is something that a modern person doing algorithms should know.

The first lecture will be about the positive techniques, and the second on limitations. The material will be accessible to a beginning graduate student.

You are here: Home Speakers Uncategorised Fundamentals of Parameterized Complexity