%0 Conference Paper %1 conf/soda/DemaineH05a %A Demaine, Erik D. %A Hajiaghayi, Mohammad Taghi %B SODA %D 2005 %I SIAM %K dblp %P 682-689 %T Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. %U http://dblp.uni-trier.de/db/conf/soda/soda2005.html#DemaineH05a %@ 0-89871-585-7

@inproceedings{conf/soda/DemaineH05a, added-at = {2012-12-07T00:00:00.000+0100}, author = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi}, biburl = {https://www.bibsonomy.org/bibtex/2a4008e6ccccbbd66b34d1ac423e18b84/dblp}, booktitle = {SODA}, crossref = {conf/soda/2005}, ee = {http://dl.acm.org/citation.cfm?id=1070432.1070528}, interhash = {271a0b638698f86ba0446070777dc8e7}, intrahash = {a4008e6ccccbbd66b34d1ac423e18b84}, isbn = {0-89871-585-7}, keywords = {dblp}, pages = {682-689}, publisher = {SIAM}, timestamp = {2012-12-08T11:39:55.000+0100}, title = {Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality.}, url = {http://dblp.uni-trier.de/db/conf/soda/soda2005.html#DemaineH05a}, year = 2005 }