Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth