@InProceedings{kawarabayashi_et_al:LIPIcs.STACS.2012.278,
  author =	{Kawarabayashi, Ken-ichi and Kobayashi, Yusuke},
  title =	{{Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{278--289},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{D\"{u}rr, Christoph and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.278},
  URN =		{urn:nbn:de:0030-drops-34165},
  doi =		{10.4230/LIPIcs.STACS.2012.278},
  annote =	{Keywords: grid minor, treewidth, graph minor}
}