Title: A brief introduction to parameterized algorithms

Abstract: Parameterized complexity is a multivariate view on algorithm design, where we measure the running times of algorithms not only in the total input size, but also in terms of auxiliary quantitative measures of the instance, called parameters. We will give a brief introduction into the basic toolbox of parameterized algorithms.

Michał Pilipczuk is an associate professor at the Institute of Informatics of the University of Warsaw, where he has been working since 2014 after PhD studies at the University of Bergen in Norway. His research revolves around parameterized algorithms, structural graph theory, and, more recently, algorithmic aspects of finite model theory. In 2021 he was awarded ERC Starting Grant BOBR, devoted to the study of decompositional methods for algorithmic problems in discrete structures.