Johannes Carmesin

37 papers A* 2Journal 35
YearRankTypeTitle / Venue / Authors
2026 A* conf
Augmenting to 4-vertex connectivity is fixed-parameter tractable.
SODA
Johannes Carmesin, M. S. Ramanujan
2026 J jnl
Hardness of planarity for weak temporal sequences of 2-connected graphs.
Theor. Comput. Sci.
Johannes Carmesin, Will J. Turner
2025 J jnl
Characterising 4-Tangles Through a Connectivity Property.
Electron. J. Comb.
Johannes Carmesin, Jan Kurkofka
2025 J jnl
How Local Separators Shape Community Structure in Large Networks.
CoRR
Sarah Frenkel, Johannes Carmesin
2024 J jnl
A Whitney Type Theorem for Surfaces: Characterising Graphs with Locally Planar Embeddings.
Comb.
Johannes Carmesin
2024 J jnl
Entanglements.
J. Comb. Theory B
Johannes Carmesin, Jan Kurkofka
2023 A* conf
Canonical decompositions of 3-connected graphs.
FOCS
Johannes Carmesin, Jan Kurkofka
2023 J jnl
Canonical decompositions of 3-connected graphs.
CoRR
Johannes Carmesin, Jan Kurkofka
2023 J jnl
Characterising 4-tangles through a connectivity property.
CoRR
Johannes Carmesin, Jan Kurkofka
2023 J jnl
Characterising graphs with no subdivision of a wheel of bounded diameter.
J. Comb. Theory B
Johannes Carmesin
2023 J jnl
How to apply tree decomposition ideas in large networks?
CoRR
Johannes Carmesin, Sarah Frenkel
2023 J jnl
On Andreae's ubiquity conjecture.
J. Comb. Theory B
Johannes Carmesin
2023 J jnl
Outerspatial 2-Complexes: Extending the Class of Outerplanar Graphs to Three Dimensions.
Electron. J. Comb.
Johannes Carmesin, Tsvetomir Mihaylov
2022 J jnl
Canonical trees of tree-decompositions.
J. Comb. Theory B
Johannes Carmesin, Matthias Hamann, Babak Miraftab
2022 J jnl
Entanglements.
CoRR
Johannes Carmesin, Jan Kurkofka
2022 J jnl
Local 2-separators.
J. Comb. Theory B
Johannes Carmesin
2022 J jnl
New Constructions Related to the Polynomial Sphere Recognition Problem.
Discret. Comput. Geom.
Johannes Carmesin, Lyuben Lichev
2021 J jnl
On the intersection conjecture for infinite trees of matroids.
J. Comb. Theory B
Nathan J. Bowler, Johannes Carmesin
2020 J jnl
Every planar graph with the Liouville property is amenable.
Random Struct. Algorithms
Johannes Carmesin, Agelos Georgakopoulos
2020 J jnl
The Almost Intersection Property for Pairs of Matroids on Common Groundset.
Electron. J. Comb.
Nathan J. Bowler, Johannes Carmesin, Jerzy Wojciechowski, Shadisadat Ghaderi
2019 J jnl
All Graphs Have Tree-Decompositions Displaying Their Topological Ends.
Comb.
Johannes Carmesin
2019 J jnl
The Colouring Number of Infinite Graphs.
Comb.
Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher
2018 J jnl
An excluded minors method for infinite matroids.
J. Comb. Theory B
Nathan J. Bowler, Johannes Carmesin
2018 J jnl
Infinite Graphic Matroids.
Comb.
Nathan J. Bowler, Johannes Carmesin, Robin Christian
2018 J jnl
On the intersection of infinite matroids.
Discret. Math.
Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich
2018 J jnl
Reconstruction of infinite matroids from their 3-connected minors.
Eur. J. Comb.
Nathan J. Bowler, Johannes Carmesin, Luke Postle
2018 J jnl
Topological Infinite Gammoids, and a New Menger-Type Theorem for Infinite Graphs.
Electron. J. Comb.
Johannes Carmesin
2017 J jnl
Canonical tree-decompositions of a graph that display its k-blocks.
J. Comb. Theory B
Johannes Carmesin, Jochen Pascal Gollin
2017 J jnl
Topological cycle matroids of infinite graphs.
Eur. J. Comb.
Johannes Carmesin
2016 J jnl
A short proof that every finite graph has a tree-decomposition displaying its tangles.
Eur. J. Comb.
Johannes Carmesin
2016 J jnl
Canonical tree-decompositions of finite graphs I. Existence and algorithms.
J. Comb. Theory B
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark
2016 J jnl
Canonical tree-decompositions of finite graphs II. Essential parts.
J. Comb. Theory B
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark
2015 J jnl
Edge-disjoint double rays in infinite graphs: A Halin type result.
J. Comb. Theory B
Nathan J. Bowler, Johannes Carmesin, Julian Pott
2015 J jnl
Matroid intersection, base packing and base covering for infinite matroids.
Comb.
Nathan J. Bowler, Johannes Carmesin
2014 J jnl
Connectivity and tree structure in finite graphs.
Comb.
Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein
2014 J jnl
Matroids with an infinite circuit-cocircuit intersection.
J. Comb. Theory B
Nathan J. Bowler, Johannes Carmesin
2014 J jnl
k-Blocks: A Connectivity Invariant for Graphs.
SIAM J. Discret. Math.
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark