30 citations · 100 across the 41 of their papers we have counts for
6 papers · 1 filter
Preventing Small -Cuts by Protecting Edges
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz +1
We introduce and study Weighted Min -Cut Prevention, where we are given a graph with vertices and and an edge cost function and the aim is to choose an edg…
On the Parameterized Complexity of Polytree Learning
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
A Bayesian network is a directed acyclic graph that represents statistical dependencies between variables of a joint probability distribution. A fundamental task in data science is…
Parameterized String Equations
Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz +1
We study systems of String Equations where block variables need to be assigned strings so that their concatenation gives a specified target string. We investigate this problem unde…
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz +1
We study the computational complexity of -Colored Deletion and -Colored Deletion. In these problems, one is given a -edge-colored graph and wants to dest…
Essentially Tight Kernels for (Weakly) Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
We study kernelization of classic hard graph problems when the input graphs fulfill triadic closure properties. More precisely, we consider the recently introduced parameters closu…
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch +1
An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst. 2017] for a parameterized enumeration problem consists of an algorithm that transforms each instance into…