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 - cite Eisner's tutorial \cite{eisner:tutorial}
54 - move the remark on disconnected graphs? separate section?
55 - mention graphs with non-unique weights? also in the separate section?
56 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
57 - citation of mixed Boruvka-Jarnik
58 - use the notation for contraction by a set
59 - mention bugs in Valeria's verification paper
60 - more references on decision trees
61 - rename theorem on Minimality by order
62 - introduce Cut rule and Cycle rule earlier
63 - Lemma: deletion of a non-MST edge does not alter the MST
66 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
67 - parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel
69 - degree-restricted cases and arborescences
70 - bounded expansion classes?
75 - add references to the C language
76 - PM: unify yardsticks
77 - all data structures should mention space complexity
81 - the general perspective: is it only a technical trick?
82 - ranking of permutations on general sets, relationship with integer sorting
83 - JN: explain approx scheme
84 - JN: 4.5.1: neslo by preci isolovat nejaky vlstnosti restriction matrices
85 tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
86 co je to vlastne za matice co splnuji 4.5.2
87 - JN: bounded-degree restriction graphs; would it imply general speedup?
91 - G has to be connected, so m=O(n)
92 - impedance mismatch in terminology: contraction of G along e vs. contraction of e.
93 - use \delta(X) notation
94 - unify use of n(G) vs. n
95 - change the notation for contractions -- use double slash instead of the dot?
96 - introduce \widehat\O early
100 - formatting of multi-line \algin, \algout
101 - use calligraphic letters from ams?
105 - Intro: cite GA booklet
106 - each chapter should make clear in which model we work
107 - clean up bibliography