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