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)

Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs. - Lukas Drexler; Jan Höckendorff; Joshua Könen; Kevin Schewior (CoRR, 2023)

FPT Approximations for Fair k-Min-Sum-Radii. - Lena Carta; Lukas Drexler; Annika Hennes; Clemens Rösner; Melanie Schmidt 001 (ISAAC, 2024)

Local Search k-means++ with Foresight. - Theo Conrads; Lukas Drexler; Joshua Könen; Daniel R. Schmidt 001; Melanie Schmidt 001 (SEA, 2024)

FPT Approximations for Fair k-Min-Sum-Radii. - Lena Carta; Lukas Drexler; Annika Hennes; Clemens Rösner; Melanie Schmidt 001 (CoRR, 2024)

algo-hhu/FLSpp. - Lukas Drexler; Joshua Könen; Daniel R. Schmidt 001; Melanie Schmidt 001; Giulia Baldini 001 (DROPS Artifacts, 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)