FPT approximation by Saket Saurabh

Invitation to FPT Approximation via Cut and Coverage ProblemsПодробнее

Lecture:5, Polynomial time Algebraic Algorithms, Speaker: Prof Saket SaurabhПодробнее

Lecture-22, FPT Approximation, Speaker: Prof Saket SaurabhПодробнее

Lecture-16, Approximation-II, Speaker: Prof Saket SaurabhПодробнее

Flow of Research in FPT | Saket Saurabh | Parameterized Complexity WorkshopПодробнее

Open Problems | Saket Saurabh | Parameterized Complexity WorkshopПодробнее

Unbreakable Decomposition and Applications - I | Saket Saurabh | Parameterized Complexity WorkshopПодробнее

Unbreakable Decomposition and Applications - II | Saket Saurabh | Parameterized Complexity WorkshopПодробнее

Approximation in Read-only memory by Saket SaurabhПодробнее

A Parameterized Approximation Scheme for Min k-CutПодробнее

Lossy KernelizationПодробнее