Chris Schwiegelshohn
Ospite
Membro di
Ultime pubblicazioni
| Algorithms for fair k-clustering with multiple protected attributes on OPERATIONS RESEARCH LETTERS | 2021 |
| Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities on ALGORITHMICA | 2021 |
| Commitment and Slack for Online Load Maximization on Annual ACM Symposium on Parallelism in Algorithms and Architectures | 2020 |
| Fair Coresets and Streaming Algorithms for Fair k-means on Approximation and Online Algorithms | 2020 |
| Similarity Search for Dynamic Data Streams on IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING | 2020 |
| Spectral Relaxations and Fair Densest Subgraphs on International Conference on Information and Knowledge Management, Proceedings | 2020 |
| (1 + ε)-approximate incremental matching in constant deterministic amortized time on Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2019 |