| 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 | 134* | 2020 |
| 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 | 82 | 2013 |
| On coresets for logistic regression A Munteanu, C Schwiegelshohn, C Sohler, D Woodruff Advances in Neural Information Processing Systems 31, 2018 | 81 | 2018 |
| Sublinear estimation of weighted matchings in dynamic data streams M Bury, C Schwiegelshohn Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 71 | 2015 |
| 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 | 63 | 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 | 57 | 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 | 51 | 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 | 36 | 2021 |
| Fully dynamic consistent facility location V Cohen-Addad, NOD Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn Advances in Neural Information Processing Systems 32, 2019 | 31 | 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 | 26 | 2016 |
| 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 | 19 | 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 | 18* | 2020 |
| Structural results on matching estimation with applications to streaming M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ... Algorithmica 81, 367-392, 2019 | 17 | 2019 |
| 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 | 14 | 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 | 14* | 2021 |
| 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 | 11 | 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 | 11 | 2019 |
| The power of migration for online slack scheduling C Schwiegelshohn, U Schwiegelshohn 24th Annual European Symposium on Algorithms (ESA 2016), 2016 | 8 | 2016 |
| Solving the minimum string cover problem S Canzar, T Marschall, S Rahmann, C Schwiegelshohn 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012 | 8 | 2012 |
| 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 | 7 | 2022 |
