2 citations · 4 across the 8 of their papers we have counts for
19 papers
Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs
Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz +1
In the Vertex Triangle 2-Club problem, we are given an undirected graph and aim to find a maximum-vertex subgraph of that has diameter at most 2 and in which every vertex i…
On Computing Exact Means of Time Series Using the Move-Split-Merge Metric
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
Computing an accurate mean of a set of time series is a critical task in applications like nearest-neighbor classification and clustering of time series. While there are many dista…
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
In Bayesian Network Structure Learning (BNSL), one is given a variable set and parent scores for each variable and aims to compute a DAG, called Bayesian network, that maximizes th…
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…