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 o Ranking and unranking
30 o Ranking of permutations
31 o Ranking of k-permutations
32 o Restricted permutations
33 o Hatcheck lady and other derangements
35 . ?? general perspective ??
37 * Dynamic MST algorithms
39 . (Semi-)dynamic algorithms
40 . Sleator-Tarjan trees
42 . Fully dynamic connectivity
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
59 - use the notation for contraction by a set
63 - bit tricks: reference to HAKMEM
64 - mention in-place radix-sorting?
68 - the general perspective: is it only a technical trick?
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
78 - use calligraphic letters from ams?
79 - change the notation for contractions -- use double slash instead of the dot?