YoVDO

Parametrized Algorithms and Possible Future Directions

Offered By: Hausdorff Center for Mathematics via YouTube

Tags

Algorithm Design Courses Theoretical Computer Science Courses Parameterized Complexity Courses

Course Description

Overview

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.

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
IEEE via YouTube Parameterized Complexity of Quantum Invariants of Knots
Applied Algebraic Topology Network via YouTube Sparse Integer Programming Is FPT
Hausdorff Center for Mathematics via YouTube Recent Hardness of Approximation Results in Parameterized Complexity
Hausdorff Center for Mathematics via YouTube Introduction to Parameterized Algorithms and Applications
Hausdorff Center for Mathematics via YouTube