Johannes Carmesin

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 29

Top Topics

Independent Set

Complexity Bounds

Tree Decompositions

Top Venues

J. Comb. Theory, Ser. B

Electron. J. Comb.

Publications

Johannes Carmesin, Jan Kurkofka
Entanglements. J. Comb. Theory, Ser. B 164 (2024)
Johannes Carmesin
Characterising graphs with no subdivision of a wheel of bounded diameter. J. Comb. Theory, Ser. B 161 (2023)
Johannes Carmesin
On Andreae's ubiquity conjecture. J. Comb. Theory, Ser. B 162 (2023)
Johannes Carmesin, Tsvetomir Mihaylov
Outerspatial 2-Complexes: Extending the Class of Outerplanar Graphs to Three Dimensions. Electron. J. Comb. 30 (3) (2023)
Johannes Carmesin, Jan Kurkofka
Canonical decompositions of 3-connected graphs. FOCS (2023)
Johannes Carmesin, Jan Kurkofka
Characterising 4-tangles through a connectivity property. CoRR (2023)
Johannes Carmesin, Jan Kurkofka
Canonical decompositions of 3-connected graphs. CoRR (2023)
Johannes Carmesin, Sarah Frenkel
How to apply tree decomposition ideas in large networks? CoRR (2023)
Johannes Carmesin, Matthias Hamann, Babak Miraftab
Canonical trees of tree-decompositions. J. Comb. Theory, Ser. B 152 (2022)
Johannes Carmesin, Lyuben Lichev
New Constructions Related to the Polynomial Sphere Recognition Problem. Discret. Comput. Geom. 67 (4) (2022)
Johannes Carmesin, Jan Kurkofka
Entanglements. CoRR (2022)
Johannes Carmesin
Local 2-separators. J. Comb. Theory, Ser. B 156 (2022)
Nathan J. Bowler, Johannes Carmesin
On the intersection conjecture for infinite trees of matroids. J. Comb. Theory, Ser. B 151 (2021)
Nathan J. Bowler, Johannes Carmesin, Jerzy Wojciechowski, Shadisadat Ghaderi
The Almost Intersection Property for Pairs of Matroids on Common Groundset. Electron. J. Comb. 27 (3) (2020)
Johannes Carmesin, Agelos Georgakopoulos
Every planar graph with the Liouville property is amenable. Random Struct. Algorithms 57 (3) (2020)
Johannes Carmesin
All Graphs Have Tree-Decompositions Displaying Their Topological Ends. Comb. 39 (3) (2019)
Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher
The Colouring Number of Infinite Graphs. Comb. 39 (6) (2019)
Johannes Carmesin
Topological Infinite Gammoids, and a New Menger-Type Theorem for Infinite Graphs. Electron. J. Comb. 25 (3) (2018)
Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich
On the intersection of infinite matroids. Discret. Math. 341 (6) (2018)
Nathan J. Bowler, Johannes Carmesin, Luke Postle
Reconstruction of infinite matroids from their 3-connected minors. Eur. J. Comb. 67 (2018)
Nathan J. Bowler, Johannes Carmesin
An excluded minors method for infinite matroids. J. Comb. Theory, Ser. B 128 (2018)
Nathan J. Bowler, Johannes Carmesin, Robin Christian
Infinite Graphic Matroids. Comb. 38 (2) (2018)
Johannes Carmesin, J. Pascal Gollin
Canonical tree-decompositions of a graph that display its k-blocks. J. Comb. Theory, Ser. B 122 (2017)
Johannes Carmesin
Topological cycle matroids of infinite graphs. Eur. J. Comb. 60 (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)
Johannes Carmesin
A short proof that every finite graph has a tree-decomposition displaying its tangles. Eur. J. Comb. 58 (2016)
Nathan J. Bowler, Johannes Carmesin
Matroid intersection, base packing and base covering for infinite matroids. Comb. 35 (2) (2015)
Nathan J. Bowler, Johannes Carmesin, Julian Pott
Edge-disjoint double rays in infinite graphs: A Halin type result. J. Comb. Theory, Ser. B 111 (2015)
Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein
Connectivity and tree structure in finite graphs. Comb. 34 (1) (2014)
Nathan J. Bowler, Johannes Carmesin
Matroids with an infinite circuit-cocircuit intersection. J. Comb. Theory, Ser. B 107 (2014)
Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark
k-Blocks: A Connectivity Invariant for Graphs. SIAM J. Discret. Math. 28 (4) (2014)