1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CG2016
C-Planarity of Overlapping Clusterings Including Unions of Two Partitions
Jan Christoph Athenstädt, Sabine Cornelsen
We show that clustered planarity with overlapping clusters as introduced by Didimo et al. can be solved in polynomial time if each cluster induces a connected subgraph. It can be s…
cs.CG2014★ 1 cited
Simultaneous Embeddability of Two Partitions
Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg
We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each…