Johannes Carmesin

works on

algorithmic complexity 1 graph connectivity 1 graph minors 1 SEFE 1 simultaneous embedding 1 temporal graphs 1

From the 1 of 5 linked papers with an AI index.

collaborators

5 papers

math.CO2026

A Graph Minors Approach to Temporal Sequences

Johannes Carmesin, Will J. Turner

The paper develops a graph‑minor based structural theory for simultaneous embeddability of temporal graph sequences, classifying 2‑connected sequences into five obstruction types a…

math.CO2025

Hardness of Planarity for Weak Temporal Sequences of 2-Connected Graphs

Johannes Carmesin, Will J. Turner

A weak deletion sequence is a sequence $(G_{1}, \dots, G_{n})$ of graphs so that for each $i \in [n - 1]$ either $G_{i}$ is isomorphic to a subgraph of $G_{i + 1}$ , or vice versa: $G_{i + 1}$ is…

math.CO2025

Characterising 4-tangles through a connectivity property

Johannes Carmesin, Jan Kurkofka

Every large $k$ -connected graph-minor induces a $k$ -tangle in its ambient graph. The converse holds for $k \leq 3$ , but fails for $k \geq 4$ . This raises the question whether ` $k$ -conn…

cs.SI2025

How Local Separators Shape Community Structure in Large Networks

Sarah Frenkel, Johannes Carmesin

Community detection is a key tool for analyzing the structure of large networks. Standard methods, such as modularity optimization, focus on identifying densely connected groups bu…

math.CO2025

Towards a Stallings-type theorem for finite groups

Johannes Carmesin, George Kontogeorgiou, Jan Kurkofka +1

A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roug…