66 citations · 457 across the 33 of their papers we have counts for
4 papers · 2 filters
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors
Vincent Froese, René van Bevern, Rolf Niedermeier +1
The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main resul…
Parameterizing edge modification problems above lower bounds
René van Bevern, Vincent Froese, Christian Komusiewicz
We study the parameterized complexity of a variant of the -free Editing problem: Given a graph and a natural number , is it possible to modify at most edges in so…
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…
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 $…