Coresets for constrained k-median and k-means clustering in low dimensional Euclidean space. - Melanie Schmidt 001; Julian Wargalla (CoRR, 2021)

Connected k-Center and k-Diameter Clustering. - Lukas Drexler; Jan Eube; Kelin Luo; Heiko Röglin; Melanie Schmidt 001; Julian Wargalla (ICALP, 2023)

Approximating Fair k-Min-Sum-Radii in Euclidean Space. - Lukas Drexler; Annika Hennes; Abhiruk Lahiri; Melanie Schmidt 001; Julian Wargalla (WAOA, 2023)

Approximating Fair k-Min-Sum-Radii in Rd. - Lukas Drexler; Annika Hennes; Abhiruk Lahiri; Melanie Schmidt 001; Julian Wargalla (CoRR, 2023)

Approximately Pareto-optimal Solutions for Bi-Objective k-Clustering. - Anna Arutyunova; Jan Eube; Heiko Röglin; Melanie Schmidt 001; Sarah Sturm; Julian Wargalla (NeurIPS, 2024)

Analysis of Complete-Linkage, Design of Algorithms for the Separated k-Clustering and Euclidean k-MSR Problems. - Julian Wargalla (2024)

Upper and lower bounds for complete linkage in general metric spaces. - Anna Arutyunova; Anna Großwendt; Heiko Röglin; Melanie Schmidt 001; Julian Wargalla (Mach. Learn., 2024)

Connected k-Center and k-Diameter Clustering. - Lukas Drexler; Jan Eube; Kelin Luo; Dorian Reineccius; Heiko Röglin; Melanie Schmidt 001; Julian Wargalla (Algorithmica, 2024)