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 ??
55 - mention bugs in Valeria's verification paper
57 - G has to be connected, so m=O(n)
61 - cite Eisner's tutorial \cite{eisner:tutorial}
62 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
63 * Lemma: deletion of a non-MST edge does not alter the MST
67 - degree-restricted cases and arborescences
68 - bounded expansion classes?
73 - the general perspective: is it only a technical trick?
74 - ranking of permutations on general sets, relationship with integer sorting
75 - JN: explain approx scheme
76 - JN: 4.5.1: neslo by preci isolovat nejaky vlstnosti restriction matrices
77 tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
78 co je to vlastne za matice co splnuji 4.5.2
79 - JN: bounded-degree restriction graphs; would it imply general speedup?
83 - use \delta(X) notation
84 - use the notation for contraction by a set
85 - unify use of n(G) vs. n
86 - introduce \widehat\O early
90 * formatting of multi-line \algin, \algout
91 - use calligraphic letters from ams?
95 - each chapter should make clear in which model we work
96 - clean up bibliography
100 - structure of a Q-heap