Fair Coresets and Streaming Algorithms for Fair k -means M Schmidt, C Schwiegelshohn, C Sohler
Approximation and Online Algorithms: 17th International Workshop, WAOA 2019 …, 2020
172 * 2020 On coresets for logistic regression A Munteanu, C Schwiegelshohn, C Sohler, D Woodruff
Advances in Neural Information Processing Systems 31, 2018
122 2018 BICO: BIRCH Meets Coresets for k -Means Clustering H Fichtenberger, M Gillé, M Schmidt, C Schwiegelshohn, C Sohler
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013
95 2013 Coresets-methods and history: A theoreticians design pattern for approximation and streaming algorithms A Munteanu, C Schwiegelshohn
KI-Künstliche Intelligenz 32, 37-53, 2018
91 2018 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
80 2019 Sublinear estimation of weighted matchings in dynamic data streams M Bury, C Schwiegelshohn
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
77 2015 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
75 2021 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
64 2017 Towards optimal lower bounds for k-median and k-means coresets V Cohen-Addad, KG Larsen, D Saulpic, C Schwiegelshohn
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
54 2022 Fully dynamic consistent facility location V Cohen-Addad, NOD Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn
Advances in Neural Information Processing Systems 32, 2019
51 2019 The power of uniform sampling for coresets V Braverman, V Cohen-Addad, HCS Jiang, R Krauthgamer, ...
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
39 2022 Spectral relaxations and fair densest subgraphs A Anagnostopoulos, L Becchetti, A Fazzone, C Menghini, ...
Proceedings of the 29th ACM International Conference on Information …, 2020
33 * 2020 Diameter and k-center in sliding windows V Cohen-Addad, C Schwiegelshohn, C Sohler
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
33 2016 Improved Coresets for Euclidean V Cohen-Addad, K Green Larsen, D Saulpic, C Schwiegelshohn, ...
Advances in Neural Information Processing Systems 35, 2679-2694, 2022
32 2022 Improved coresets and sublinear algorithms for power means in euclidean spaces V Cohen-Addad, D Saulpic, C Schwiegelshohn
Advances in Neural Information Processing Systems 34, 21085-21098, 2021
31 2021 Maintaining an EDCS in general graphs: Simpler, density-sensitive and with worst-case time bounds F Grandoni, C Schwiegelshohn, S Solomon, A Uzrad
Symposium on Simplicity in Algorithms (SOSA), 12-23, 2022
28 2022 Algorithms for fair k-clustering with multiple protected attributes M Böhm, A Fazzone, S Leonardi, C Menghini, C Schwiegelshohn
Operations Research Letters 49 (5), 787-789, 2021
28 * 2021 Algorithms for Fair Team Formation in Online Labour Marketplaces✱ G Barnabò, A Fazzone, S Leonardi, C Schwiegelshohn
Companion Proceedings of The 2019 World Wide Web Conference, 484-490, 2019
28 2019 Structural results on matching estimation with applications to streaming M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ...
Algorithmica 81, 367-392, 2019
22 2019 Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k -Median V Cohen-Addad Viallat, F Grandoni, E Lee, C Schwiegelshohn
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
21 2023 