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
64 - use the name "Boruvka step"
67 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
68 - parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel
70 - random sampling (propp:randommst)
71 - degree-restricted cases and arborescences
72 - bounded expansion classes?
77 - bit tricks: reference to HAKMEM
78 - mention in-place radix-sorting?
79 - consequences of Q-Heaps: Thorup's undirected SSSP etc.
80 - add more context from thorup:aczero, also mention FP operations
81 - Tarjan79 is mentioned by Pettie to define Pointer machines
82 - add references to the C language
83 - PM: unify yardsticks
84 - all data structures should mention space complexity
88 - the general perspective: is it only a technical trick?
89 - ranking of permutations on general sets, relationship with integer sorting
90 - JN: explain approx scheme
91 - JN: 4.5.1: neslo by preci isolovat nejaky vlstnosti restriction matrices
92 tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
93 co je to vlstne za matice co splnuji 4.5.2
94 - JN: bounded-degree restriction graphs; would it imply general speedup?
98 - G has to be connected, so m=O(n)
99 - impedance mismatch in terminology: contraction of G along e vs. contraction of e.
100 - use \delta(X) notation
101 - unify use of n(G) vs. n
102 - use calligraphic letters from ams?
103 - change the notation for contractions -- use double slash instead of the dot?
104 - introduce \widehat\O early
105 - unify { x ; ... }, { x | ...} and { x : ... }
106 - Ackermann: which of the Tarjan's set union papers should we cite?
107 - Ackermann function vs. Ackermann's function
112 - formatting of multi-line \algin, \algout
113 - each chapter should make clear in which model we work