Vincent Cohen-Addad
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
88
Venues
14
Active years
2014–2026
Best venue rank
A*
Where they publish
Papers
88 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | COLT | Algorithmic Thinking Theory. | MohammadHossein Bateni, Vincent Cohen-Addad, Yuzhou Gu, Silvio Lattanzi, Simon Meierhans, Christopher Mohri |
| 2026 | ICALP | Static to Dynamic Correlation Clustering. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang |
| 2026 | SODA | An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the k-Means Problem. | Vincent Cohen-Addad, Fabian Kuhn, Zahra Parsaeian |
| 2026 | STOC | A (4+ϵ)-Approximation for Euclidean k-Means via Non-monotone Dual-Fitting. | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland |
| 2026 | STOC | Combinatorial Optimization using Comparison Oracles. | Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Guru Guruganesh, Euiwoong Lee, Renato Paes Leme, Debmalya Panigrahi, Madhusudhan Reddy Pittu, Jon Schneider, David P. Woodruff |
| 2026 | STOC | A Strong Linear Programming Relaxation for Weighted Tree Augmentation. | Vincent Cohen-Addad, Marina Drygala, Nathan Klein, Ola Svensson |
| 2025 | COLT | Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams. | Ainesh Bakshi, Vincent Cohen-Addad, Rajesh Jayaram, Sam Hopkins, Silvio Lattanzi |
| 2025 | FOCS | Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair. | Lorenzo Beretta, Vincent Cohen-Addad, Rajesh Jayaram, Erik Waingarten |
| 2025 | FOCS | An Improved Greedy Approximation for (Metric) k-Means. | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland |
| 2025 | ICLR | Fair Clustering in the Sliding Window Model. | Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Qiaoyuan Yang, Yubo Zhang, Samson Zhou |
| 2025 | ICML | Correlation Clustering Beyond the Pivot Algorithm. | Soheil Behnezhad, Moses Charikar, Vincent Cohen-Addad, Alma Ghafari, Weiyun Ma |
| 2025 | ICML | Scalable Private Partition Selection via Adaptive Weighting. | Justin Y. Chen, Vincent Cohen-Addad, Alessandro Epasto, Morteza Zadimoghaddam |
| 2025 | ICML | Algorithms and Hardness for Active Learning on Graphs. | Vincent Cohen-Addad, Silvio Lattanzi, Simon Meierhans |
| 2025 | ICML | REINFORCE Adversarial Attacks on Large Language Models: An Adaptive, Distributional, and Semantic Objective. | Simon Geisler, Tom Wollschlger, M. H. I. Abdalla, Vincent Cohen-Addad, Johannes Gasteiger, Stephan Gnnemann |
| 2025 | ICML | The Geometry of Refusal in Large Language Models: Concept Cones and Representational Independence. | Tom Wollschlger, Jannes Elstner, Simon Geisler, Vincent Cohen-Addad, Stephan Gnnemann, Johannes Gasteiger |
| 2025 | SODA | Embedding Planar Graphs into Graphs of Treewidth | Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk |
| 2025 | SODA | A Tight VC-Dimension Analysis of Clustering Coresets with Applications. | Vincent Cohen-Addad, Andrew Draganov, Matteo Russo, David Saulpic, Chris Schwiegelshohn |
| 2025 | STOC | Solving the Correlation Cluster LP in Sublinear Time. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang |
| 2025 | STOC | A (2+ε)-Approximation Algorithm for Metric k-Median. | Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson |
| 2025 | STOC | Almost Optimal PAC Learning for k-Means. | Vincent Cohen-Addad, Silvio Lattanzi, Chris Schwiegelshohn |
| 2024 | AISTATS | A Scalable Algorithm for Individually Fair k-Means Clustering. | MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi |
| 2024 | EMNLP | Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval. | Yanfei Chen, Jinsung Yoon, Devendra Singh Sachan, Qingze Wang, Vincent Cohen-Addad, MohammadHossein Bateni, Chen-Yu Lee, Tomas Pfister |
| 2024 | ESA | Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back (Invited Talk). | Vincent Cohen-Addad |
| 2024 | FOCS | Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds. | Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu, David Saulpic, Chris Schwiegelshohn |
| 2024 | ICML | Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. | Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder |
| 2024 | ICML | Perturb-and-Project: Differentially Private Similarities and Marginals. | Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Vahab Mirrokni, Peilin Zhong |
| 2024 | ICML | Multi-View Stochastic Block Models. | Vincent Cohen-Addad, Tommaso d'Orsi, Silvio Lattanzi, Rajai Nasser |
| 2024 | ICML | A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering. | Vincent Cohen-Addad, Tommaso d'Orsi, Aida Mousavifar |
| 2024 | ICML | Dynamic Correlation Clustering in Sublinear Update Time. | Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis |
| 2024 | SODA | A PTAS for | Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang |
| 2024 | STOC | Understanding the Cluster Linear Program for Correlation Clustering. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl |
| 2024 | STOC | Combinatorial Correlation Clustering. | Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang |
| 2023 | FOCS | Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. | Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman |
| 2023 | FOCS | Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. | Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk |
| 2023 | FOCS | Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation. | Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn |
| 2023 | FOCS | Streaming Euclidean k-median and k-means with o(log n) Space. | Vincent Cohen-Addad, David P. Woodruff, Samson Zhou |
| 2023 | ICML | Differentially Private Hierarchical Clustering with Provable Approximation Guarantees. | Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni |
| 2023 | SODA | Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to | Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn |
| 2023 | STOC | Streaming Euclidean MST to a Constant Factor. | Xi Chen, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten |
| 2022 | AISTATS | On Facility Location Problem in the Local Differential Privacy Model. | Vincent Cohen-Addad, Yunus Esencayi, Chenglin Fan, Marco Gaboardi, Shi Li, Di Wang |
| 2022 | COLT | Community Recovery in the Degree-Heterogeneous Stochastic Block Model. | Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic |
| 2022 | FOCS | The Power of Uniform Sampling for Coresets. | Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Robert Krauthgamer, Chris Schwiegelshohn, Mads Bech Toftrup, Xuan Wu |
| 2022 | FOCS | Fitting Metrics and Ultrametrics with Minimum Disagreements. | Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay |
| 2022 | FOCS | Correlation Clustering with Sherali-Adams. | Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman |
| 2022 | ICALP | Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. | Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi |
| 2022 | ICML | Online and Consistent Correlation Clustering. | Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis |
| 2022 | ICML | Massively Parallel k-Means Clustering for Perturbation Resilient Instances. | Vincent Cohen-Addad, Vahab S. Mirrokni, Peilin Zhong |
| 2022 | IPCO | A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. | Vincent Cohen-Addad, Tobias Mmke, Victor Verdugo |
| 2022 | KDD | Scalable Differentially Private Clustering via Hierarchically Separated Trees. | Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab Mirrokni, Andres Muoz Medina, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii |
| 2022 | PODC | A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees. | Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic |
| 2022 | SODA | An Improved Local Search Algorithm for k-Median. | Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic |
| 2022 | SODA | Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓ | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2022 | STOC | Bypassing the surface embedding: approximation schemes for network design in minor-free graphs. | Vincent Cohen-Addad |
| 2022 | STOC | Improved approximations for Euclidean | Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan |
| 2022 | STOC | Towards optimal lower bounds for k-median and k-means coresets. | Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn |
| 2021 | AISTATS | Online k-means Clustering. | Vincent Cohen-Addad, Benjamin Guedj, Varun Kanade, Guy Rom |
| 2021 | FOCS | Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. | Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup |
| 2021 | ICML | Correlation Clustering in Constant Many Parallel Rounds. | Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski |
| 2021 | ICML | Improving Ultrametrics Embeddings Through Coresets. | Vincent Cohen-Addad, Rmi de Joannis de Verclos, Guillaume Lagarde |
| 2021 | SODA | On Approximability of Clustering Problems Without Candidate Centers. | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2021 | STOC | A quasipolynomial (2 + | Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li |
| 2021 | STOC | A new coreset framework for clustering. | Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn |
| 2020 | FOCS | On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. | Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le |
| 2020 | ICML | On Efficient Low Distortion Ultrametric Embedding. | Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde |
| 2020 | SODA | Approximation Schemes for Capacitated Clustering in Doubling Metrics. | Vincent Cohen-Addad |
| 2020 | SODA | Instance-Optimality in the Noisy Value-and Comparison-Model. | Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu |
| 2020 | STOC | New hardness results for planar graph problems in p and an algorithm for sparsest cut. | Amir Abboud, Vincent Cohen-Addad, Philip N. Klein |
| 2019 | ESA | Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. | Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk |
| 2019 | FOCS | A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. | Vincent Cohen-Addad, Michal Pilipczuk, Marcin Pilipczuk |
| 2019 | FOCS | Inapproximability of Clustering in Lp Metrics. | Vincent Cohen-Addad, Karthik C. S. |
| 2019 | FOCS | Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. | David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann |
| 2019 | ICALP | Tight FPT Approximations for k-Median and k-Means. | Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li |
| 2019 | ICALP | On the Fixed-Parameter Tractability of Capacitated Clustering. | Vincent Cohen-Addad, Jason Li |
| 2019 | SODA | Lower bounds for text indexing with mismatches and differences. | Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya |
| 2019 | STOC | Oblivious dimension reduction for | Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, Chris Schwiegelshohn |
| 2018 | SODA | A Fast Approximation Scheme for Low-Dimensional | Vincent Cohen-Addad |
| 2018 | SODA | Hierarchical Clustering: Objective Functions and Algorithms. | Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu |
| 2018 | SODA | The Bane of Low-Dimensionality Clustering. | Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman |
| 2018 | SODA | A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. | Vincent Cohen-Addad, ric Colin de Verdire, Arnaud de Mesmay |
| 2018 | STOC | Fast fencing. | Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup |
| 2017 | AISTATS | Online Optimization of Smoothed Piecewise Constant Functions. | Vincent Cohen-Addad, Varun Kanade |
| 2017 | FOCS | Fast and Compact Exact Distance Oracle for Planar Graphs. | Vincent Cohen-Addad, Sren Dahlgaard, Christian Wulff-Nilsen |
| 2017 | FOCS | On the Local Structure of Stable Clustering Instances. | Vincent Cohen-Addad, Chris Schwiegelshohn |
| 2016 | FOCS | Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics. | Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu |
| 2016 | ICALP | Diameter and k-Center in Sliding Windows. | Vincent Cohen-Addad, Chris Schwiegelshohn, Christian Sohler |
| 2016 | STOC | Approximating connectivity domination in weighted bounded-genus graphs. | Vincent Cohen-Addad, ric Colin de Verdire, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld |
| 2015 | ESA | A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. | Vincent Cohen-Addad, Arnaud de Mesmay |
| 2014 | WAOA | Energy-Efficient Algorithms for Non-preemptive Speed-Scaling. | Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis |