Jan Eube

According to our database1, Jan Eube authored at least 9 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Effective Traveling for Metric Instances of the Traveling Thief Problem.
CoRR, April, 2026

2025
New Algorithms and Hardness Results for Connected Clustering.
CoRR, November, 2025

Online multiple one way non-preemptive time series search with interrelated prices.
J. Comb. Optim., January, 2025

Connected k-Median with Disjoint and Non-Disjoint Clusters.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024
Connected k-Center and k-Diameter Clustering.
Algorithmica, November, 2024

Approximately Pareto-optimal Solutions for Bi-Objective k-Clustering.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

2023
Connected k-Center and k-Diameter Clustering.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2020
Noisy, Greedy and Not so Greedy k-Means++.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2018
Memory-Restricted Routing with Tiled Map Data.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2018


  Loading...