Christian Komusiewicz

activity

20152026

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

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

collaborators

Showing 2020 · cs.DMShow all

2 papers · 2 filters

cs.DM2020

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Tomohiro Koana, Christian Komusiewicz, Frank Sommer

A graph $G$ is weakly $γ$ -closed if every induced subgraph of $G$ contains one vertex $v$ such that for each non-neighbor $u$ of $v$ it holds that $∣ N (u) \cap N (v) ∣ < γ$ . The weak clo…

cs.DM2020

Exploiting $c$ -Closure in Kernelization Algorithms for Graph Problems

Tomohiro Koana, Christian Komusiewicz, Frank Sommer

A graph is c-closed if every pair of vertices with at least c common neighbors is adjacent. The c-closure of a graph G is the smallest number such that G is c-closed. Fox et al. [I…

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Exploiting c-Closure in Kernelization Algorithms for Graph Problems

Exploiting $c$ -Closure in Kernelization Algorithms for Graph Problems