19 citations · 44 across the 21 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2015
The role of twins in computing planar supports of hypergraphs
René van Bevern, Iyad A. Kanj, Christian Komusiewicz +2
A support or realization of a hypergraph is a graph on the same vertex as such that for each hyperedge of it holds that its vertices induce a connected subgraph of…
cs.DM2015
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing
René van Bevern, Iyad Kanj, Christian Komusiewicz +2
Given a hypergraph , the Planar Support problem asks whether there is a planar graph on the same vertex set as such that each hyperedge induces a connected subgraph of $…