Sl.No Chapter Name MP4 Download
1mod01lec01 - Invitation to FPTDownload
2mod01lec02 - Formalizing FPTDownload
3mod01lec03 - Kernelization: High Degree RuleDownload
4mod01lec04 - Kernelization: d-Hitting SetDownload
5mod01lec05 - Kernelization: Crown ReducitonDownload
6mod01lec06 - Kernelization: Nemhauser-Trotter and Expansion LemmaDownload
7mod02lec07 - Introduction to BranchingDownload
8mod02lec08 - Analyzing RecurrencesDownload
9mod02lec09 - High-Degree Branching for FVSDownload
10mod02lec10 - Vertex Cover above LPDownload
11mod02lec11 - Applications of Vertex Cover above MatchingDownload
12mod03lec12 - Iterative Compression I: Setting Up the MethodDownload
13mod03lec13 - Iterative Compression II: Vertex Cover and Tournament Feedback Vertex SetDownload
14mod03lec14 - Iterative Compression III: Feedback Vertex Set and 3-Hitting SetDownload
15mod03lec15 - Iterative Compression IV: Odd Cycle TransversalDownload
16mod04lec16 - Introduction to Randomized Algorithms via a Simple Randomized FPT Algorithm for FVSDownload
17mod04lec17 - Color Coding for Longest PathDownload
18mod04lec18 - Chromatic Coding for Feedback Arc Set on TournamentsDownload
19mod04lec19 - Random Separation and Subgraph IsomorphismDownload
20mod04lec20 - DerandomizationDownload
21mod05lec21 - Divide and Conquer and SeparatorDownload
22mod05lec22 - Towards Defining TreewidthDownload
23mod05lec23 - Treewidth and Constructing Treedecomposition of Few Graph ClassesDownload
24mod05lec24 - Structural Properties of Treedecomposition and Win-WinDownload

Sl.No Chapter Name English
1mod01lec01 - Invitation to FPTPDF unavailable
2mod01lec02 - Formalizing FPTPDF unavailable
3mod01lec03 - Kernelization: High Degree RulePDF unavailable
4mod01lec04 - Kernelization: d-Hitting SetPDF unavailable
5mod01lec05 - Kernelization: Crown ReducitonPDF unavailable
6mod01lec06 - Kernelization: Nemhauser-Trotter and Expansion LemmaPDF unavailable
7mod02lec07 - Introduction to BranchingPDF unavailable
8mod02lec08 - Analyzing RecurrencesPDF unavailable
9mod02lec09 - High-Degree Branching for FVSPDF unavailable
10mod02lec10 - Vertex Cover above LPPDF unavailable
11mod02lec11 - Applications of Vertex Cover above MatchingPDF unavailable
12mod03lec12 - Iterative Compression I: Setting Up the MethodPDF unavailable
13mod03lec13 - Iterative Compression II: Vertex Cover and Tournament Feedback Vertex SetPDF unavailable
14mod03lec14 - Iterative Compression III: Feedback Vertex Set and 3-Hitting SetPDF unavailable
15mod03lec15 - Iterative Compression IV: Odd Cycle TransversalPDF unavailable
16mod04lec16 - Introduction to Randomized Algorithms via a Simple Randomized FPT Algorithm for FVSPDF unavailable
17mod04lec17 - Color Coding for Longest PathPDF unavailable
18mod04lec18 - Chromatic Coding for Feedback Arc Set on TournamentsPDF unavailable
19mod04lec19 - Random Separation and Subgraph IsomorphismPDF unavailable
20mod04lec20 - DerandomizationPDF unavailable
21mod05lec21 - Divide and Conquer and SeparatorPDF unavailable
22mod05lec22 - Towards Defining TreewidthPDF unavailable
23mod05lec23 - Treewidth and Constructing Treedecomposition of Few Graph ClassesPDF unavailable
24mod05lec24 - Structural Properties of Treedecomposition and Win-WinPDF unavailable


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available