Profiles2020-2026
Vincent Cohen-Addad
Google Research
26Papers
0Last author
45Unique co-authors
17First author
0Solo
First and last author come from byline position, which some venues assign alphabetically.
Recent papers26
- Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data StreamsAuthor 1 of 4ICLR 2026 · 2 citations
- Active Learning with Low-Rank Structure for Data SelectionAuthor 1 of 6ICML 2026
- An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the k-Means ProblemAuthor 1 of 3SODA 2026
- Distributed Algorithms for Euclidean ClusteringAuthor 1 of 4ICLR 2026
- Efficient Data Selection at Scale via Influence DistillationAuthor 2 of 4NeurIPS 2025 · 15 citations
- An Improved Greedy Approximation for (Metric) k-MeansAuthor 2 of 6FOCS 2025 · 2 citations
- Approximating High-Dimensional Earth Mover's Distance as Fast as Closest PairAuthor 2 of 4FOCS 2025 · 2 citations
- Embedding Planar Graphs into Graphs of Treewidth O (log3 n )Author 2 of 6SODA 2025
- Fair Clustering in the Sliding Window ModelAuthor 1 of 5ICLR 2025
- Solving the Correlation Cluster LP in Sublinear TimeAuthor 2 of 12STOC 2025
- Understanding the Cluster Linear Program for Correlation ClusteringAuthor 2 of 6STOC 2024 · 8 citations
- Dynamic Correlation Clustering in Sublinear Update TimeAuthor 1 of 4ICML 2024 · 7 citations
- Combinatorial Correlation ClusteringAuthor 1 of 6STOC 2024 · 4 citations
- Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset BoundsAuthor 2 of 5FOCS 2024 · 2 citations
- Multi-Swap k-Means++Author 2 of 4NeurIPS 2023 · 12 citations
- Differentially Private Hierarchical Clustering with Provable Approximation GuaranteesAuthor 4 of 5ICML 2023 · 10 citations
- Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation ClusteringAuthor 1 of 4FOCS 2023 · 7 citations
- Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1Author 1 of 4FOCS 2023 · 5 citations
- Streaming Euclidean MST to a Constant FactorAuthor 1 of 5STOC 2023 · 5 citations
- Near-Optimal Correlation Clustering with PrivacyAuthor 1 of 4NeurIPS 2022 · 18 citations
- Improved approximations for Euclidean k-means and k-median, via nested quasi-independent setsAuthor 1 of 4STOC 2022 · 15 citations
- Near-Optimal Private and Scalable -ClusteringAuthor 1 of 5NeurIPS 2022 · 11 citations
- Massively Parallel k-Means Clustering for Perturbation Resilient InstancesAuthor 1 of 3ICML 2022 · 6 citations
- Parallel and Efficient Hierarchical k-Median ClusteringAuthor 1 of 5NeurIPS 2021 · 9 citations
- Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant FactorAuthor 1 of 5FOCS 2021 · 5 citations
- Fast and Accurate -means++ via Rejection SamplingAuthor 1 of 5NeurIPS 2020 · 32 citations
