@article{DemHajKaw-Algo-09,
  title = {{Algorithmic graph minor theory: improved grid minor bounds and Wagner's contraction}},
  author = {Demaine, Erik D. and Hajiaghayi, MohammadTaghi and Kawarabayashi, Ken{-}ichi},
  doi = {10.1007/s00453-007-9138-y},
  journal = {Algorithmica},
  mrnumber = {2500976},
  number = {2},
  pages = {142{--}180},
  volume = {54},
  year = {2009}}

@inproceedings{CheSid-ms-12,
  title = {{Approximation algorithms for Euler genus and related problems}},
  author = {Chandra Chekuri and Anastasios Sidiropoulos},
  booktitle = {Proc. 54th IEEE Symp. Foundations of Computer Science (FOCS 2013)},
  doi = {10.1109/FOCS.2013.26},
  eprint = {1304.2416},
  pages = {167{--}176},
  year = {2013}}

@inproceedings{KakKarLei-FOCS-90,
  title = {{Asymptotically tight bounds for computing with faulty arrays of processors}},
  author = {Kaklamanis, C. and Karlin, A. R. and Leighton, F. T. and Milenkovic, V. and Raghavan, P. and Rao, Satish and Thomborson, C. and Tsantilas, A.},
  booktitle = {Proc. 31st IEEE Symp. Foundations of Computer Science (FOCS 1990)},
  doi = {10.1109/FSCS.1990.89547},
  pages = {285{--}296},
  year = {1990}}

@article{OtaSud-DM-11,
  title = {{Bandwidth and pathwidth of three-dimensional grids}},
  author = {Otachi, Yota and Suda, Ryohei},
  doi = {10.1016/j.disc.2011.02.019},
  journal = {Discrete Math.},
  mrnumber = {2781633},
  number = {10-11},
  pages = {881{--}887},
  volume = {311},
  year = {2011}}

@inproceedings{DemHaj-SODA-05b,
  title = {{Bidimensionality: new connections between FPT algorithms and PTASs}},
  author = {Demaine, Erik D. and Hajiaghayi, MohammadTaghi},
  booktitle = {Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA 2005)},
  mrnumber = {2298309},
  pages = {590{--}601},
  year = {2005}}

@article{Plo-IRE-60,
  title = {{Binary codes with specified minimum distance}},
  author = {M. Plotkin},
  doi = {10.1109/TIT.1960.1057584},
  journal = {IRE Trans. Information Theory},
  mrnumber = {0122638},
  pages = {445{--}450},
  volume = {6},
  year = {1960}}

@unpublished{Epp-ms-13,
  title = {{Bushy trees, bandwidth, subgraph isomorphism, minors, and metric dimension in graphs with few connected subgraphs}},
  author = {David Eppstein},
  note = {Unpublished manuscript},
  year = {2013}}

@article{Ten-CGTA-98,
  title = {{Combinatorial aspects of geometric graphs}},
  author = {Teng, Shang-Hua},
  doi = {10.1016/S0925-7721(96)00008-9},
  journal = {Comput. Geom.},
  mrnumber = {1609578},
  number = {4},
  pages = {277{--}287},
  volume = {9},
  year = {1998}}

@article{Riz-SIGCOMM-97,
  title = {{Effective erasure codes for reliable computer communication protocols}},
  author = {Rizzo, Luigi},
  doi = {10.1145/263876.263881},
  journal = {SIGCOMM Comput. Commun. Rev.},
  mrnumber = {1820102},
  number = {2},
  pages = {24{--}36},
  volume = {27},
  year = {1997}}

@article{LubMitSho-ITIT-01,
  title = {{Efficient erasure correcting codes}},
  author = {Luby, Michael G. and Mitzenmacher, Michael and Shokrollahi, M. A. and Spielman, Daniel A.},
  doi = {10.1109/18.910575},
  journal = {IEEE Trans. Information Theory},
  mrnumber = {1820477},
  number = {2},
  pages = {569{--}584},
  volume = {47},
  year = {2001}}

@article{RobSey-JCTB-83,
  title = {{Graph minors. I. Excluding a forest}},
  author = {Robertson, Neil and Seymour, P. D.},
  doi = {10.1016/0095-8956(83)90079-5},
  journal = {J. Combin. Theory Ser. B},
  mrnumber = {723569},
  number = {1},
  pages = {39{--}61},
  volume = {35},
  year = {1983}}

@article{RobSey-JCTB-91,
  title = {{Graph minors. X. Obstructions to tree-decomposition}},
  author = {Robertson, Neil and Seymour, P. D.},
  doi = {10.1016/0095-8956(91)90061-N},
  journal = {J. Combin. Theory Ser. B},
  mrnumber = {1110468},
  number = {2},
  pages = {153{--}190},
  volume = {52},
  year = {1991}}

@inproceedings{DemHaj-SODA-05,
  title = {{Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality}},
  author = {Demaine, Erik D. and Hajiaghayi, MohammadTaghi},
  booktitle = {Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA 2005)},
  pages = {682{--}689},
  year = {2005}}

