Reinhard Diestel

Publication Activity (10 Years)

Years Active: 1985-2020
Publications (10 Years): 16

Top Topics

Computationally Challenging

Highly Connected

Top Venues

J. Comb. Theory, Ser. B

Electron. J. Comb.

Publications

Reinhard Diestel
Tangles: a new paradigm for clusters and types. CoRR (2020)
Reinhard Diestel, Jakob Kneip
Profinite Separation Systems. Order 37 (1) (2020)
Reinhard Diestel, Fabian Hundertmark, Sahar Lemanczyk
Profiles of Separations: in Graphs, Matroids, and Beyond. Comb. 39 (1) (2019)
Reinhard Diestel, Joshua Erde, Daniel Weißauer
Structural submodularity and tangles in abstract separation systems. J. Comb. Theory, Ser. A 167 (2019)
Reinhard Diestel
Tangles in the social sciences. CoRR (2019)
Reinhard Diestel, Sang-il Oum
Tangle-Tree Duality: In Graphs, Matroids and Beyond. Comb. 39 (4) (2019)
Reinhard Diestel
Tree Sets. Order 35 (1) (2018)
Reinhard Diestel
Abstract Separation Systems. Order 35 (1) (2018)
Reinhard Diestel, Malte Müller
Connected Tree-Width. Comb. 38 (2) (2018)
Reinhard Diestel, Philipp Eberenz, Joshua Erde
Duality Theorems for Blocks and Tangles in Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Reinhard Diestel, Julian Pott
Dual trees must share their ends. J. Comb. Theory, Ser. B 123 (2017)
Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark
Canonical tree-decompositions of finite graphs II. Essential parts. J. Comb. Theory, Ser. B 118 (2016)
Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark
Canonical tree-decompositions of finite graphs I. Existence and algorithms. J. Comb. Theory, Ser. B 116 (2016)
Reinhard Diestel
A Simple Existence Criterion for Normal Spanning Trees. Electron. J. Comb. 23 (2) (2016)
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
The structure of 2-separations of infinite matroids. J. Comb. Theory, Ser. B 116 (2016)
Reinhard Diestel, Geoff Whittle
Tangles and the Mona Lisa. CoRR (2016)
Reinhard Diestel
Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions. Electron. J. Comb. 22 (1) (2015)
Reinhard Diestel, Julian Pott
Orthogonality and Minimality in the Homology of Locally Finite Graphs. Electron. J. Comb. 21 (3) (2014)
Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein
Connectivity and tree structure in finite graphs. Comb. 34 (1) (2014)
Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark
k-Blocks: A Connectivity Invariant for Graphs. SIAM J. Discret. Math. 28 (4) (2014)
Reinhard Diestel, Sang-il Oum
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). WG (2014)
Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan
On the excluded minor structure theorem for graphs of large tree-width. J. Comb. Theory, Ser. B 102 (6) (2012)
Reinhard Diestel, Philipp Sprüssel
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology. Discret. Math. 312 (1) (2012)
Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan
The Erdős-Pósa property for clique minors in highly connected graphs. J. Comb. Theory, Ser. B 102 (2) (2012)
Reinhard Diestel, Malte Müller
Connected tree-width. CoRR (2012)
Reinhard Diestel
Locally finite graphs with ends: A topological approach, I. Basic theory. Discret. Math. 311 (15) (2011)
Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
Twins of rayless graphs. J. Comb. Theory, Ser. B 101 (1) (2011)
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
Decomposing infinite matroids into their 3-connected minors. Electron. Notes Discret. Math. 38 (2011)
Henning Bruhn, Reinhard Diestel
Infinite matroids in graphs. Discret. Math. 311 (15) (2011)
Reinhard Diestel
Locally finite graphs with ends: A topological approach, II. Applications. Discret. Math. 310 (20) (2010)
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
Every rayless graph has an unfriendly partition. Comb. 30 (5) (2010)
Reinhard Diestel, Philipp Sprüssel
The homology of a locally finite graph with ends. Comb. 30 (6) (2010)
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
Every rayless graph has an unfriendly partition. Electron. Notes Discret. Math. 34 (2009)
Henning Bruhn, Reinhard Diestel
MacLane's theorem for arbitrary surfaces. J. Comb. Theory, Ser. B 99 (2) (2009)
Henning Bruhn, Reinhard Diestel
Duality in Infinite Graphs. Comb. Probab. Comput. 15 (1-2) (2006)
Reinhard Diestel, Carsten Thomassen
A Cantor-Bernstein Theorem for Paths in Graphs. Am. Math. Mon. 113 (2) (2006)
Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
-Connected Graphs. Comb. 26 (1) (2006)
Reinhard Diestel
End spaces and spanning trees. J. Comb. Theory, Ser. B 96 (6) (2006)
Henning Bruhn, Reinhard Diestel, Maya Stein
Menger's theorem for infinite graphs with ends. J. Graph Theory 50 (3) (2005)
Reinhard Diestel, Daniela Kühn
Graph minor hierarchies. Discret. Appl. Math. 145 (2) (2005)
Henning Bruhn, Reinhard Diestel, Maya Stein
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. J. Graph Theory 50 (2) (2005)
Reinhard Diestel
The Cycle Space of an Infinite Graph. Comb. Probab. Comput. 14 (1-2) (2005)
Reinhard Diestel
The Erdös-Menger conjecture for source/sink sets with disjoint closures. J. Comb. Theory, Ser. B 93 (1) (2005)
Reinhard Diestel, Christof Rempel
Dense Minors In Graphs Of Large Girth. Comb. 25 (1) (2004)
Reinhard Diestel, Daniela Kühn
On Infinite Cycles II. Comb. 24 (1) (2004)
Reinhard Diestel, Daniela Kühn
Topological paths, cycles and spanning trees in infinite graphs. Eur. J. Comb. 25 (6) (2004)
Reinhard Diestel
On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting. Am. Math. Mon. 111 (7) (2004)
Reinhard Diestel, Daniela Kühn
On Infinite Cycles I. Comb. 24 (1) (2004)
Reinhard Diestel
The countable Erds-Menger conjecture with ends. J. Comb. Theory, Ser. B 87 (1) (2003)
Reinhard Diestel, Daniela Kühn
Graph-theoretical versus topological ends of graphs. J. Comb. Theory, Ser. B 87 (1) (2003)
Reinhard Diestel, Oleg Pikhurko
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets. Order 20 (1) (2003)
Patrick Bellenbaum, Reinhard Diestel
Two Short Proofs Concerning Tree-Decompositions. Comb. Probab. Comput. 11 (6) (2002)
Reinhard Diestel
Relating Subsets of a Poset, and a Partition Theorem for WQOs. Order 18 (3) (2001)
Reinhard Diestel
An accessibility theorem for infinite graph minors. J. Graph Theory 35 (4) (2000)
Reinhard Diestel, Robin Thomas
Excluding a Countable Clique. J. Comb. Theory, Ser. B 76 (1) (1999)
Reinhard Diestel, Daniela Kühn
A universal planar graph under the minor relation. J. Graph Theory 32 (2) (1999)
Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen
Highly Connected Sets and the Excluded Grid Theorem. J. Comb. Theory, Ser. B 75 (1) (1999)
Reinhard Diestel
Graph Minors 1: A Short Proof of the Path-width Theorem. Comb. Probab. Comput. 4 (1995)
Reinhard Diestel, Imre Leader
The Growth of Infinite Graphs: Boundedness and Finite Spreading. Comb. Probab. Comput. 3 (1994)
Reinhard Diestel, Imre Leader
Domination Games on Infinite Graphs. Theor. Comput. Sci. 132 (2) (1994)
Reinhard Diestel
-Free Graphs. J. Comb. Theory, Ser. B 61 (2) (1994)
Ron Aharoni, Reinhard Diestel
Menger's Theorem for a Countable Source Set. Comb. Probab. Comput. 3 (1994)
Reinhard Diestel
-connectedness in infinite graphs. J. Comb. Theory, Ser. B 56 (2) (1992)
Reinhard Diestel
-free graphs. J. Comb. Theory, Ser. B 54 (2) (1992)
Reinhard Diestel
The end structure of a graph: recent results and open problems. Discret. Math. 100 (1-3) (1992)
Reinhard Diestel
Dominating functions and topological graph minors. Graph Structure Theory (1991)
Reinhard Diestel
Decomposing infinite graphs. Discret. Math. 95 (1-3) (1991)
Reinhard Diestel
Preface. Discret. Math. 95 (1-3) (1991)
Reinhard Diestel
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. J. Comb. Theory, Ser. B 50 (1) (1990)
Reinhard Diestel
Simplicial tree-decompositions of infinite graphs, I. J. Comb. Theory, Ser. B 48 (2) (1990)
Reinhard Diestel
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. J. Comb. Theory, Ser. B 50 (1) (1990)
Reinhard Diestel
Simplicial decompositions of graphs: a survey of applications. Discret. Math. 75 (1-3) (1989)
Reinhard Diestel
Tree-decompositions, tree-representability and chordal graphs. Discret. Math. 71 (2) (1988)
Reinhard Diestel
A separation property of planar triangulations. J. Graph Theory 11 (1) (1987)
Reinhard Diestel
Simplicial decompositions of graphs - Some uniqueness results. J. Comb. Theory, Ser. B 42 (2) (1987)
Reinhard Diestel
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. Discret. Math. 55 (1) (1985)
Reinhard Diestel
On Universal Graphs With Forbidden Topological Subgraphs. Eur. J. Comb. 6 (2) (1985)
Reinhard Diestel, Rudolf Halin, Walter Vogler
Some remarks on universal graphs. Comb. 5 (4) (1985)