Algorithms for planar graphs
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms