| 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 | 257 | 2019 |
| 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 | 152 | 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 | 72 | 2017 |
| Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma L Becchetti, M Bury, V Cohen-Addad, F Grandoni, C Schwiegelshohn Proceedings of the 51st annual ACM SIGACT symposium on theory of computing …, 2019 | 64 | 2019 |
| Tight FPT Approximations for -Median and -Means V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li arXiv preprint arXiv:1904.12334, 2019 | 58 | 2019 |
| 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 | 54 | 2017 |
| A new coreset framework for clustering V Cohen-Addad, D Saulpic, C Schwiegelshohn Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 52 | 2021 |
| Hierarchical clustering beyond the worst-case V Cohen-Addad, V Kanade, F Mallmann-Trenn Advances in Neural Information Processing Systems 30, 2017 | 52 | 2017 |
| On the fixed-parameter tractability of capacitated clustering V Cohen-Addad, J Li arXiv preprint arXiv:2208.14129, 2022 | 46 | 2022 |
| Balanced centroidal power diagrams for redistricting V Cohen-Addad, PN Klein, NE Young Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances …, 2018 | 43* | 2018 |
| Subquadratic high-dimensional hierarchical clustering A Abboud, V Cohen-Addad, H Houdrougé Advances in Neural Information Processing Systems 32, 2019 | 41 | 2019 |
| 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 | 41 | 2017 |
| Effectiveness of local search for geometric optimization V Cohen-Addad, C Mathieu 31st International Symposium on Computational Geometry (SoCG 2015), 2015 | 41* | 2015 |
| 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 | 39 | 2016 |
| A Fast Approximation Scheme for Low-Dimensional k-Means V Cohen-Addad Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 36 | 2018 |
| Fully dynamic consistent facility location V Cohen-Addad, NOD Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn Advances in Neural Information Processing Systems 32, 2019 | 34 | 2019 |
| Near-linear time approximation schemes for clustering in doubling metrics V Cohen-Addad, AE Feldmann, D Saulpic Journal of the ACM (JACM) 68 (6), 1-34, 2021 | 33 | 2021 |
| Inapproximability of clustering in lp metrics V Cohen-Addad, CS Karthik 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 33 | 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 | 31 | 2016 |
| Online k-means clustering V Cohen-Addad, B Guedj, V Kanade, G Rom International Conference on Artificial Intelligence and Statistics, 1126-1134, 2021 | 30 | 2021 |
Chris SchwiegelshohnAarhus UniversityVerified email at cs.au.dk
