Memory-Restricted Routing with Tiled Map Data. - Thomas Bläsius; Jan Eube; Thomas Feldtkeller; Tobias Friedrich 001; Martin S. Krejca; J. A. Gregor Lagodzinski; Ralf Rothenberger; Julius Severin; Fabian Sommer; Justin Trautmann (SMC, 2018)

Noisy, Greedy and Not so Greedy k-Means++. - Anup Bhattacharya; Jan Eube; Heiko Röglin; Melanie Schmidt 001 (ESA, 2020)

Connected k-Center and k-Diameter Clustering. - Lukas Drexler; Jan Eube; Kelin Luo; Heiko Röglin; Melanie Schmidt 001; Julian Wargalla (ICALP, 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)

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)

Online multiple one way non-preemptive time series search with interrelated prices. - Jinghan Zhao; Yongxi Cheng; Jan Eube; Haodong Liu (J. Comb. Optim., 2025)

Connected k-Median with Disjoint and Non-disjoint Clusters. - Jan Eube; Kelin Luo; Dorian Reineccius; Heiko Röglin; Melanie Schmidt 001 (CoRR, 2025)