13 citations · 16 across the 4 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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.CG2016★ 2 cited
Simultaneous Orthogonal Planarity
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +7
We introduce and study the problem: Given planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there…