Scholar
Chris Schwiegelshohn
Google Scholar ID: X9Hl0LcAAAAJ
Aarhus University
Citations & Impact
Citations
1,373
H-index
20
i10-index
24
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- Published 'A (2 + ε)-Approximation Algorithm for Metric k-Median' at STOC 2025
- Published 'A Tight VC-Dimension Analysis of Clustering Coresets with Applications' at SODA 2025
- Published 'Fair Projections as a Means Towards Balanced Recommendations' at ACM Trans. Intell. Syst. Technol. 2025
- Published 'Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds' at FOCS 2024
- Published 'Optimal Coresets for Low-Dimensional Geometric Median' at ICML 2024
- Published 'Sparse Dimensionality Reduction Revisted' at ICML 2024
- Published 'Low-distortion clustering with ordinal and limited cardinal information' at AAAI 2024
- Published 'Settling Time vs. Accuracy Tradeoffs for Clustering Big Data' at SIGMOD 2024
- Published 'Adaptive Out-Orientations with Applications' at SODA 2024
- Published 'On Generalization Bounds for Projective Clustering' at NeurIPS 2023
- Published 'Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation' at FOCS 2023
- Published 'Optimal Sketching Bounds for Sparse Linear Regression' at AISTATS 2023
- Published 'Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median' at SODA 2023
- Published 'Improved Coresets for Euclidean k-Means' at NeurIPS 2022
- Published 'The Power of Uniform Sampling for Coresets' at FOCS 2022
- Published 'An Empirical Evaluation of k-Means Coresets' at ESA 2022, Best Paper Award
- Published 'Scalable Differentially Private Clustering via Hierarchically Separated Trees' at KDD 2022
- Published 'Towards Optimal Lower Bounds for k-median and k-means Coresets' at STOC 2022
- Published 'Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds' at SOSA 2022
- Published 'Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities' at Algorithmica 2021
Research Experience
- Previously worked at Sapienza University. Currently a faculty member of the Computer Science Department at Aarhus University.
Background
- Currently an Associate Professor in the Department of Computer Science at Aarhus University. Research interests include algorithm design, particularly online, streaming, approximation, and learning algorithms.
Co-authors