Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Andras Eke
Barbara Aquilani
Mingxie He
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Bruno M. Carvalho
Home
/
Author
/
JOHANNES CARMESIN
Author Info
Open Visualization
Name
Affiliation
Papers
JOHANNES CARMESIN
Univ Hamburg, Fachbereich Math, D-20146 Hamburg, Germany
15
Collaborators
Citations
PageRank
12
29
7.08
Referers
Referees
References
23
45
44
Publications (15 rows)
Collaborators (12 rows)
Referers (23 rows)
Referees (45 rows)
Title
Citations
PageRank
Year
Canonical trees of tree-decompositions
0
0.34
2022
On the intersection conjecture for infinite trees of matroids
1
0.37
2021
All graphs have tree-decompositions displaying their topological ends
1
0.41
2019
The Colouring Number of Infinite Graphs
0
0.34
2019
An excluded minors method for infinite matroids
6
0.87
2018
Topological infinite gammoids, and a new Menger-type theorem for infinite graphs
1
0.37
2018
Reconstruction of infinite matroids from their 3-connected minors.
1
0.41
2018
Canonical tree-decompositions of a graph that display its k-blocks.
0
0.34
2017
Topological cycle matroids of infinite graphs
0
0.34
2017
A short proof that every finite graph has a tree-decomposition displaying its tangles.
0
0.34
2016
Canonical tree-decompositions of finite graphs II. Essential parts
2
0.39
2016
Canonical tree-decompositions of finite graphs I. Existence and algorithms.
7
0.95
2016
Matroids with an infinite circuit-cocircuit intersection
2
0.52
2014
Connectivity and tree structure in finite graphs
7
0.74
2014
k-Blocks: A Connectivity Invariant for Graphs.
1
0.35
2014
1