30 citations · 100 across the 41 of their papers we have counts for
4 papers · 1 filter
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
A graph is weakly -closed if every induced subgraph of contains one vertex such that for each non-neighbor of it holds that . The weak clo…
Exploiting -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…
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
Niels Grüttemeier, Christian Komusiewicz
We study the problem of learning the structure of an optimal Bayesian network when additional constraints are posed on the network or on its moralized graph. More precisely, we con…
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Given an undirected graph and integers and , the Maximum Edge-Colorable Subgraph problem asks whether we can delete at most edges in to obtain a graph that has a…