Modules / Lectures
Module NameDownload

Sl.No Chapter Name English
1Basic Graph theory and Graph Algorithms Part-1PDF unavailable
2Basic Graph theory and Graph Algorithms Part-2PDF unavailable
3Basic Graph theory and Graph Algorithms Part-3PDF unavailable
4Basic Graph theory and Graph Algorithms Part-4PDF unavailable
5Basic Graph theory and Graph Algorithms Part-5PDF unavailable
6Geometric Algorithms Part-1PDF unavailable
7Geometric Algorithms Part-2PDF unavailable
8Geometric Algorithms Part-3PDF unavailable
9Geometric Algorithms Part-4PDF unavailable
10Geometric Algorithms Part-5PDF unavailable
11Geometric Algorithms Part-6PDF unavailable
12Introduction to Computational Complexity,P,NP classesPDF unavailable
13NPC Reductions through examples Part-1PDF unavailable
14NPC Reductions through examples Part-2PDF unavailable
15NPC Reductions through examples - 3SATPDF unavailable
16Subset Sum, KnapsackPDF unavailable
17Directed Hamiltonian Path- NPC ReductionPDF unavailable
18Introduction to LPnDuality theoremPDF unavailable
19Design of Approx.algorithms using primal dual scheme - Hitting setPDF unavailable
20Approx Vertex CoverPDF unavailable
21Appox for Min Cost VC, Approx for Min cost Set CoverPDF unavailable
222- factor approx for metric TSP, 1.5 Approx christofides AlgoPDF unavailable
23knapsack Approx, 1/2 - factor Approx, 1- ε Approx: FPTASPDF unavailable
24Perfect graphs,weak & strong perfect graph conjecture,line graphs,interval graphsPDF unavailable
25α perfection of interval graphs,chordal graphs,expansion lemma, proof for weak perfect conjecture ( Part -1 )PDF unavailable
26α perfection of interval graphs,chordal graphs,expansion lemma, proof for weak perfect conjecture ( Part -2 )PDF unavailable
27Comparability graph, Permutation graphs, AT-free graphs, Trapezoidal graphs, Circular arc graphs, Boxicity and related conceptsPDF unavailable
28Fixed Parameter Algorithms, -VC, Cluster vertex deletion, - BranchingPDF unavailable
29Kernelization, -VC, CrownDecomposition, Feedback vertex set, Herative compression , Analysing branching algorithm ( Part -1 )PDF unavailable
30Kernelization, -VC, CrownDecomposition, Feedback vertex set, Herative compression , Analysing branching algorithm ( Part -2 )Kernelization, -VC, CrownDecomposition, Feedback vertex set, Herative compression , Analysing branching algorithm ( Part -2 )PDF unavailable
31Kernelization, -VC, CrownDecomposition, Feedback vertex set, Herative compression , Analysing branching algorithm ( Part -3 )PDF unavailable
32Hardness in Parameterized Complexity - W - hard reductions Exponential algorithms ( Part -1 )PDF unavailable
33Hardness in Parameterized Complexity - W - hard reductions Exponential algorithms ( Part -2 )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