Reinhard Diestel

Universität Hamburg, Hamburg, Hamburg, Germany

Bela Bollobas	grad student	1987	Cambridge
(Simplicial Decompositions and Universal Graphs)

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.
Diestel R, Erde J, Weißauer D. (2019) Structural submodularity and tangles in abstract separation systems Journal of Combinatorial Theory, Series A. 167: 155-180
Diestel R, Kneip J. (2019) Profinite Separation Systems Order. 37: 179-205
Diestel R, Oum S. (2019) Tangle-Tree Duality: In Graphs, Matroids and Beyond Combinatorica. 39: 879-910
Diestel R, Hundertmark F, Lemanczyk S. (2019) Profiles of Separations: in Graphs, Matroids, and Beyond Combinatorica. 39: 37-75
Diestel R. (2018) Abstract Separation Systems Order. 35: 157-170
Diestel R, Müller M. (2018) Connected tree-width Combinatorica. 38: 381-398
Diestel R, Eberenz P, Erde J. (2017) Duality Theorems for Blocks and Tangles in Graphs Siam Journal On Discrete Mathematics. 31: 1514-1528
Diestel R, Pott J. (2017) Dual trees must share their ends Journal of Combinatorial Theory, Series B. 123: 32-53
Diestel R. (2017) Ends and Tangles Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. 87: 223-244
Diestel R. (2016) A Simple Existence Criterion for Normal Spanning Trees Electronic Journal of Combinatorics. 23: 2-33