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
48 - prove the density bound
49 - fix proof of the local contraction alg
50 - cite Eisner's tutorial \cite{eisner:tutorial}
51 - \cite{pettie:onlineverify} online lower bound
52 - mention Steiner trees
55 - mention disconnected graphs
57 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
58 - reference to mixed Boruvka-Jarnik
62 - bit tricks: reference to HAKMEM
63 - mention in-place radix-sorting?
67 - the general perspective: is it only a technical trick?
68 - move description of the ranking set to the chapter on models?
69 - ranking of permutations on general sets, relationship with integer sorting
74 - G has to be connected, so m=O(n)
75 - impedance mismatch in terminology: contraction of G along e vs. contraction of e.
76 - use \delta(X) notation
77 - unify use of n(G) vs. n