Chris Schwiegelshohn

Proc. ACM Manag. Data, 2024

Distributed Differentially Private Data Analytics via Secure Sketching.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

On Approximability of ℓ22 Min-Sum Clustering.

[BibT_eX]

[DOI]

CoRR, 2024

A Simple and Optimal Sublinear Algorithm for Mean Estimation.

[BibT_eX]

[DOI]

Beatrice Bertolotti

Matteo Russo

Aleksander Bjørn Grodt Christiansen

CoRR, 2024

Adaptive Out-Orientations with Applications.

[BibT_eX]

[DOI]

Chandra Chekuri

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Sparse Dimensionality Reduction Revisited.

[BibT_eX]

[DOI]

Mikael Møller Høgsgaard

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Optimal Coresets for Low-Dimensional Geometric Median.

[BibT_eX]

[DOI]

Peyman Afshani

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Low-Distortion Clustering with Ordinal and Limited Cardinal Information.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Optimally Interpolating between Ex-Ante Fairness and Welfare.

[BibT_eX]

[DOI]

CoRR, 2023

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

On Generalization Bounds for Projective Clustering.

[BibT_eX]

[DOI]

Maria Sofia Bucarelli

Matilde Fjeldsø Larsen

Mads Toftrup

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Fitting Data on a Grain of Rice.

[BibT_eX]

[DOI]

Aleksander B. G. Christiansen

Proceedings of the Algorithmic Aspects of Cloud Computing - 8th International Symposium, 2023

Optimal Sketching Bounds for Sparse Linear Regression.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Adaptive Out-Orientations with Applications.

[BibT_eX]

[DOI]

CoRR, 2022

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median.

[BibT_eX]

[DOI]

CoRR, 2022

Towards optimal lower bounds for k-median and k-means coresets.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds.

[BibT_eX]

[DOI]

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Improved Coresets for Euclidean k-Means.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Scalable Differentially Private Clustering via Hierarchically Separated Trees.

[BibT_eX]

[DOI]

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

The Power of Uniform Sampling for Coresets.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

An Empirical Evaluation of k-Means Coresets.

[BibT_eX]

[DOI]

Omar Ali Sheikh-Omar

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Algorithms for fair k-clustering with multiple protected attributes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities.

[BibT_eX]

[DOI]

Algorithmica, 2021

A new coreset framework for clustering.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Similarity Search for Dynamic Data Streams.

[BibT_eX]

[DOI]

Mara Sorella

IEEE Trans. Knowl. Data Eng., 2020

Fair Clustering with Multiple Colors.

[BibT_eX]

[DOI]

CoRR, 2020

Commitment and Slack for Online Load Maximization.

[BibT_eX]

[DOI]

Samin Jamalabadi

Uwe Schwiegelshohn

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Spectral Relaxations and Fair Densest Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019

Principal Fairness: \\ Removing Bias via Projections.

[BibT_eX]

[DOI]

CoRR, 2019

Maximizing Online Utilization with Commitment.

[BibT_eX]

[DOI]

Uwe Schwiegelshohn

CoRR, 2019

Structural Results on Matching Estimation with Applications to Streaming.

[BibT_eX]

[DOI]

Algorithmica, 2019

Algorithms for Fair Team Formation in Online Labour Marketplaces✱.

[BibT_eX]

[DOI]

Proceedings of the Companion of The 2019 World Wide Web Conference, 2019

Fair Coresets and Streaming Algorithms for Fair k-means.

[BibT_eX]

[DOI]

Melanie Schmidt

Christian Sohler

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Fully Dynamic Consistent Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Coresets-Methods and History: A Theoreticians Design Pattern for Approximation and Streaming Algorithms.

[BibT_eX]

[DOI]

Alexander Munteanu

Künstliche Intell., 2018

Fair Coresets and Streaming Algorithms for Fair k-Means Clustering.

[BibT_eX]

[DOI]

Melanie Schmidt

Christian Sohler

CoRR, 2018

Sketch 'Em All: Fast Approximate Similarity Search for Dynamic Data Streams.

[BibT_eX]

[DOI]

Mara Sorella

Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

On Coresets for Logistic Regression.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Random Projection to Preserve Patient Privacy.

[BibT_eX]

[DOI]

Proceedings of the CIKM 2018 Workshops co-located with 27th ACM International Conference on Information and Knowledge Management (CIKM 2018), 2018

2017

On algorithms for large-scale graph and clustering problems

[BibT_eX]

[DOI]

PhD thesis, 2017

One Size Fits All : Effectiveness of Local Search on Structured Data.

[BibT_eX]

[DOI]

CoRR, 2017

On Finding the Jaccard Center.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Algorithmen für datenintensive Graph- und Clusteringprobleme.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2017, 2017

On the Local Structure of Stable Clustering Instances.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Efficient Similarity Search in Dynamic Data Streams.

[BibT_eX]

[DOI]

CoRR, 2016

Diameter and k-Center in Sliding Windows.

[BibT_eX]

[DOI]

Christian Sohler

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Power of Migration for Online Slack Scheduling.

[BibT_eX]

[DOI]

Uwe Schwiegelshohn

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Sublinear Estimation of Weighted Matchings in Dynamic Data Streams.

[BibT_eX]

[DOI]