On October 12, Nicolas Nisse, from Inria team COATI, will introduce the field he is working in, and its links to HPC problematics.
Title: Brief introduction on parameterized algorithms
This talk will be a mini-course about parameterized complexity and algorithms. We will first survey the basics and show how the structure of the instances may facilitate the resolution of problems toward the design of Fixed Parameter Tractable (FPT) algorithms. We will give some examples about scheduling problems and conclude with a discussion about tree-decompositions of graphs, an important tool in the design of FPT algorithms.
The slides are available here.