| 1 | Basic Graph theory and Graph Algorithms Part-1 | PDF unavailable |
| 2 | Basic Graph theory and Graph Algorithms Part-2 | PDF unavailable |
| 3 | Basic Graph theory and Graph Algorithms Part-3 | PDF unavailable |
| 4 | Basic Graph theory and Graph Algorithms Part-4 | PDF unavailable |
| 5 | Basic Graph theory and Graph Algorithms Part-5 | PDF unavailable |
| 6 | Geometric Algorithms Part-1 | PDF unavailable |
| 7 | Geometric Algorithms Part-2 | PDF unavailable |
| 8 | Geometric Algorithms Part-3 | PDF unavailable |
| 9 | Geometric Algorithms Part-4 | PDF unavailable |
| 10 | Geometric Algorithms Part-5 | PDF unavailable |
| 11 | Geometric Algorithms Part-6 | PDF unavailable |
| 12 | Introduction to Computational Complexity,P,NP classes | PDF unavailable |
| 13 | NPC Reductions through examples Part-1 | PDF unavailable |
| 14 | NPC Reductions through examples Part-2 | PDF unavailable |
| 15 | NPC Reductions through examples - 3SAT | PDF unavailable |
| 16 | Subset Sum, Knapsack | PDF unavailable |
| 17 | Directed Hamiltonian Path- NPC Reduction | PDF unavailable |
| 18 | Introduction to LPnDuality theorem | PDF unavailable |
| 19 | Design of Approx.algorithms using primal dual scheme - Hitting set | PDF unavailable |
| 20 | Approx Vertex Cover | PDF unavailable |
| 21 | Appox for Min Cost VC, Approx for Min cost Set Cover | PDF unavailable |
| 22 | 2- factor approx for metric TSP, 1.5 Approx christofides Algo | PDF unavailable |
| 23 | knapsack Approx, 1/2 - factor Approx, 1- ε Approx: FPTAS | PDF unavailable |
| 24 | Perfect graphs,weak & strong perfect graph conjecture,line graphs,interval graphs | PDF 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 |
| 27 | Comparability graph, Permutation graphs, AT-free graphs, Trapezoidal graphs, Circular arc graphs, Boxicity and related concepts | PDF unavailable |
| 28 | Fixed Parameter Algorithms, -VC, Cluster vertex deletion, - Branching | PDF unavailable |
| 29 | Kernelization, -VC, CrownDecomposition, Feedback vertex set, Herative compression , Analysing branching algorithm ( Part -1 ) | PDF unavailable |
| 30 | Kernelization, -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 |
| 31 | Kernelization, -VC, CrownDecomposition, Feedback vertex set, Herative compression , Analysing branching algorithm ( Part -3 ) | PDF unavailable |
| 32 | Hardness in Parameterized Complexity - W - hard reductions Exponential algorithms ( Part -1 ) | PDF unavailable |
| 33 | Hardness in Parameterized Complexity - W - hard reductions Exponential algorithms ( Part -2 ) | PDF unavailable |