• Connected tree-width (Malte Müller), preprint 2012; PDF
  
• Profiles. An algebraic approach to combinatorial connectivity (Fabian Hundertmark), preprint 2011; PDF
  
• Connectivity and tree-structure in finite graphs (Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark & Maya Stein), preprint 2011; PDF.
• The Erdös-Pósa property for clique minors in highly connected graphs (Reinhard Diestel, Ken-ichi Kawarabayashi & Paul Wollan), J. Combin. Theory (Series B) 102 (2012), 454-469; PDF.
  
• On the excluded minor structure theorem for graphs of large tree-width (Reinhard Diestel, Ken-ichi Kawarabayashi, Theo Müller & Paul Wollan), J. Combin. Theory (Series B), to appear; PDF.
• Linear connectivity forces large complete bipartite minors: An alternative approach (Jan-Oliver Fröhlich & Theo Müller), J. Combin. Theory (Series B), 101 (2011), 502–508; ArXiv 2009.
• Graph minor hierarchies (with D. Kühn), Discrete Applied Mathematics 145 (2005), 167-182; PDF
• Dense minors in graphs of large girth (with C. Rempel), Combinatorica 25 (2005), 111-116; PDF
• Two short proofs concerning tree-decompositions (with P. Bellenbaum), Combinatoric, Probability and Computing 11 (2002), 1-7; PDF
• Highly connected sets and the excluded grid theorem (with K.Yu. Gorbunov, T.R. Jensen and C. Thomassen), J. Combin. Theory (Series B) 75 (1999), 61-73; DVI.
  
• Graph Minors I: a short proof of the pathwidth theorem, Combinatorics, Probability and Computing 4 (1995), 27-30; DVI (A better exposition with figures is available here in PDF - an excerpt from the chapter on graph minors in Graph Theory, 1st ed'n.)

Theses:

• J. Bellenbaum, Schlanke Baumzerlegungen von Graphen, Diplomarbeit Hamburg 2000; PDF.