Parameterized Complexity is the rapidly advancing field of complexity and algorithmics with wide applications in almost every field dealing with algorithmics. The basic idea is that not all parts of a problem are created equal, and many instances of NP-complete problems are actually tractable, with practical algorithms, when various parts (parameters) of the input structure can be bounded.

Topics will include:

1. Basic introduction to the field, including some of the recent achievements and open problems
2. Tools and techniques for showing FPT or hardness, such as preprocessing and kernelization, iterative compression, and reductions
3. Applications to important fields such as Artificial Intelligence, Social Choice, Bioinformatics, Machine Learning, and Computational Complexity and Algorithmics

Speakers so far include Mike Fellows and Fran Rosamond (Newcastle), Vlad Estivill-Castro (Griffith), Nina Naroditskaya (NICTA/UNSW), Danny Hermelin (Max Planck Institute, Saarbrucken), among others.

There will be no fee for this workshop. The workshop will begin on Tuesday morning and conclude on Wednesday afternoon (30 and 31 March). There will be a picnic banquet Tuesday evening, family and children are invited.

Please let me know if you are interested in speaking, and send a brief abstract to Frances.Rosamond@newcastle.edu.au.