| Publication | Date of Publication | Type |
|---|
| Connected k-median with disjoint and non-disjoint clusters | 2026-08-31 | Paper |
| FPT approximations for fair k-min-sum-radii | 2026-06-08 | Paper |
| Achieving anonymity via weak lower bound constraints for k-median and k-means | 2026-04-21 | Paper |
Turning big data into tiny data: coresets for unsupervised learning problems
SIAM Review | 2025-11-07 | Paper |
| Connected \(k\)-center and \(k\)-diameter clustering | 2024-11-14 | Paper |
Connected k-center and k-diameter clustering
Algorithmica | 2024-10-24 | Paper |
On a connection used in deformation quantization
Acta Physica Polonica B | 2024-09-13 | Paper |
| Approximating fair \(k\)-min-sum-radii in Euclidean space | 2024-07-19 | Paper |
| scientific article; zbMATH DE number 7768363 (Why is no real title available?) | 2023-11-20 | Paper |
Noisy, Greedy and Not so Greedy k-Means++
(available as arXiv preprint) | 2023-02-07 | Paper |
On the cost of essentially fair clusterings
(available as arXiv preprint) | 2023-02-03 | Paper |
Privacy preserving clustering with constraints
(available as arXiv preprint) | 2021-07-28 | Paper |
A local-search algorithm for Steiner forest
(available as arXiv preprint) | 2021-06-15 | Paper |
| Fair coresets and streaming algorithms for fair \(k\)-means | 2020-08-24 | Paper |
Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
SIAM Journal on Computing | 2020-08-03 | Paper |
Analysis of Ward's method
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Approximation Algorithms for Aversion k-Clustering via Local k-Median | 2017-12-19 | Paper |
Earliest arrival flows in networks with multiple sinks
Discrete Applied Mathematics | 2015-09-22 | Paper |
Probabilistic k-median clustering in data streams
Theory of Computing Systems | 2015-05-12 | Paper |
BICO: BIRCH meets coresets for \(k\)-means clustering
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Probabilistic \(k\)-median clustering in data streams
Approximation and Online Algorithms | 2013-09-13 | Paper |
Approximating Earliest Arrival Flows in Arbitrary Networks
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Earliest arrival flows in networks with multiple sinks
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Testing Euclidean Spanners
Property Testing | 2010-10-12 | Paper |
Testing Euclidean Spanners
Algorithms – ESA 2010 | 2010-09-06 | Paper |
