January 5, Wednesday
12:00 – 13:30
A (biased) Overview of Parameterized Complexity
Computer Science seminar
Lecturer : Danny Hermelin
Affiliation : Max-Plank Institute for Informatics, Germany
Location : 202/37
Host : Dr. Michal Ziv-Ukelson
In this talk I will give an overview of the field of
parameterized complexity. This is a relatively new and rapidly developing
branch in theoretical computer science that provides a framework for
coping with hard computational problems. The overview will be influenced
by my research on this topic in recent years. I will start with general
motivation, and attempt to describe the main focus of research in the
area. I will then review some of my own work, and explain how its related
to the general interests of the field. The talk will be in most of its
parts non-technical, and is intended for a general computer scientist
audience.