Niels Grüttemeier

activity

20192021

most citedLearning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis

7 citations · 9 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DS2021★ 2 cited

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz +1

We study the computational complexity of $c$ -Colored $P_{ℓ}$ Deletion and $c$ -Colored $C_{ℓ}$ Deletion. In these problems, one is given a $c$ -edge-colored graph and wants to dest…

cs.DS2020★ 7 cited

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…

cs.DS2019

Destroying Bicolored $P_{3}$ s by Deleting Few Edges

Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag +1

We introduce and study the Bicolored $P_{3}$ Deletion problem defined as follows. The input is a graph $G = (V, E)$ where the edge set $E$ is partitioned into a set $E_{r}$ of red edges a…

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis

Destroying Bicolored P3​s by Deleting Few Edges

Destroying Bicolored $P_{3}$ s by Deleting Few Edges