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 o Linear-time verification
22 o A randomized algorithm
23 o Special cases and related problems
25 * Approaching Optimality
30 o An optimal algorithm
32 * Dynamic MST algorithms
34 o (Semi-)dynamic algorithms
36 o Fully dynamic connectivity
39 * Ranking Combinatorial Objects
41 o Ranking and unranking
42 o Ranking of permutations
43 o Ranking of k-permutations
44 o Restricted permutations
45 o Hatcheck lady and other derangements
47 . ?? general perspective ??
53 - move TOC to the beginning of the book
58 - cite Eisner's tutorial \cite{eisner:tutorial}
59 - move the remark on disconnected graphs? separate section?
60 - mention graphs with non-unique weights? also in the separate section?
61 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
62 - citation of mixed Boruvka-Jarnik
63 - use the notation for contraction by a set
64 - mention bugs in Valeria's verification paper
65 - more references on decision trees
66 - introduce Cut rule and Cycle rule earlier
67 - Lemma: deletion of a non-MST edge does not alter the MST
70 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
71 - parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel
73 - degree-restricted cases and arborescences
74 - bounded expansion classes?
79 - the general perspective: is it only a technical trick?
80 - ranking of permutations on general sets, relationship with integer sorting
81 - JN: explain approx scheme
82 - JN: 4.5.1: neslo by preci isolovat nejaky vlstnosti restriction matrices
83 tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
84 co je to vlastne za matice co splnuji 4.5.2
85 - JN: bounded-degree restriction graphs; would it imply general speedup?
90 - G has to be connected, so m=O(n)
91 - impedance mismatch in terminology: contraction of G along e vs. contraction of e.
92 - use \delta(X) notation
93 - unify use of n(G) vs. n
94 - change the notation for contractions -- use double slash instead of the dot?
95 - introduce \widehat\O early
99 - formatting of multi-line \algin, \algout
100 - use calligraphic letters from ams?
104 - Intro: cite GA booklet
105 - each chapter should make clear in which model we work
106 - clean up bibliography