a. FR-Dijkstra summary
b. O(n log log n) minimum cut overview
c. Technical details 
d. Planar maximum flow history
e. Venkatesan's duality between flows and shortest paths
f. Parametric shortest paths
g. Tree-cotree strikes again
h. Algorithm overview
i. Winding numbers and universal cover
j. O(n) pivots via tree-disk lemma