The final sequence introduces parameterized reductions and problems connected to the hardness of Clique.LecturesReductions --- An IntroductionReductions --- Problems as Hard as Clique I (Clique on Regular Graphs)Reductions --- Problems as Hard as Clique (PVC, MCC, MIS)Reductions --- Problems as Hard as Clique (Dominating Set, Set Cover)Official NPTEL lecture index