1. Shortest Paths and Trees (Chapter 1 of Schrijver)
2. Polytopes, Polyhedra, Farkas Lemma and Linear Programming (Chapter 2 of
Schrijver)
3. Matchings and Covers in Bipartite Graphs (Chapter 3 of Schrijver)
4. Flows and Circulations, Menger's Theorem (Chapter 4 of Schrijver)
5. Non-bipartite Matching (Chapter 5 of Schrijver)
6. Multicommodity Flows (Chapter 9 of Schrijver)
7. Other topics as time permits.