Connectivity and tree structure in finite graphs J Carmesin, R Diestel, F Hundertmark, M Stein Combinatorica 34, 11-46, 2014 | 68 | 2014 |

Canonical tree-decompositions of finite graphs I. Existence and algorithms J Carmesin, R Diestel, M Hamann, F Hundertmark Journal of Combinatorial Theory, Series B 116, 1-24, 2016 | 42 | 2016 |

-Blocks: A Connectivity Invariant for Graphs J Carmesin, R Diestel, M Hamann, F Hundertmark SIAM Journal on Discrete Mathematics 28 (4), 1876-1891, 2014 | 37 | 2014 |

Infinite matroid union E Aigner-Horev, J Carmesin, JO Fröhlich arXiv preprint arXiv:1111.0602, 2011 | 28 | 2011 |

On the intersection of infinite matroids E Aigner-Horev, J Carmesin, JO Fröhlich Discrete Mathematics 341 (6), 1582-1596, 2018 | 25 | 2018 |

Infinite graphic matroids N Bowler, J Carmesin, R Christian Combinatorica 38, 305-339, 2018 | 24 | 2018 |

Canonical trees of tree-decompositions J Carmesin, M Hamann, B Miraftab Journal of Combinatorial Theory, Series B 152, 1-26, 2022 | 23 | 2022 |

Canonical tree-decompositions of finite graphs II. Essential parts J Carmesin, R Diestel, M Hamann, F Hundertmark Journal of Combinatorial Theory, Series B 118, 268-283, 2016 | 23 | 2016 |

Matroid intersection, base packing and base covering for infinite matroids N Bowler, J Carmesin Combinatorica 35, 153-180, 2015 | 21 | 2015 |

All graphs have tree-decompositions displaying their topological ends J Carmesin Combinatorica 39 (3), 545-596, 2019 | 20 | 2019 |

Matroids with an infinite circuit–cocircuit intersection N Bowler, J Carmesin Journal of Combinatorial Theory, Series B 107, 78-91, 2014 | 20 | 2014 |

Infinite matroids and determinacy of games N Bowler, J Carmesin arXiv preprint arXiv:1301.5980, 2013 | 20 | 2013 |

Embedding simply connected 2-complexes in 3-space--I. A Kuratowski-type characterisation J Carmesin arXiv preprint arXiv:1709.04642, 2017 | 17 | 2017 |

Canonical tree-decompositions of a graph that display its k-blocks J Carmesin, JP Gollin Journal of Combinatorial Theory, Series B 122, 1-20, 2017 | 16 | 2017 |

An excluded minors method for infinite matroids N Bowler, J Carmesin arXiv preprint arXiv:1212.3939, 2012 | 15 | 2012 |

Infinite graphic matroids Part I N Bowler, J Carmesin, R Christian arXiv preprint arXiv:1309.3735, 2013 | 14 | 2013 |

Embedding simply connected 2-complexes in 3-space J Carmesin arXiv preprint arXiv:2309.15504, 2023 | 13 | 2023 |

Local 2-separators J Carmesin Journal of Combinatorial Theory, Series B 156, 101-144, 2022 | 13 | 2022 |

Edge-disjoint double rays in infinite graphs: a Halin type result N Bowler, J Carmesin, J Pott Journal of Combinatorial Theory, Series B 111, 1-16, 2015 | 13 | 2015 |

A short proof that every finite graph has a tree-decomposition displaying its tangles J Carmesin European Journal of Combinatorics 58, 61-65, 2016 | 12 | 2016 |