Recent papers
 Structural submodularity and tangles in abstract separation
systems (with J. Erde & D. Weißauer), preprint 2018; PDF
 Profinite separation systems (with J. Kneip), preprint 2018; short/long
version
 Abstract separation systems, Order
35 (2018), 157170; PDF
 Tangletree duality in abstract separation systems (with S.
Oum), preprint 2017; PDF.
 Tangletree duality: in graphs, matroids and beyond (with S.
Oum), to appear in Combinatorica; PDF.

Tangles and the Mona Lisa (with G. Whittle), preprint 2016; PDF
 Duality theorems for blocks and tangles in graphs (with J.
Erde & Ph. Eberenz), SIDMA 31 (2017) 15141528, PDF
 Profiles of separations: in graphs, matroids and beyond (with
F. Hundertmark & S. Lemanczyk),
to appear in Combinatorica; PDF
 Tree sets, Order 35 (2018), 171192; PDF
 Ends and tangles, Abhandlungen Math. Sem. Univ. Hamburg 87
(2017), Special volume in memory of Rudolf Halin, 223244; PDF
 Dual trees must share their ends (with J. Pott),
J. Combin. Theory (Series B) 123 (2017) 3253; PDF
 Connected treewidth (with M. Müller),
Combinatorica 38 (2018), 381398; PDF
 Unifying duality theorems for width parameters I. Weak
and strong duality (with S. Oum), preprint 2014; PDF.
 Unifying duality theorems for width parameters II.
General duality (with S. Oum), preprint 2014; PDF.
 Canonical treedecompositions of finite graphs I. Existence
and algorithms (with J. Carmesin, M. Hamann & F.
Hundertmark),
J. Combin. Theory (Series B) 116 (2016), 124; PDF.
 Canonical treedecompositions of finite graphs II. Essential
parts (with J. Carmesin, M. Hamann & F. Hundertmark), J.
Combin. Theory (Series B) 118 (2016), 268283; PDF.
 kBlocks: a connectivity invariant for graphs (with J.
Carmesin, M. Hamann & F. Hundertmark), SIDMA 28 (2014),
18761891; PDF.
 Orthogonality and minimality in the homology of locally finite
graphs (with J. Pott), Electronic J. Comb. 21 (2014), #P3.36; PDF.
 Forcing finite minors in sparse infinite graphs by
largedegree assumptions, Electronic J. Comb. 22 (2015), #P1.43;
PDF
 A simple existence criterion for normal spanning trees in
infinite graphs, Electronic J. Comb. 23 (2016), #P2.33; PDF.
 The structure of 2separations of infinite matroids (with E.
AignerHorev & L. Postle),
J. Combin. Theory (Series B) 116 (2016), 2556; PDF
 Connectivity and treestructure in finite graphs (with J.
Carmesin, F. Hundertmark & M. Stein), Combinatorica 34
(2014), 135; PDF.
 Axioms for infinite matroids (with H. Bruhn, M. Kriesell, R.
Pendavingh & P. Wollan), Adv. Math 239 (2013), 1846; PDF
 The ErdösPósa property for clique minors in highly connected
graphs (with K. Kawarabayashi & P. Wollan), J. Combin.
Theory (Series B) 102 (2012), 454469; PDF.
 Infinite matroids in graphs (with H. Bruhn), in the Infinite Graph Theory
special volume of Discrete Math 311 (2011), 14611471; PDF
 On the homology of locally compact spaces with ends (with P.
Sprüssel), Topology and its Applications 158 (2011), 16261639;
PDF.
 On the excluded minor structure theorem for graphs of large
treewidth (with K. Kawarabayashi, T. Müller & P. Wollan),
J. Combin. Theory (Series B) 102 (2012), 11891210; PDF.
 Twins of rayless graphs (with A. Bonato, H. Bruhn & P.
Sprüssel),
J. Combin. Theory (Series B) 101 (2011) 6065; PDF.
 Locally finite graphs with ends: a topological approach I–III
(survey), Discrete Math 311–312 (2010–11); PDF
 The fundamental group of a locally finite graph with ends
(with P. Sprüssel), Adv. Math 226 (2011), 26432675; abstract; PDF.
 Every rayless graph has an unfriendly partition (with H.
Bruhn, A. Georgakopoulos & P. Sprüssel), Combinatorica 30
(2010), 521532; DVI, PDF.
 The homology of locally finite graphs with ends (with P.
Sprüssel), Combinatorica 30 (2010), 681714; abstract; journal version; extended version.