| 1 | Lec01 - Introduction to Graph Theory - Part 1 | PDF unavailable |
| 2 | Lec01 - Introduction to Graph Theory - Part 2 | PDF unavailable |
| 3 | Lec02 - Introduction to Graph Algorithms - Part 1 | PDF unavailable |
| 4 | Lec02 - Introduction to Graph Algorithms - Part 2 | PDF unavailable |
| 5 | Lec03 - Havel Hakimi Theorem - Part 1 | PDF unavailable |
| 6 | Lec03 - Havel Hakimi Theorem - Part 2 | PDF unavailable |
| 7 | Lec03 - Havel Hakimi Theorem - Part 3 | PDF unavailable |
| 8 | Lec04 - Graph Traversals - Part 1 | PDF unavailable |
| 9 | Lec04 - Graph Traversals - Part 2 | PDF unavailable |
| 10 | Lec05 - Topological Sort and Mengers Theorem - Part 1 | PDF unavailable |
| 11 | Lec05 - Topological Sort and Mengers Theorem - Part 2 | PDF unavailable |
| 12 | Lec05 - Topological Sort and Mengers Theorem - Part 3 | PDF unavailable |
| 13 | Lec06 - Hamiltonian Graphs - Part 1 | PDF unavailable |
| 14 | Lec06 - Hamiltonian Graphs - Part 2 | PDF unavailable |
| 15 | Lec07 - Shortest path Algorithms- 1 - Part 1 | PDF unavailable |
| 16 | Lec07 - Shortest path Algorithms- 1 - Part 2 | PDF unavailable |
| 17 | Lec07 - Shortest path Algorithms- 1 - Part 3 | PDF unavailable |
| 18 | Lec07 - Shortest path Algorithms- 1 - Part 4 | PDF unavailable |
| 19 | Lec08 - Matching in Graphs - Part 1 | PDF unavailable |
| 20 | Lec08 - Matching in Graphs - Part 2 | PDF unavailable |
| 21 | Lec09 - Some Graph Theoretic Puzzles - Part 1 | PDF unavailable |
| 22 | Lec09 - Some Graph Theoretic Puzzles - Part 2 | PDF unavailable |
| 23 | Lec10 - Network Flow Algorithms - Part 1 | PDF unavailable |
| 24 | Lec10 - Network Flow Algorithms - Part 2 | PDF unavailable |
| 25 | Lec10 - Network Flow Algorithms - Part 3 | PDF unavailable |
| 26 | Lec10 - Network Flow Algorithms - Part 4 | PDF unavailable |
| 27 | Lec10 - Network Flow Algorithms - Part 5 | PDF unavailable |
| 28 | Lec10 - Network Flow Algorithms - Part 6 | PDF unavailable |
| 29 | Lec11 - Network Flows - Part 1 | PDF unavailable |
| 30 | Lec11 - Network Flows - Part 2 | PDF unavailable |
| 31 | Lec11 - Network Flows - Part 3 | PDF unavailable |
| 32 | Lec11 - Network Flows - Part 4 | PDF unavailable |
| 33 | Lec12 - Turan’s and Madrur’s theorem - Part 1 | PDF unavailable |
| 34 | Lec12 - Turan’s and Madrur’s theorem - Part 2 | PDF unavailable |
| 35 | Lec13 - NP Computations - Part 1 | PDF unavailable |
| 36 | Lec13 - NP Computations - Part 2 | PDF unavailable |
| 37 | Lec14 - Spectral Graph Theory - I - Part 1 | PDF unavailable |
| 38 | Lec14 - Spectral Graph Theory - I - Part 2 | PDF unavailable |
| 39 | NP Computations II - Part 1 | PDF unavailable |
| 40 | NP Computations II - Part 2 | PDF unavailable |
| 41 | Graph Coloring - Part 1 | PDF unavailable |
| 42 | Graph Coloring - Part 2 | PDF unavailable |
| 43 | Spectral Graph Theory - II - Part 1 | PDF unavailable |
| 44 | Spectral Graph Theory - II - Part 2 | PDF unavailable |
| 45 | NP Computations Reductions - Part 1 | PDF unavailable |
| 46 | NP Computations Reductions - Part 2 | PDF unavailable |
| 47 | NP Computations Reductions - Part 3 | PDF unavailable |
| 48 | Spectral Graph Theory - III - Part 1 | PDF unavailable |
| 49 | Spectral Graph Theory - III - Part 2 | PDF unavailable |
| 50 | Planar Graphs - Part 1 | PDF unavailable |
| 51 | Planar Graphs - Part 2 | PDF unavailable |
| 52 | NP Computations & Approximation Algorithms - Part 1 | PDF unavailable |
| 53 | NP Computations & Approximation Algorithms - Part 2 | PDF unavailable |
| 54 | Spectral Graph Theory - IV - Part 1 | PDF unavailable |
| 55 | Spectral Graph Theory - IV - Part 2 | PDF unavailable |
| 56 | Approximation Algorithms I - Part 1 | PDF unavailable |
| 57 | Approximation Algorithms I - Part 2 | PDF unavailable |
| 58 | Social Network Analysis - Part 1 | PDF unavailable |
| 59 | Social Network Analysis - Part 2 | PDF unavailable |
| 60 | Spectral Graph Theory -V - part 1 | PDF unavailable |
| 61 | Spectral Graph Theory -V - part 2 | PDF unavailable |
| 62 | Approximation Algorithms II - part 1 | PDF unavailable |
| 63 | Approximation Algorithms II - part 2 | PDF unavailable |
| 64 | Spectral Graph Theory - VI - Part 1 | PDF unavailable |
| 65 | Spectral Graph Theory - VI - Part 2 | PDF unavailable |
| 66 | RSA Crypto - part 1 | PDF unavailable |
| 67 | RSA Crypto - part 2 | PDF unavailable |
| 68 | Approximation Algorithms III - part 1 | PDF unavailable |
| 69 | Approximation Algorithms III - part 2 | PDF unavailable |
| 70 | Spectral Graph Theory - VII - part 1 | PDF unavailable |
| 71 | Spectral Graph Theory - VII- part 2 | PDF unavailable |
| 72 | Exact Exponential Algorithms - part 1 | PDF unavailable |
| 73 | Exact Exponential Algorithms - part 2 | PDF unavailable |
| 74 | Interconnection Networks - part 1 | PDF unavailable |
| 75 | Interconnection Networks - part 2 | PDF unavailable |
| 76 | Kernelization - Part 1 | PDF unavailable |
| 77 | Kernelization - Part 2 | PDF unavailable |
| 78 | Kernelization - Part 3 | PDF unavailable |
| 79 | Introduction to Parameterized Algorithms - Part 1 | PDF unavailable |
| 80 | Introduction to Parameterized Algorithms - Part 2 | PDF unavailable |
| 81 | Chardal Graphs - part 1 | PDF unavailable |
| 82 | Chardal Graphs - part 2 | PDF unavailable |
| 83 | Branching - part 1 | PDF unavailable |
| 84 | Branching - part 2 | PDF unavailable |
| 85 | Interval Graphs and Split Graphs - part 1 | PDF unavailable |
| 86 | Interval Graphs and Split Graphs - part 2 | PDF unavailable |
| 87 | Vertex cover linear vertex kernel using LP - part 1 | PDF unavailable |
| 88 | Vertex cover linear vertex kernel using LP - part 2 | PDF unavailable |
| 89 | Comparability Graphs - part 1 | PDF unavailable |
| 90 | Comparability Graphs - part 2 | PDF unavailable |
| 91 | Introduction to Randomized Algorithms and Karger's Min-cut Algorithm - part 1 | PDF unavailable |
| 92 | Introduction to Randomized Algorithms and Karger's Min-cut Algorithm - part 2 | PDF unavailable |
| 93 | Probability Methods to Ramsey Number - Part 1 | PDF unavailable |
| 94 | Probability Methods to Ramsey Number - Part 2 | PDF unavailable |
| 95 | Color Coding - part 1 | PDF unavailable |
| 96 | Color Coding - part 2 | PDF unavailable |
| 97 | Fast Min-cut Algorithm and its analysis - part 1 | PDF unavailable |
| 98 | Fast Min-cut Algorithm and its analysis - part 2 | PDF unavailable |
| 99 | Box Representations of Graphs - part 1 | PDF unavailable |
| 100 | Box Representations of Graphs - part 2 | PDF unavailable |
| 101 | Hardness for FPT - part 1 | PDF unavailable |
| 102 | Hardness for FPT - part 2 | PDF unavailable |
| 103 | Application of min-cut Algorithm | PDF unavailable |