@article{DieJenGor-JCTB-99,
  title = {{Highly connected sets and the excluded grid theorem}},
  author = {Diestel, Reinhard and Jensen, Tommy R. and Gorbunov, Konstantin Yu. and Thomassen, Carsten},
  doi = {10.1006/jctb.1998.1862},
  journal = {J. Combin. Theory Ser. B},
  mrnumber = {1666948},
  number = {1},
  pages = {61{--}73},
  volume = {75},
  year = {1999}}

@article{GuTam-Algo-12,
  title = {{Improved bounds on the planar branchwidth with respect to the largest grid minor size}},
  author = {Gu, Qian-Ping and Tamaki, Hisao},
  doi = {10.1007/s00453-012-9627-5},
  issn = {0178-4617},
  journal = {Algorithmica},
  mrnumber = {2965273},
  number = {3},
  pages = {416{--}453},
  volume = {64},
  year = {2012}}

@inproceedings{KawKob-STACS-12,
  title = {{Linear min-max relation between the treewidth of $H$-minor-free graphs and its largest grid}},
  author = {Kawarabayashi, Ken{-}ichi and Yusuke Kobayashi},
  booktitle = {Proc. 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  doi = {10.4230/LIPIcs.STACS.2012.278},
  editor = {Christoph D{\"u}rr and Thomas Wilke},
  mrnumber = {2909321},
  pages = {278{--}289},
  series = {Leibniz Int. Proc. Informatics},
  volume = {14},
  year = {2012}}

@article{DemHaj-Comb-08,
  title = {{Linearity of grid minors in treewidth with applications through bidimensionality}},
  author = {Demaine, Erik D. and Hajiaghayi, MohammadTaghi},
  doi = {10.1007/s00493-008-2140-4},
  journal = {Combinatorica},
  mrnumber = {2399006},
  number = {1},
  pages = {19{--}36},
  volume = {28},
  year = {2008}}

@inproceedings{Lub-FOCS-02,
  title = {{LT codes}},
  author = {Luby, Michael G.},
  booktitle = {Proc. 43rd IEEE Symp. Foundations of Computer Science (FOCS 2002)},
  doi = {10.1109/SFCS.2002.1181950},
  pages = {271{--}280},
  year = {2002}}

@article{ChaSiv-DM-07,
  title = {{On the Hadwiger's conjecture for graph products}},
  author = {Chandran, L. Sunil and Sivadasan, Naveen},
  doi = {10.1016/j.disc.2006.06.019},
  journal = {Discrete Math.},
  mrnumber = {2285197},
  number = {2},
  pages = {266{--}273},
  volume = {307},
  year = {2007}}

@article{Bod-TCS-98,
  title = {{A partial $k$-arboretum of graphs with bounded treewidth}},
  author = {Bodlaender, Hans L.},
  doi = {10.1016/S0304-3975(97)00228-4},
  journal = {Theoret. Comput. Sci.},
  mrnumber = {1647486},
  number = {1-2},
  pages = {1{--}45},
  volume = {209},
  year = {1998}}

@misc{CheChu-13,
  title = {{Polynomial bounds for the grid-minor theorem}},
  author = {Chandra Chekuri and Julia Chuzhoy},
  howpublished = {Electronic preprint arxiv:1305.6577},
  year = {2013}}

@article{ReeWoo-EJC-12,
  title = {{Polynomial treewidth forces a large grid-like-minor}},
  author = {Reed, Bruce A. and Wood, David R.},
  doi = {10.1016/j.ejc.2011.09.004},
  journal = {European J. Combin.},
  mrnumber = {2864422},
  number = {3},
  pages = {374{--}379},
  volume = {33},
  year = {2012}}

@article{RobSeyTho-JCTB-94,
  title = {{Quickly excluding a planar graph}},
  author = {Robertson, Neil and Seymour, Paul and Thomas, Robin},
  doi = {10.1006/jctb.1994.1073},
  journal = {J. Combin. Theory Ser. B},
  mrnumber = {1305057},
  number = {2},
  pages = {323{--}348},
  volume = {62},
  year = {1994}}

@article{ColMagSit-SJC-97,
  title = {{Reconfiguring arrays with faults, part I: worst-case faults}},
  author = {Richard J. Cole and Bruce M. Maggs and Ramesh K. Sitaraman},
  doi = {10.1137/S0097539793255011},
  journal = {SIAM J. Comput.},
  mrnumber = {1484146},
  number = {6},
  pages = {1581{--}1611},
  volume = {26},
  year = {1997}}

@inproceedings{Wul-FOCS-11,
  title = {{Separator theorems for minor-free and shallow minor-free graphs with applications}},
  author = {Wulff-Nilsen, C.},
  booktitle = {Proc. 52nd IEEE Symp. Foundations of Computer Science (FOCS 2011)},
  doi = {10.1109/FOCS.2011.15},
  pages = {37{--}46},
  year = {2011}}

@inproceedings{PloRaoSmi-SODA-94,
  title = {{Shallow excluded minors and improved graph decompositions}},
  author = {Plotkin, Serge and Rao, Satish and Smith, Warren D.},
  booktitle = {Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (SODA 1994)},
  mrnumber = {1285188},
  pages = {462{--}470},
  year = {1994}}

@article{Die-AMSUH-04,
  title = {{A short proof of Halin's grid theorem}},
  author = {Diestel, Reinhard},
  doi = {10.1007/BF02941538},
  journal = {Abh. Math. Sem. Univ. Hamburg},
  mrnumber = {2112834},
  pages = {237{--}242},
  volume = {74},
  year = {2004}}

@book{NesOss-12,
  title = {{Sparsity: Graphs, Structures, and Algorithms}},
  author = {Jaroslav Ne{\v{s}}et{\v{r}}il and Ossona de Mendez, Patrice},
  doi = {10.1007/978-3-642-27875-4},
  isbn = {978-3-642-27874-7},
  mrnumber = {2920058},
  publisher = {Springer},
  series = {Algorithms and Combinatorics},
  volume = {28},
  year = {2012}}

@incollection{Ree-SC-97,
  title = {{Tree width and tangles: a new connectivity measure and some applications}},
  author = {Reed, Bruce A.},
  booktitle = {Surveys in Combinatorics, 1997 (London)},
  doi = {10.1017/CBO9780511662119.006},
  mrnumber = {1477746},
  pages = {87{--}162},
  publisher = {Cambridge Univ. Press},
  series = {London Math. Soc. Lecture Note Ser.},
  volume = {241},
  year = {1997}}

@article{Gri-DMTCS-11,
  title = {{Tree-width and large grid minors in planar graphs}},
  author = {Grigoriev, Alexander},
  issn = {1365-8050},
  journal = {Discrete Math. Theor. Comput. Sci.},
  mrnumber = {2791193},
  number = {1},
  pages = {13{--}20},
  volume = {13},
  year = {2011}}

@article{BirBonRee-DAM-09,
  title = {{Tree-width of graphs without a $3\times3$ grid minor}},
  author = {Birmel{\'e}, E. and Bondy, J. A. and Reed, Bruce A.},
  doi = {10.1016/j.dam.2008.08.003},
  journal = {Discrete Appl. Math.},
  mrnumber = {2536459},
  number = {12},
  pages = {2577{--}2596},
  volume = {157},
  year = {2009}}

@article{ChaKav-DM-06,
  title = {{The treewidth and pathwidth of hypercubes}},
  author = {Chandran, L. Sunil and Kavitha, T.},
  doi = {10.1016/j.disc.2005.12.010},
  journal = {Discrete Math.},
  mrnumber = {2204113},
  number = {3},
  pages = {359{--}365},
  volume = {306},
  year = {2006}}

@article{Hal-MN-65,
  title = {{{\"U}ber die Maximalzahl fremder unendlicher Wege in Graphen}},
  author = {Halin, R.},
  doi = {10.1002/mana.19650300106},
  journal = {Math. Nachr.},
  mrnumber = {0190031},
  pages = {63{--}85},
  volume = {30},
  year = {1965}}