1 * Minimum Spanning Trees
5 o Red/Blue meta-algorithm
7 o Contractive algorithms
9 * Fine Details of Computation
16 * Advanced MST Algorithms
18 o Minor-closed classes
19 o Fredman-Tarjan algorithm
21 . Randomized algorithms
25 * Ranking combinatorial objects
27 o Ranking and unranking
28 o Ranking of permutations
29 o Ranking of k-permutations
30 o Restricted permutations
31 o Hatcheck lady and other derangements
33 . ?? general perspective ??
35 * Dynamic MST algorithms
37 . (Semi-)dynamic algorithms
38 . Sleator-Tarjan trees
40 . Fully dynamic connectivity
48 - cite Eisner's tutorial \cite{eisner:tutorial}
49 - \cite{pettie:onlineverify} online lower bound
50 - mention Steiner trees
53 - mention disconnected graphs
55 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
56 - reference to mixed Boruvka-Jarnik
57 - use the notation for contraction by a set
58 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
59 - parallel algorithms: p243-cole (are there others?)
63 - bit tricks: reference to HAKMEM
64 - mention in-place radix-sorting?
65 - consequences of Q-Heaps: Thorup's undirected SSSP etc.
66 - refs on Cartesian trees
68 - iteration of Q-Heaps
72 - the general perspective: is it only a technical trick?
73 - ranking of permutations on general sets, relationship with integer sorting
78 - G has to be connected, so m=O(n)
79 - impedance mismatch in terminology: contraction of G along e vs. contraction of e.
80 - use \delta(X) notation
81 - unify use of n(G) vs. n
82 - use calligraphic letters from ams?
83 - change the notation for contractions -- use double slash instead of the dot?