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 - \cite{pettie:onlineverify} online lower bound
55 - move the remark on disconnected graphs? separate section?
56 - mention graphs with non-unique weights? also in the separate section?
57 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
58 - citation of mixed Boruvka-Jarnik
59 - use the notation for contraction by a set
60 - mention bugs in Valeria's verification paper
61 - more references on decision trees
62 - rename theorem on Minimality by order
65 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
66 - parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel
68 - random sampling (propp:randommst)
69 - degree-restricted cases and arborescences
70 - bounded expansion classes?
75 - bit tricks: reference to HAKMEM
76 - mention in-place radix-sorting?
77 - consequences of Q-Heaps: Thorup's undirected SSSP etc.
78 - add more context from thorup:aczero, also mention FP operations
79 - Tarjan79 is mentioned by Pettie to define Pointer machines
80 - add references to the C language
81 - PM: unify yardsticks
82 - all data structures should mention space complexity
86 - What is the origin of the semidynamic MSF?
90 - the general perspective: is it only a technical trick?
91 - ranking of permutations on general sets, relationship with integer sorting
92 - JN: explain approx scheme
93 - JN: 4.5.1: neslo by preci isolovat nejaky vlstnosti restriction matrices
94 tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
95 co je to vlstne za matice co splnuji 4.5.2
96 - JN: bounded-degree restriction graphs; would it imply general speedup?
100 - G has to be connected, so m=O(n)
101 - impedance mismatch in terminology: contraction of G along e vs. contraction of e.
102 - use \delta(X) notation
103 - unify use of n(G) vs. n
104 - use calligraphic letters from ams?
105 - change the notation for contractions -- use double slash instead of the dot?
106 - introduce \widehat\O early
107 - unify { x ; ... }, { x | ...} and { x : ... }
108 - capitalize Pointer Machine
109 - Ackermann: which of the Tarjan's set union papers should we cite?
110 - Ackermann function vs. Ackermann's function
115 - minimize the use of Remarks, use \paran instead