Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality (2005)

by Eric D Demaine, MohammadTaghi Hajiaghayi
Venue:Proc. 16th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA ’05), 682–689. ACM