The talk will try to do three things: (1) Give a basic introduction to the key ideas of parameterized complexity/multivariate algorithmics, for those who may be unfamiliar with this area of research. The account will be somewhat idiosyncratic, colorful and concrete, and may offer some new perspectives even to those who are conversant in the technical ideas of this area. (2) Briefly survey some of the key achievements of this area of research so far, and the major themes, such as the equivalency between P-time kernelization and FPT that have emerged. (3) Exposit recent research directions in this area that have attracted substantial new research funding in various countries of the world.
展开▼
