Reinhard Diestel
2001–2017
A researcher in the Science corpus: 3 papers; trusts 0 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Who trusts Reinhard Diestel overall
Papers from Reinhard Diestel's perspective
Ordered by how strongly the researchers Reinhard Diestel trusts endorse each paper. Same corpus, a different order for every researcher.
- I and J
- Graph Minors. XX. Wagner's conjecture (J. Comb. Theory B)
- Digraphs - theory, algorithms and applications
- Recognizing Berge Graphs (Comb.)
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
Their papers
- Tangle-tree duality in abstract separation systems (2017) — 48 citations
- Axioms for infinite matroids (2010) — 107 citations
- A Conjecture Concerning a Limit of Non-Cayley Graphs (2001) — 100 citations