Johannes Carmesin

According to our database, Johannes Carmesin authored at least 30 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2024

Entanglements.

Johannes Carmesin, Jan Kurkofka

J. Comb. Theory, Ser. B, January, 2024

2023

Characterising graphs with no subdivision of a wheel of bounded diameter.

Johannes Carmesin

J. Comb. Theory, Ser. B, July, 2023

On Andreae's ubiquity conjecture.

Johannes Carmesin

J. Comb. Theory, Ser. B, 2023

How to apply tree decomposition ideas in large networks?

Johannes Carmesin, Sarah Frenkel

CoRR, 2023

Characterising 4-tangles through a connectivity property.

Johannes Carmesin, Jan Kurkofka

CoRR, 2023

Outerspatial 2-Complexes: Extending the Class of Outerplanar Graphs to Three Dimensions.

Johannes Carmesin, Tsvetomir Mihaylov

Electron. J. Comb., 2023

Canonical decompositions of 3-connected graphs.

Johannes Carmesin, Jan Kurkofka

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Canonical trees of tree-decompositions.

Johannes Carmesin, Matthias Hamann, Babak Miraftab

J. Comb. Theory, Ser. B, 2022

Local 2-separators.

Johannes Carmesin

J. Comb. Theory, Ser. B, 2022

New Constructions Related to the Polynomial Sphere Recognition Problem.

Johannes Carmesin, Lyuben Lichev

Discret. Comput. Geom., 2022

2021

On the intersection conjecture for infinite trees of matroids.

Nathan J. Bowler, Johannes Carmesin

J. Comb. Theory, Ser. B, 2021

2020

Every planar graph with the Liouville property is amenable.

Johannes Carmesin, Agelos Georgakopoulos

Random Struct. Algorithms, 2020

The Almost Intersection Property for Pairs of Matroids on Common Groundset.

Nathan J. Bowler, Johannes Carmesin, Jerzy Wojciechowski, Shadisadat Ghaderi

Electron. J. Comb., 2020

2019

All Graphs Have Tree-Decompositions Displaying Their Topological Ends.

Johannes Carmesin

Comb., 2019

The Colouring Number of Infinite Graphs.

Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher

Comb., 2019

2018

An excluded minors method for infinite matroids.

Nathan J. Bowler, Johannes Carmesin

J. Comb. Theory, Ser. B, 2018

Reconstruction of infinite matroids from their 3-connected minors.

Nathan J. Bowler, Johannes Carmesin, Luke Postle

Eur. J. Comb., 2018

On the intersection of infinite matroids.

Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich

Discret. Math., 2018

Topological Infinite Gammoids, and a New Menger-Type Theorem for Infinite Graphs.

Johannes Carmesin

Electron. J. Comb., 2018

Infinite Graphic Matroids.

Nathan J. Bowler, Johannes Carmesin, Robin Christian

Comb., 2018

2017

Canonical tree-decompositions of a graph that display its k-blocks.

Johannes Carmesin, J. Pascal Gollin

J. Comb. Theory, Ser. B, 2017

Topological cycle matroids of infinite graphs.

Johannes Carmesin

Eur. J. Comb., 2017

2016

Canonical tree-decompositions of finite graphs II. Essential parts.

Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark

J. Comb. Theory, Ser. B, 2016

Canonical tree-decompositions of finite graphs I. Existence and algorithms.

Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark

J. Comb. Theory, Ser. B, 2016

A short proof that every finite graph has a tree-decomposition displaying its tangles.

Johannes Carmesin

Eur. J. Comb., 2016

2015

Edge-disjoint double rays in infinite graphs: A Halin type result.

Nathan J. Bowler, Johannes Carmesin, Julian Pott

J. Comb. Theory, Ser. B, 2015

Matroid intersection, base packing and base covering for infinite matroids.

Nathan J. Bowler, Johannes Carmesin

Comb., 2015

2014

k-Blocks: A Connectivity Invariant for Graphs.

Johannes Carmesin, Reinhard Diestel, M. Hamann, Fabian Hundertmark

SIAM J. Discret. Math., 2014

Matroids with an infinite circuit-cocircuit intersection.

Nathan J. Bowler, Johannes Carmesin

J. Comb. Theory, Ser. B, 2014

Connectivity and tree structure in finite graphs.

Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein

Comb., 2014