Modules / Lectures
Module NameDownload
noc21_cs92_assignment_Week_0noc21_cs92_assignment_Week_0
noc21_cs92_assignment_Week_1noc21_cs92_assignment_Week_1
noc21_cs92_assignment_Week_10noc21_cs92_assignment_Week_10
noc21_cs92_assignment_Week_2noc21_cs92_assignment_Week_2
noc21_cs92_assignment_Week_3noc21_cs92_assignment_Week_3
noc21_cs92_assignment_Week_4noc21_cs92_assignment_Week_4
noc21_cs92_assignment_Week_5noc21_cs92_assignment_Week_5
noc21_cs92_assignment_Week_6noc21_cs92_assignment_Week_6
noc21_cs92_assignment_Week_7noc21_cs92_assignment_Week_7
noc21_cs92_assignment_Week_8noc21_cs92_assignment_Week_8
noc21_cs92_assignment_Week_9noc21_cs92_assignment_Week_9


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
25mod06lec25 - Nice Tree Decomposition and Algorithm for Max Weight Independent SetDownload
26mod06lec26 - Dynamic Programming Algorithm over graphs of Bounded TreewidthDownload
27mod06lec27 - FPT Appproximation Algorithm for Computing Tree Decomposition - Part 01Download
28mod06lec28 - FPT Appproximation Algorithm for Computing Tree Decomposition - Part 02Download
29mod06lec29 - FPT Appproximation Algorithm for Computing Tree Decomposition and Applications -Part 01Download
30mod06lec30 - FPT Appproximation Algorithm for Computing Tree Decomposition and Applications -Part 02Download
31mod07lec31 - Dynamic Programming Over Subsets for Set CoverDownload
32mod07lec32 - Dynamic Programming Over Subsets for Steiner TreeDownload
33mod07lec33 - ILP for Envy-Free Allocations and LobbyingDownload
34mod07lec34 - ILP for Imbalance Parameterized by Vertex CoverDownload
35mod08lec35 - Important Cuts: BasicDownload
36mod08lec36 - Important Cuts: Enumeration and BoundsDownload
37mod08lec37 - FPT Algorithm for Multiway CutDownload
38mod08lec38 - FPT Algorithm for Directed Feedback Edge SetDownload
39mod10lec39 - Algebraic Techniques: Inclusion Exclusion (Coloring)Download
40mod10lec40 - Algebraic Techniques: Inclusion Exclusion (Hamiltonian Path)Download
41mod10lec41 - Algebraic Techniques: Matrix MultiplicationDownload
42mod10lec42 - Algebraic Techniques: Polynomial MethodDownload
43mod11lec43 - Matroids: Representative SetsDownload
44mod11lec44 - Matroids: Representative Sets - Computation and CombinatoricsDownload
45mod11lec45 - Matroids: Representative Sets - Applications (Paths and Kernels)Download
46mod11lec46 - Matroids: Representative Sets -- Applications (Directed Long Cycle)Download
47mod12lec47 - Reductions - An IntroductionDownload
48mod12lec48 - Reductions --- Problems as Hard as Clique I (Clique on Regular Graphs)Download
49mod12lec49 - Reductions --- Problems as Hard as Clique (PVC, MCC, MIS)Download
50mod12lec50 - Reductions --- Problems as Hard as Clique (Dominating Set, Set Cover)Download

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
25mod06lec25 - Nice Tree Decomposition and Algorithm for Max Weight Independent SetPDF unavailable
26mod06lec26 - Dynamic Programming Algorithm over graphs of Bounded TreewidthPDF unavailable
27mod06lec27 - FPT Appproximation Algorithm for Computing Tree Decomposition - Part 01PDF unavailable
28mod06lec28 - FPT Appproximation Algorithm for Computing Tree Decomposition - Part 02PDF unavailable
29mod06lec29 - FPT Appproximation Algorithm for Computing Tree Decomposition and Applications -Part 01PDF unavailable
30mod06lec30 - FPT Appproximation Algorithm for Computing Tree Decomposition and Applications -Part 02PDF unavailable
31mod07lec31 - Dynamic Programming Over Subsets for Set CoverPDF unavailable
32mod07lec32 - Dynamic Programming Over Subsets for Steiner TreePDF unavailable
33mod07lec33 - ILP for Envy-Free Allocations and LobbyingPDF unavailable
34mod07lec34 - ILP for Imbalance Parameterized by Vertex CoverPDF unavailable
35mod08lec35 - Important Cuts: BasicPDF unavailable
36mod08lec36 - Important Cuts: Enumeration and BoundsPDF unavailable
37mod08lec37 - FPT Algorithm for Multiway CutPDF unavailable
38mod08lec38 - FPT Algorithm for Directed Feedback Edge SetPDF unavailable
39mod10lec39 - Algebraic Techniques: Inclusion Exclusion (Coloring)PDF unavailable
40mod10lec40 - Algebraic Techniques: Inclusion Exclusion (Hamiltonian Path)PDF unavailable
41mod10lec41 - Algebraic Techniques: Matrix MultiplicationPDF unavailable
42mod10lec42 - Algebraic Techniques: Polynomial MethodPDF unavailable
43mod11lec43 - Matroids: Representative SetsPDF unavailable
44mod11lec44 - Matroids: Representative Sets - Computation and CombinatoricsPDF unavailable
45mod11lec45 - Matroids: Representative Sets - Applications (Paths and Kernels)PDF unavailable
46mod11lec46 - Matroids: Representative Sets -- Applications (Directed Long Cycle)PDF unavailable
47mod12lec47 - Reductions - An IntroductionPDF unavailable
48mod12lec48 - Reductions --- Problems as Hard as Clique I (Clique on Regular Graphs)PDF unavailable
49mod12lec49 - Reductions --- Problems as Hard as Clique (PVC, MCC, MIS)PDF unavailable
50mod12lec50 - Reductions --- Problems as Hard as Clique (Dominating Set, Set Cover)PDF unavailable


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