activity
20152026
most citedRefined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

2 citations · 6 across the 22 of their papers we have counts for

collaborators
Showing 2015Show all

2 papers · 1 filter

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 $…

cs.DS2015

Parameterized Complexity of Critical Node Cuts

Danny Hermelin, Moshe Kaspi, Christian Komusiewicz +1

We consider the following natural graph cut problem called Critical Node Cut (CNC): Given a graph on vertices, and two positive integers and , determine whether …