Lecture resources

The official public NPTEL index lists 50 lectures in 12 weeks. These pages retain the published lecture titles and direct video links; they are guides to the recordings, not invented lecture transcripts.

• Week 1 · Kernels and fixed-parameter tractability

• Week 2 · Branching and recurrences

• Week 3 · Iterative compression

• Week 4 · Randomization and color coding

• Week 5 · Treewidth and structural decompositions

• Week 6 · Dynamic programming on tree decompositions

• Week 7 · Finding tree decompositions

• Week 8 · Subsets and integer programming

• Week 9 · Important cuts

• Week 10 · Algebraic techniques

• Week 11 · Representative sets in matroids

• Week 12 · Reductions and hardness