2 citations · 6 across the 23 of their papers we have counts for
5 papers · 1 filter
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…
The Parameterized Complexity of s-Club with Triangle and Seed Constraints
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
The s-Club problem asks, for a given undirected graph , whether contains a vertex set of size at least such that , the subgraph of induced by , has diam…
Covering Many (or Few) Edges with k Vertices in Sparse Graphs
Tomohiro Koana, Christian Komusiewicz, André Nichterlein +1
We study the following two fixed-cardinality optimization problems (a maximization and a minimization variant). For a fixed between zero and one we are given a graph and two nu…