• A short derivation of the structure theorem for graphs with excluded topological minors (J. Erde & D. Weißauer), preprint 2018; PDF
  
• Structural submodularity and tangles in abstract separation systems (R. Diestel, J. Erde & D. Weißauer), preprint 2018; PDF
  
• In absence of long chordless cycles, large tree-width becomes a local phenomenon (D. Weißauer), preprint 2018; PDF
• Algebraically grid-like graphs have large tree-width (D. Weißauer), preprint 2018; PDF
• Profinite separation systems (R. Diestel & J. Kneip), preprint 2018; short/long version
• Directed path-decompositions (J. Erde), preprint 2017; PDF
  
• A unified treatment of linked and lean tree-decompositions (J. Erde), Journal of Combinatorial Theory, Series B, Volume 130 (2018), 114-143 PDF
  
• On the block number of graphs (D. Weißauer), preprint 2017; PDF
  
• Abstract separation systems (R. Diestel), Order 35 (2018), 157-170; PDF
• Tangle-tree duality in abstract separation systems (R. Diestel & S. Oum), preprint 2017; PDF.
  
• Tangle-tree duality: in graphs, matroids and beyond (R. Diestel & S. Oum), preprint 2017; PDF.
  
• A zero-sum problem on graphs (D. Weißauer), preprint 2016; PDF
  
• Tangles and the Mona Lisa (R. Diestel & G. Whittle), preprint 2016; PDF
  
• Duality theorems for blocks and tangles in graphs (R. Diestel, J. Erde & Ph. Eberenz), SIAM Journal on Discrete Mathematics 31 (2017), 1514-1528; PDF
  
• Canonical tree-decompositions of a graph that display its k-blocks (J. Carmesin & J. P. Gollin), to appear in JCTB; PDF
  
• Profiles of separations: in graphs, matroids and beyond (R. Diestel, F. Hundertmark & S. Lemanczyk), to appear in Combinatorica; PDF
  
• Tree sets (R. Diestel), Order 35 (2018), 171-192; PDF
  
• A short proof that every finite graph has a tree-decomposition displaying its tangles (J. Carmesin), European J. Combin. 58 (2016), 61–65; PDF
• Refining a tree-decomposition which distinguishes tangles (J. Erde), SIAM Journal on Discrete Mathematics 31 (2017), 1529-1551; PDF
  
• Bounding connected tree-width (M. Hamann & D. Weißauer), SIAM Journal on Discrete Mathematics 30 (2016), 1391-1400; PDF
  
• Connected tree-width (R. Diestel & M. Müller), Combinatorica 38 (2018), 381-398; PDF
  
• Linkages in large graphs of bounded tree-width (J. Fröhlich, K. Kawarabayashi, T. Müller, J. Pott & P. Wollan), preprint 2013; PDF.
• k-Blocks: a connectivity invariant for graphs (J. Carmesin, R. Diestel, M. Hamann & F. Hundertmark), SIDMA 28 (2014), 1876-1891; PDF.
• Canonical tree-decompositions of finite graphs I. Existence and algorithms (J. Carmesin, R. Diestel, M. Hamann & F. Hundertmark), JCTB 116 (2016), 1–24; PDF.
• Canonical tree-decompositions of finite graphs II. Essential parts (J. Carmesin, R. Diestel, M. Hamann & F. Hundertmark), JCTB 118 (2016), 268–283; 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), Combinatorica 34 (2014), 1-35; 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) 102 (2012), 1189-1210; 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 (R. Diestel and D. Kühn), Discrete Applied Mathematics 145 (2005), 167-182; PDF
• Dense minors in graphs of large girth (R. Diestel and C. Rempel), Combinatorica 25 (2005), 111-116; PDF
• Two short proofs concerning tree-decompositions (R. Diestel and P. Bellenbaum), Combinatoric, Probability and Computing 11 (2002), 1-7; PDF
• Highly connected sets and the excluded grid theorem (R. Diestel, 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.)

Some theses in this area:

• D. Weißauer, On Tangles and Trees; PhD dissertation, Hamburg 2018; PDF.
• C. Elbracht, Tangles determined by majority vote, MSc dissertation, Hamburg 2017; PDF.
  
• Ph. Eberenz, Characteristics of profiles, MSc dissertation, Hamburg 2015; PDF.
  
• J. Carmesin, Tree-decomposition in finite and infinite graphs; PhD dissertation, Hamburg 2015; PDF.
• J. Pott, Limit structures and ubiquity in finite and infinite graphs; PhD dissertation, Hamburg 2015; PDF.
  
• J.O. Fröhlich, Linkages in Large Graphs and Matroid Union; PhD dissertation, Hamburg 2014; PDF.
  
• T. Müller, The excluded minor structure theorem, and linkages in large graphs of bounded tree-width; PhD dissertation, Hamburg 2014; PDF.
• Gollin, Polishing tree-decompositions to bring out the k-blocks, MSc dissertation, Hamburg 2014; PDF.
  
• F. Hundertmark, The tree-like connectivity structure of finite graphs and matroids; PhD dissertation, Hamburg 2013; PDF.
  
• C. Rempel, Erzwingung von Teilstrukturen in Graphen durch globale Parameter; PhD dissertation, Hamburg 2001; PDF.
• P. Bellenbaum, Schlanke Baumzerlegungen von Graphen, Diplomarbeit Hamburg 2000; PDF.