default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Carmesin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Johannes Carmesin
, Jan Kurkofka:
Entanglements. J. Comb. Theory B 164: 17-28 (2024)- 2023
- [j26]Johannes Carmesin, Tsvetomir Mihaylov:
Outerspatial 2-Complexes: Extending the Class of Outerplanar Graphs to Three Dimensions. Electron. J. Comb. 30(3) (2023) - [j25]Johannes Carmesin:
Characterising graphs with no subdivision of a wheel of bounded diameter. J. Comb. Theory B 161: 21-51 (2023) - [j24]Johannes Carmesin:
On Andreae's ubiquity conjecture. J. Comb. Theory B 162: 68-70 (2023) - [c1]Johannes Carmesin, Jan Kurkofka:
Canonical decompositions of 3-connected graphs. FOCS 2023: 1887-1920 - [i4]Johannes Carmesin, Jan Kurkofka:
Canonical decompositions of 3-connected graphs. CoRR abs/2304.00945 (2023) - [i3]Johannes Carmesin, Jan Kurkofka:
Characterising 4-tangles through a connectivity property. CoRR abs/2309.00902 (2023) - [i2]Johannes Carmesin, Sarah Frenkel:
How to apply tree decomposition ideas in large networks? CoRR abs/2312.12354 (2023) - 2022
- [j23]Johannes Carmesin, Lyuben Lichev:
New Constructions Related to the Polynomial Sphere Recognition Problem. Discret. Comput. Geom. 67(4): 1097-1123 (2022) - [j22]Johannes Carmesin, Matthias Hamann, Babak Miraftab:
Canonical trees of tree-decompositions. J. Comb. Theory B 152: 1-26 (2022) - [j21]Johannes Carmesin:
Local 2-separators. J. Comb. Theory B 156: 101-144 (2022) - [i1]Johannes Carmesin, Jan Kurkofka:
Entanglements. CoRR abs/2205.11488 (2022) - 2021
- [j20]Nathan J. Bowler, Johannes Carmesin:
On the intersection conjecture for infinite trees of matroids. J. Comb. Theory B 151: 46-82 (2021) - 2020
- [j19]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): 3 (2020) - [j18]Johannes Carmesin, Agelos Georgakopoulos:
Every planar graph with the Liouville property is amenable. Random Struct. Algorithms 57(3): 706-729 (2020)
2010 – 2019
- 2019
- [j17]Johannes Carmesin:
All Graphs Have Tree-Decompositions Displaying Their Topological Ends. Comb. 39(3): 545-596 (2019) - [j16]Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher:
The Colouring Number of Infinite Graphs. Comb. 39(6): 1225-1235 (2019) - 2018
- [j15]Nathan J. Bowler, Johannes Carmesin, Robin Christian:
Infinite Graphic Matroids. Comb. 38(2): 305-339 (2018) - [j14]Johannes Carmesin:
Topological Infinite Gammoids, and a New Menger-Type Theorem for Infinite Graphs. Electron. J. Comb. 25(3): 3 (2018) - [j13]Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich:
On the intersection of infinite matroids. Discret. Math. 341(6): 1582-1596 (2018) - [j12]Nathan J. Bowler, Johannes Carmesin, Luke Postle:
Reconstruction of infinite matroids from their 3-connected minors. Eur. J. Comb. 67: 126-144 (2018) - [j11]Nathan J. Bowler, Johannes Carmesin:
An excluded minors method for infinite matroids. J. Comb. Theory B 128: 104-113 (2018) - 2017
- [j10]Johannes Carmesin:
Topological cycle matroids of infinite graphs. Eur. J. Comb. 60: 135-150 (2017) - [j9]Johannes Carmesin, J. Pascal Gollin:
Canonical tree-decompositions of a graph that display its k-blocks. J. Comb. Theory B 122: 1-20 (2017) - 2016
- [j8]Johannes Carmesin:
A short proof that every finite graph has a tree-decomposition displaying its tangles. Eur. J. Comb. 58: 61-65 (2016) - [j7]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
Canonical tree-decompositions of finite graphs I. Existence and algorithms. J. Comb. Theory B 116: 1-24 (2016) - [j6]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
Canonical tree-decompositions of finite graphs II. Essential parts. J. Comb. Theory B 118: 268-283 (2016) - 2015
- [j5]Nathan J. Bowler, Johannes Carmesin:
Matroid intersection, base packing and base covering for infinite matroids. Comb. 35(2): 153-180 (2015) - [j4]Nathan J. Bowler, Johannes Carmesin, Julian Pott:
Edge-disjoint double rays in infinite graphs: A Halin type result. J. Comb. Theory B 111: 1-16 (2015) - 2014
- [j3]Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein:
Connectivity and tree structure in finite graphs. Comb. 34(1): 11-46 (2014) - [j2]Nathan J. Bowler, Johannes Carmesin:
Matroids with an infinite circuit-cocircuit intersection. J. Comb. Theory B 107: 78-91 (2014) - [j1]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
k-Blocks: A Connectivity Invariant for Graphs. SIAM J. Discret. Math. 28(4): 1876-1891 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
