Vincent Cohen-Addad

Algorithmic Thinking Theory COLT 2026 Algorithms and Hardness for Active Learning on Graphs ICML 2025 Correlation Clustering Beyond the Pivot Algorithm ICML 2025 Fair Clustering in the Sliding Window Model ICLR 2025 Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams COLT 2025 REINFORCE Adversarial Attacks on Large Language Models: An Adaptive, Distributional, and Semantic Objective ICML 2025 Scalable Private Partition Selection via Adaptive Weighting ICML 2025 The Geometry of Refusal in Large Language Models: Concept Cones and Representational Independence ICML 2025 A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering ICML 2024 A Scalable Algorithm for Individually Fair k-Means Clustering AISTATS 2024 Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond ICML 2024 Dynamic Correlation Clustering in Sublinear Update Time ICML 2024 Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems NeurIPS 2024 Multi-View Stochastic Block Models ICML 2024 Perturb-and-Project: Differentially Private Similarities and Marginals ICML 2024 Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval EMNLP 2024 Differentially Private Hierarchical Clustering with Provable Approximation Guarantees ICML 2023 Multi-Swap k-Means++ NeurIPS 2023 Private estimation algorithms for stochastic block models and mixture models NeurIPS 2023 Community Recovery in the Degree-Heterogeneous Stochastic Block Model COLT 2022 Improved Coresets for Euclidean k-Means NeurIPS 2022 Massively Parallel k-Means Clustering for Perturbation Resilient Instances ICML 2022 Near-Optimal Correlation Clustering with Privacy NeurIPS 2022 Near-Optimal Private and Scalable k-Clustering NeurIPS 2022 On Facility Location Problem in the Local Differential Privacy Model AISTATS 2022 Online and Consistent Correlation Clustering ICML 2022 Correlation Clustering in Constant Many Parallel Rounds ICML 2021 Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces NeurIPS 2021 Improving Ultrametrics Embeddings Through Coresets ICML 2021 Online k-means Clustering AISTATS 2021 Parallel and Efficient Hierarchical k-Median Clustering NeurIPS 2021 Fast and Accurate k-means++ via Rejection Sampling NeurIPS 2020 On Efficient Low Distortion Ultrametric Embedding ICML 2020 On the Power of Louvain in the Stochastic Block Model NeurIPS 2020 Fully Dynamic Consistent Facility Location NeurIPS 2019 Subquadratic High-Dimensional Hierarchical Clustering NeurIPS 2019 Clustering Redemption–Beyond the Impossibility of Kleinberg’s Axioms NeurIPS 2018 Hierarchical Clustering Beyond the Worst-Case NeurIPS 2017 Online Optimization of Smoothed Piecewise Constant Functions AISTATS 2017