a. Planarization
b. Contractible versus separating
c. Thomassen's 3-path condition ⇒ O(n³) time
d. Greedy tree-cotree decompositions
e. Greedy (reduced) cut graph ⇒ O(n² log n) time
f. MSSP in surface maps (sketch) ⇒ O(g² n log n) time.