3 papers
cs.DS2026
On the Parameterized Complexity of Min-Sum-Radii
Pankaj Kumar, Haiko Müller, Sebastian Ordyniak +1
In the Min-Sum-Radii (MSR) clustering problem, we are given a finite set X of n points in a metric space. The objective is to find at most k clusters centered at a subset of these…
math.CO2025
Thick Forests
Martin Dyer, Haiko Müller
We consider classes of graphs, which we call thick graphs, that have the vertices of a corresponding thin graph replaced by cliques and the edges replaced by cobipartite graphs In…
cs.DM2025
Interval H-graphs : Recognition and forbidden obstructions
Haiko Müller, Arash Rafiey
We introduce the class of interval -graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph with vertices $a_1,a_2,\dots,a_…