| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | mod01lec01 - Invitation to FPT | Download |
| 2 | mod01lec02 - Formalizing FPT | Download |
| 3 | mod01lec03 - Kernelization: High Degree Rule | Download |
| 4 | mod01lec04 - Kernelization: d-Hitting Set | Download |
| 5 | mod01lec05 - Kernelization: Crown Reduciton | Download |
| 6 | mod01lec06 - Kernelization: Nemhauser-Trotter and Expansion Lemma | Download |
| 7 | mod02lec07 - Introduction to Branching | Download |
| 8 | mod02lec08 - Analyzing Recurrences | Download |
| 9 | mod02lec09 - High-Degree Branching for FVS | Download |
| 10 | mod02lec10 - Vertex Cover above LP | Download |
| 11 | mod02lec11 - Applications of Vertex Cover above Matching | Download |
| 12 | mod03lec12 - Iterative Compression I: Setting Up the Method | Download |
| 13 | mod03lec13 - Iterative Compression II: Vertex Cover and Tournament Feedback Vertex Set | Download |
| 14 | mod03lec14 - Iterative Compression III: Feedback Vertex Set and 3-Hitting Set | Download |
| 15 | mod03lec15 - Iterative Compression IV: Odd Cycle Transversal | Download |
| 16 | mod04lec16 - Introduction to Randomized Algorithms via a Simple Randomized FPT Algorithm for FVS | Download |
| 17 | mod04lec17 - Color Coding for Longest Path | Download |
| 18 | mod04lec18 - Chromatic Coding for Feedback Arc Set on Tournaments | Download |
| 19 | mod04lec19 - Random Separation and Subgraph Isomorphism | Download |
| 20 | mod04lec20 - Derandomization | Download |
| 21 | mod05lec21 - Divide and Conquer and Separator | Download |
| 22 | mod05lec22 - Towards Defining Treewidth | Download |
| 23 | mod05lec23 - Treewidth and Constructing Treedecomposition of Few Graph Classes | Download |
| 24 | mod05lec24 - Structural Properties of Treedecomposition and Win-Win | Download |
| 25 | mod06lec25 - Nice Tree Decomposition and Algorithm for Max Weight Independent Set | Download |
| 26 | mod06lec26 - Dynamic Programming Algorithm over graphs of Bounded Treewidth | Download |
| 27 | mod06lec27 - FPT Appproximation Algorithm for Computing Tree Decomposition - Part 01 | Download |
| 28 | mod06lec28 - FPT Appproximation Algorithm for Computing Tree Decomposition - Part 02 | Download |
| 29 | mod06lec29 - FPT Appproximation Algorithm for Computing Tree Decomposition and Applications -Part 01 | Download |
| 30 | mod06lec30 - FPT Appproximation Algorithm for Computing Tree Decomposition and Applications -Part 02 | Download |
| 31 | mod07lec31 - Dynamic Programming Over Subsets for Set Cover | Download |
| 32 | mod07lec32 - Dynamic Programming Over Subsets for Steiner Tree | Download |
| 33 | mod07lec33 - ILP for Envy-Free Allocations and Lobbying | Download |
| 34 | mod07lec34 - ILP for Imbalance Parameterized by Vertex Cover | Download |
| 35 | mod08lec35 - Important Cuts: Basic | Download |
| 36 | mod08lec36 - Important Cuts: Enumeration and Bounds | Download |
| 37 | mod08lec37 - FPT Algorithm for Multiway Cut | Download |
| 38 | mod08lec38 - FPT Algorithm for Directed Feedback Edge Set | Download |
| 39 | mod10lec39 - Algebraic Techniques: Inclusion Exclusion (Coloring) | Download |
| 40 | mod10lec40 - Algebraic Techniques: Inclusion Exclusion (Hamiltonian Path) | Download |
| 41 | mod10lec41 - Algebraic Techniques: Matrix Multiplication | Download |
| 42 | mod10lec42 - Algebraic Techniques: Polynomial Method | Download |
| 43 | mod11lec43 - Matroids: Representative Sets | Download |
| 44 | mod11lec44 - Matroids: Representative Sets - Computation and Combinatorics | Download |
| 45 | mod11lec45 - Matroids: Representative Sets - Applications (Paths and Kernels) | Download |
| 46 | mod11lec46 - Matroids: Representative Sets -- Applications (Directed Long Cycle) | Download |
| 47 | mod12lec47 - Reductions - An Introduction | Download |
| 48 | mod12lec48 - Reductions --- Problems as Hard as Clique I (Clique on Regular Graphs) | Download |
| 49 | mod12lec49 - Reductions --- Problems as Hard as Clique (PVC, MCC, MIS) | Download |
| 50 | mod12lec50 - Reductions --- Problems as Hard as Clique (Dominating Set, Set Cover) | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | mod01lec01 - Invitation to FPT | PDF unavailable |
| 2 | mod01lec02 - Formalizing FPT | PDF unavailable |
| 3 | mod01lec03 - Kernelization: High Degree Rule | PDF unavailable |
| 4 | mod01lec04 - Kernelization: d-Hitting Set | PDF unavailable |
| 5 | mod01lec05 - Kernelization: Crown Reduciton | PDF unavailable |
| 6 | mod01lec06 - Kernelization: Nemhauser-Trotter and Expansion Lemma | PDF unavailable |
| 7 | mod02lec07 - Introduction to Branching | PDF unavailable |
| 8 | mod02lec08 - Analyzing Recurrences | PDF unavailable |
| 9 | mod02lec09 - High-Degree Branching for FVS | PDF unavailable |
| 10 | mod02lec10 - Vertex Cover above LP | PDF unavailable |
| 11 | mod02lec11 - Applications of Vertex Cover above Matching | PDF unavailable |
| 12 | mod03lec12 - Iterative Compression I: Setting Up the Method | PDF unavailable |
| 13 | mod03lec13 - Iterative Compression II: Vertex Cover and Tournament Feedback Vertex Set | PDF unavailable |
| 14 | mod03lec14 - Iterative Compression III: Feedback Vertex Set and 3-Hitting Set | PDF unavailable |
| 15 | mod03lec15 - Iterative Compression IV: Odd Cycle Transversal | PDF unavailable |
| 16 | mod04lec16 - Introduction to Randomized Algorithms via a Simple Randomized FPT Algorithm for FVS | PDF unavailable |
| 17 | mod04lec17 - Color Coding for Longest Path | PDF unavailable |
| 18 | mod04lec18 - Chromatic Coding for Feedback Arc Set on Tournaments | PDF unavailable |
| 19 | mod04lec19 - Random Separation and Subgraph Isomorphism | PDF unavailable |
| 20 | mod04lec20 - Derandomization | PDF unavailable |
| 21 | mod05lec21 - Divide and Conquer and Separator | PDF unavailable |
| 22 | mod05lec22 - Towards Defining Treewidth | PDF unavailable |
| 23 | mod05lec23 - Treewidth and Constructing Treedecomposition of Few Graph Classes | PDF unavailable |
| 24 | mod05lec24 - Structural Properties of Treedecomposition and Win-Win | PDF unavailable |
| 25 | mod06lec25 - Nice Tree Decomposition and Algorithm for Max Weight Independent Set | PDF unavailable |
| 26 | mod06lec26 - Dynamic Programming Algorithm over graphs of Bounded Treewidth | PDF unavailable |
| 27 | mod06lec27 - FPT Appproximation Algorithm for Computing Tree Decomposition - Part 01 | PDF unavailable |
| 28 | mod06lec28 - FPT Appproximation Algorithm for Computing Tree Decomposition - Part 02 | PDF unavailable |
| 29 | mod06lec29 - FPT Appproximation Algorithm for Computing Tree Decomposition and Applications -Part 01 | PDF unavailable |
| 30 | mod06lec30 - FPT Appproximation Algorithm for Computing Tree Decomposition and Applications -Part 02 | PDF unavailable |
| 31 | mod07lec31 - Dynamic Programming Over Subsets for Set Cover | PDF unavailable |
| 32 | mod07lec32 - Dynamic Programming Over Subsets for Steiner Tree | PDF unavailable |
| 33 | mod07lec33 - ILP for Envy-Free Allocations and Lobbying | PDF unavailable |
| 34 | mod07lec34 - ILP for Imbalance Parameterized by Vertex Cover | PDF unavailable |
| 35 | mod08lec35 - Important Cuts: Basic | PDF unavailable |
| 36 | mod08lec36 - Important Cuts: Enumeration and Bounds | PDF unavailable |
| 37 | mod08lec37 - FPT Algorithm for Multiway Cut | PDF unavailable |
| 38 | mod08lec38 - FPT Algorithm for Directed Feedback Edge Set | PDF unavailable |
| 39 | mod10lec39 - Algebraic Techniques: Inclusion Exclusion (Coloring) | PDF unavailable |
| 40 | mod10lec40 - Algebraic Techniques: Inclusion Exclusion (Hamiltonian Path) | PDF unavailable |
| 41 | mod10lec41 - Algebraic Techniques: Matrix Multiplication | PDF unavailable |
| 42 | mod10lec42 - Algebraic Techniques: Polynomial Method | PDF unavailable |
| 43 | mod11lec43 - Matroids: Representative Sets | PDF unavailable |
| 44 | mod11lec44 - Matroids: Representative Sets - Computation and Combinatorics | PDF unavailable |
| 45 | mod11lec45 - Matroids: Representative Sets - Applications (Paths and Kernels) | PDF unavailable |
| 46 | mod11lec46 - Matroids: Representative Sets -- Applications (Directed Long Cycle) | PDF unavailable |
| 47 | mod12lec47 - Reductions - An Introduction | PDF unavailable |
| 48 | mod12lec48 - Reductions --- Problems as Hard as Clique I (Clique on Regular Graphs) | PDF unavailable |
| 49 | mod12lec49 - Reductions --- Problems as Hard as Clique (PVC, MCC, MIS) | PDF unavailable |
| 50 | mod12lec50 - Reductions --- Problems as Hard as Clique (Dominating Set, Set Cover) | PDF unavailable |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |