- Approximation algorithms for Vertex Cover and Metric Steiner Tree
- Approximation of General Steiner Tree
- Versions of the Traveling Salesman Problem. Eulerian loops.
- 1.5-approximate Algorithm for Metric TSP. The Set Cover Problem.
- Introduction to Linear Programming
- Linear Programming Duality
- Linear Programming Relaxation of Vertex Cover
- Linear Programming Relaxation of Set Cover
- The Maximum Flow - Minimum Cut Theorem
- Maximum Flow Algorithms: Choosing the Fattest Augmenting Path
- Edmonds-Karp and Push-Relabel Algorithms
- Analysis of the Push-Relabel Algorithm
- Algorithms for the Global Min-Cut Problem
- Algorithms for Maximum Matching and Vertex Cover in Bipartite Graphs
- The Linear Programming Formulation of Maximum Cut and its Dual
- Multi-commodity Flows and the Sparsest Cut Problem
- Introduction to Online Algorithms
- Using Expert Advice