Applications:

- degree-restricted cases and arborescences
- bounded expansion classes?

Ranking:

- ranking of permutations on general sets, relationship with integer sorting
- JN: 4.5.1:  neslo by preci isolovat nejaky vlstnosti restriction matrices
  tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
  co je to vlastne za matice co splnuji 4.5.2
- JN: bounded-degree restriction graphs; would it imply general speedup?

Typography:

- formatting of multi-line \algin, \algout

Diaz:

> 2: simplify, remove proof sketches
> 3.1.7, 3.1.10: skip proof
> 3.5.1: does the first alg give any insight?
> 5: mention graphs with moving vertices?

Patrice:

> Remark on 2.5.1: polynomial time could be replaced by sub-exponential time.
> In 3.1.12 and 3.1.16, you should make explicit the dependence of the
  running time  with respect, for instance, to the Hadwiger number of the
  graph or to the maximal density nabla(G) of a minor of the graph, as
  considering a minor closed class or another does not change the
  algorithm but only the bound on its running time.