Minors, Duality of Width-parameters and Algorithmic Applications

algorithmic applications, I will present a generic duality theorem which
provides at the same time a uniform proof of all the existing results on
min-max duality for different graph parameters (tree-width, path-width,
branch-width, ...), and also some new min-max theorems. The approach is
based on a new notion of submodularity for partition functions.