1 * Minimum Spanning Trees
5 o Red/Blue meta-algorithm
7 o Contractive algorithms
9 * Fine Details of Computation
18 * Advanced MST Algorithms
20 o Minor-closed classes
21 o Fredman-Tarjan algorithm
25 . Randomized algorithms
27 * Ranking combinatorial objects
29 . Ranking of permutations: history
30 . Linear-time algorithm
32 . Permutations with no fixed point
35 * Dynamic MST algorithms
37 . (Semi-)dynamic algorithms
38 . Sleator-Tarjan trees
40 . Fully dynamic connectivity
46 - fix proof of the local contraction alg
47 - cite Eisner's tutorial \cite{eisner:tutorial}
48 - \cite{pettie:onlineverify} online lower bound
49 - mention Steiner trees
52 - mention disconnected graphs
54 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
55 - mention in-place radix-sorting?
56 - ranking of permutations on general sets, relationship with integer sorting
57 - reference to mixed Boruvka-Jarnik
58 - bit tricks: reference to HAKMEM
62 - the general perspective: is it only a technical trick?
67 - G has to be connected, so m=O(n)
68 - impedance mismatch in terminology: contraction of G along e vs. contraction of e.
69 - use \delta(X) notation
70 - unify use of n(G) vs. n