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

2 citations · 4 across the 18 of their papers we have counts for

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2025

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration

Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer

Enumeration kernelization for parameterized enumeration problems was defined by Creignou et al. [Theory Comput. Syst. 2017] and was later refined by Golovach et al. [J. Comput. Sys…

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