Bounding Connected Tree-Width. - Matthias Hamann; Daniel Weißauer (SIAM J. Discret. Math., 2016)

Algebraically Grid-Like Graphs have Large Tree-Width. - Daniel Weißauer (Electron. J. Comb., 2019)

Structural submodularity and tangles in abstract separation systems. - Reinhard Diestel; Joshua Erde; Daniel Weißauer (J. Comb. Theory A, 2019)

In absence of long chordless cycles, large tree-width becomes a local phenomenon. - Daniel Weißauer (J. Comb. Theory B, 2019)

A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors. - Joshua Erde; Daniel Weißauer (SIAM J. Discret. Math., 2019)

On the Block Number of Graphs. - Daniel Weißauer (SIAM J. Discret. Math., 2019)

Isometric subgraphs for Steiner distance. - Daniel Weißauer (J. Graph Theory, 2020)