Embedding simply connected 2-complexes in 3-space I, Preprint;
pdf
Embedding simply connected 2-complexes in 3-space II, Preprint;
pdf
Embedding simply connected 2-complexes in 3-space III, Preprint;
pdf
Embedding simply connected 2-complexes in 3-space IV, Preprint;
pdf
Embedding simply connected 2-complexes in 3-space V, Preprint;
pdf
On tree-decompositions of one-ended graphs (with F. Lehner & R. Möller), Preprint;
pdf
A Liouville hyperbolic souvlaki (with B. Federici & A. Georgakopoulos), Electron. J. Probab., Volume 22 (2017), paper no. 36, 19 pages;
pdf
The colouring number of infinite graphs (with N. Bowler, P. Komjáth & C. Reiher), Preprint;
pdf
A short proof that every finite graph has a tree-decomposition displaying its tangles, European J. Combin. 58 (2016), 61-65;
pdf
Canonical tree-decompositions of a graph that display its k-blocks (with Pascal Gollin), J. Combin. Theory Ser. B , Volume 122 (2017), Pages 1-20;
pdf
Reconstruction of infinite matroids from their 3-connected minors (with N. Bowler & L. Postle), European J. Combin. (2018), volume 67, pages 126-144;
pdf
Every planar graph with the Liouville property is amenable (with Agelos Georgakopoulos), Preprint;
pdf
All graphs have tree-decompositions displaying their topological ends, Combinatorica, to appear;
pdf
Topological cycle matroids of infinite graphs, European J. Combin, Volume 60 (2017), Pages 135-150;
pdf
Infinite trees of matroids (with Nathan Bowler), Preprint;
pdf
On the intersection conjecture for infinite trees of matroids (with Nathan Bowler), Preprint;
pdf
Even an infinite bureaucracy eventually makes a decision, Preprint;
pdf
Topological infinite gammoids, and a new Menger-type theorem for infinite graphs, Preprint;
pdf
Infinite graphic matroids Part I (with Nathan Bowler & Robin Christian), Combinatorica (2018), volume 38, issue 2, pages 305-339;
pdf
Edge-disjoint double rays in infinite graphs: a Halin type result (with Nathan Bowler & Julian Pott),
J. Combin. Theory Ser. B
111 (2015), 1-16;
pdf
The ubiquity of Psi-matroids (with Nathan Bowler), Preprint;
pdf
Infinite Matroids and Determinacy of Games (with Nathan Bowler), Preprint;
pdf
Canonical tree-decompositions of finite graphs II. Essential parts (with R. Diestel, M. Hamann & F. Hundertmark),
J. Combin. Theory Ser. B 118 (2016), 268-283;
pdf
Canonical tree-decompositions of finite graphs I. Existence and algorithms (with R. Diestel, M. Hamann & F. Hundertmark), J. Combin. Theory Ser. B 116 (2016), 1-24;
pdf
k-Blocks: a connectivity invariant for graphs (with R. Diestel, M. Hamann & F. Hundertmark),
SIAM J. Discrete Math. , 28-4 (2014), pp. 1876-1891;
pdf
An excluded minors method for infinite matroids (with Nathan Bowler), J. Combin. Theory Ser. B (2018), volume 128, pp. 104-113;
pdf
Matroid intersection, base packing and base covering for infinite matroids (with Nathan Bowler),
Combinatorica 35 (2015), no.
2, 153-180;
pdf
Matroids with an infinite circuit-cocircuit intersection (with Nathan Bowler), J. Combin. Theory Ser. B (2014), volume 107, 78-91;
pdf
On the intersection of infinite matroids (with Elad Aigner-Horev & Jan-Oliver Fröhlich), Discrete Mathematics (2018), volume 341, issue 6, pages 1582-1596;
pdf
Connectivity and tree-structure in finite graphs (with Reinhard Diestel, Fabian Hundertmark & Maya Stein),
Combinatorica 34 (2014) , 11-46;
pdf
A characterization of the locally finite networks admitting non-constant harmonic functions of finite energy, Potential Analysis 37 (2012), 229-245;
pdf
Master thesis (2012)
A characterization of the locally finite networks admitting non-constant harmonic functions of finite energy;
pdf
Dissertation (2015)
Tree-decompositions in
finite and infinite graphs;
pdf
Habilitation (2018)
Embedding simply connected 2-complexes in
3-space,
and further results on
infinite graphs and matroids;
pdf