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 . (Semi-)dynamic algorithms
35 . Sleator-Tarjan trees and semi-dynamic MST
37 . Fully dynamic connectivity
40 * Ranking Combinatorial Objects
42 o Ranking and unranking
43 o Ranking of permutations
44 o Ranking of k-permutations
45 o Restricted permutations
46 o Hatcheck lady and other derangements
48 . ?? general perspective ??
54 - cite Eisner's tutorial \cite{eisner:tutorial}
55 - \cite{pettie:onlineverify} online lower bound
57 - move the remark on disconnected graphs? separate section?
58 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
59 - reference to mixed Boruvka-Jarnik
60 - use the notation for contraction by a set
61 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
62 - parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel
63 - bounded expansion classes?
64 - degree-restricted cases and arborescences
65 - random sampling (propp:randommst)
66 - mention bugs in Valeria's verification paper
67 - more references on decision trees
71 - bit tricks: reference to HAKMEM
72 - mention in-place radix-sorting?
73 - consequences of Q-Heaps: Thorup's undirected SSSP etc.
74 - add more context from thorup:aczero, also mention FP operations
75 - Tarjan79 is claimed by Pettie to define Pointer machines
76 - add references to the C language
77 - PM: unify yardsticks
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 vlstne 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 - use calligraphic letters from ams?
96 - change the notation for contractions -- use double slash instead of the dot?
97 - introduce \widehat\O early
98 - unify { x ; ... }, { x | ...} and { x : ... }
99 - capitalize Pointer Machine
105 - minimize the use of Remarks, use \paran instead