3 papers
cs.DS2026
Clustering with Locally Bounded Ignorance
Jaroslav Garvardt, Christian Komusiewicz
In Correlation Clustering, the input is a graph with weight function and the task is to partition the vertex set into clusters such that the total…
cs.CC2024
Parameterized Local Search for Max -Cut
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz +1
In the NP-hard Max -Cut problem, one is given an undirected edge-weighted graph and aims to color the vertices of with colors such that the total weight of edges wit…
cs.DS2022
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…