Explore current research directions in Parameterized Complexity and discover potential avenues for future investigations in this insightful one-hour talk by Saket Saurabh at the Hausdorff Center for Mathematics. Gain a concise overview of the field's latest developments and learn about promising areas for further research in parametrized algorithms.
Overview
Syllabus
Saket Saurabh: Parametrized Algorithms and possible future directions
Taught by
Hausdorff Center for Mathematics
Related Courses
-
A Parameterized Approximation Scheme for Min k-Cut
-
Introduction to Parameterized Algorithms, Lecture I
-
Michal Pilipczuk: Introduction to Parameterized Algorithms, Lecture II
-
Recent Hardness of Approximation Results in Parameterized Complexity
-
Understanding and Extending the Quasipolynomial Time Algorithms for Parity Games
-
Parameterized Problems Complete for Nondeterministic FPT Time and Logarithmic Space
