Local Search Yields Approximation Schemes for -Means and -Median in Euclidean and Minor-Free Metrics V Cohen-Addad, PN Klein, C Mathieu SIAM Journal on Computing 48 (2), 644-667, 2019 | 104 | 2019 |

Hierarchical clustering: Objective functions and algorithms V Cohen-Addad, V Kanade, F Mallmann-Trenn, C Mathieu Journal of the ACM (JACM) 66 (4), 1-42, 2019 | 99 | 2019 |

Steinberg's conjecture is false V Cohen-Addad, M Hebdige, Z Li, E Salgado Journal of Combinatorial Theory, Series B 122, 452-456, 2017 | 43 | 2017 |

On the local structure of stable clustering instances V Cohen-Addad, C Schwiegelshohn 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 49-60, 2017 | 31 | 2017 |

Effectiveness of local search for geometric optimization V Cohen-Addad, C Mathieu 31st International Symposium on Computational Geometry (SoCG 2015), 2015 | 30* | 2015 |

Hierarchical clustering beyond the worst-case V Cohen-Addad, VN Kanade, F Mallmann-Trenn Neural Information Processing Systems, 2018 | 28 | 2018 |

Fast and compact exact distance oracle for planar graphs V Cohen-Addad, S Dahlgaard, C Wulff-Nilsen 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 28 | 2017 |

Energy-efficient algorithms for non-preemptive speed-scaling V Cohen-Addad, Z Li, C Mathieu, I Milis International Workshop on Approximation and Online Algorithms, 107-118, 2014 | 27 | 2014 |

Balanced centroidal power diagrams for redistricting V Cohen-Addad, PN Klein, NE Young Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances …, 2018 | 24* | 2018 |

The invisible hand of dynamic market pricing V Cohen-Addad, A Eden, M Feldman, A Fiat Proceedings of the 2016 ACM Conference on Economics and Computation, 383-400, 2016 | 23 | 2016 |

Tight FPT Approximations for -Median and -Means V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li arXiv preprint arXiv:1904.12334, 2019 | 19 | 2019 |

Oblivious dimension reduction for *k*-means: beyond subspaces and the Johnson-Lindenstrauss lemmaL Becchetti, M Bury, V Cohen-Addad, F Grandoni, C Schwiegelshohn Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 18 | 2019 |

A Fast Approximation Scheme for Low-Dimensional *k*-MeansV Cohen-Addad Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 17 | 2018 |

Online optimization of smoothed piecewise constant functions V Cohen-Addad, V Kanade Artificial Intelligence and Statistics, 412-420, 2017 | 17 | 2017 |

On the fixed-parameter tractability of capacitated clustering V Cohen-Addad, J Li 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 14 | 2019 |

Diameter and k-center in sliding windows V Cohen-Addad, C Schwiegelshohn, C Sohler 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 13 | 2016 |

Fully dynamic consistent facility location V Cohen-Addad, N Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn NeurIPS'19-33rd Conference on Neural Information Processing Systems, 2019 | 12 | 2019 |

Approximating connectivity domination in weighted bounded-genus graphs V Cohen-Addad, É Colin de Verdière, PN Klein, C Mathieu, ... Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 12 | 2016 |

Inapproximability of clustering in lp metrics V Cohen-Addad, CS Karthik 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 10 | 2019 |

The bane of low-dimensionality clustering V Cohen-Addad, A De Mesmay, E Rotenberg, A Roytman Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 8 | 2018 |