David Saulpic

Proc. ACM Manag. Data, 2024

Almost-linear Time Approximation Algorithm to Euclidean k-median and k-means.

[BibT_eX]

[DOI]

CoRR, 2024

Making Old Things New: A Unified Algorithm for Differentially Private Clustering.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Fully Dynamic k-Means Coreset in Near-Optimal Update Time.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Experimental Evaluation of Fully Dynamic <i>k</i>-Means via Coresets.

[BibT_eX]

[DOI]

Leonhard Sidl

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023

Experimental Evaluation of Fully Dynamic k-Means via Coresets.

[BibT_eX]

[DOI]

Leonhard Sidl

CoRR, 2023

Differential Privacy for Clustering Under Continual Observation.

[BibT_eX]

[DOI]

CoRR, 2023

Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Approximation Algorithms and Sketches for Clustering. (Algorithmes d'approximation et sketches pour les problèmes de clustering).

[BibT_eX]

[DOI]

PhD thesis, 2022

Towards optimal lower bounds for k-median and k-means coresets.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

An Improved Local Search Algorithm for k-Median.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees.

[BibT_eX]

[DOI]

Frederik Mallmann-Trenn

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Improved Coresets for Euclidean k-Means.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Scalable Differentially Private Clustering via Hierarchically Separated Trees.

[BibT_eX]

[DOI]

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Community Recovery in the Degree-Heterogeneous Stochastic Block Model.

[BibT_eX]

[DOI]

Frederik Mallmann-Trenn

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Polynomial time approximation schemes for clustering in low highway dimension graphs.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

J. Comput. Syst. Sci., 2021

Near-linear Time Approximation Schemes for Clustering in Doubling Metrics.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

J. ACM, 2021

A new coreset framework for clustering.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

On the Power of Louvain in the Stochastic Block Model.

[BibT_eX]

[DOI]

Adrian Kosowski

Frederik Mallmann-Trenn

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Dominating Sets and Connected Dominating Sets in Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Fully Dynamic Consistent Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension.

[BibT_eX]

[DOI]

Amariah Becker

Philip N. Klein

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Metrics with Bounded Highway Dimension.

[BibT_eX]

[DOI]

Amariah Becker

Philip N. Klein

CoRR, 2017

Generating Functionally Equivalent Programs Having Non-isomorphic Control-Flow Graphs.

[BibT_eX]

[DOI]

Proceedings of the Secure IT Systems, 2017

A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs.

[BibT_eX]

[DOI]

Amariah Becker

Philip N. Klein