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

Erik D. Demaine, Mohammad Taghi Hajiaghayi

Browse the full GD paper archive.