Chris Schwiegelshohn
Chris Schwiegelshohn
Verified email at cs.au.dk - Homepage
Title
Cited by
Cited by
Year
Sublinear estimation of weighted matchings in dynamic data streams
M Bury, C Schwiegelshohn
Algorithms-ESA 2015, 263-274, 2015
522015
BICO: BIRCH meets coresets for k-means clustering
H Fichtenberger, M Gillé, M Schmidt, C Schwiegelshohn, C Sohler
European Symposium on Algorithms, 481-492, 2013
492013
Fair Coresets and Streaming Algorithms for Fair k-means
M Schmidt, C Schwiegelshohn, C Sohler
International Workshop on Approximation and Online Algorithms, 232-251, 2019
42*2019
Coresets-methods and history: A theoreticians design pattern for approximation and streaming algorithms
A Munteanu, C Schwiegelshohn
KI-Künstliche Intelligenz 32 (1), 37-53, 2018
282018
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
282017
On coresets for logistic regression
A Munteanu, C Schwiegelshohn, C Sohler, D Woodruff
Advances in Neural Information Processing Systems, 6561-6570, 2018
192018
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
142019
Diameter and k-center in sliding windows
V Cohen-Addad, C Schwiegelshohn, C Sohler
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
102016
Fully dynamic consistent facility location
V Cohen-Addad, NOD Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn
Advances in Neural Information Processing Systems, 3255-3265, 2019
82019
Structural results on matching estimation with applications to streaming
M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ...
Algorithmica 81 (1), 367-392, 2019
72019
Principal fairness: removing bias via projections
A Anagnostopoulos, L Becchetti, A Fazzone, C Menghini, ...
arXiv preprint arXiv:1905.13651, 2019
62019
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
62012
The power of migration for online slack scheduling
C Schwiegelshohn, U Schwiegelshohn
24th Annual European Symposium on Algorithms (ESA 2016), 2016
42016
PEPPA: a project for evolutionary predator prey algorithms
H Blom, C Küch, K Losemann, C Schwiegelshohn
Proceedings of the 11th Annual Conference Companion on Genetic and …, 2009
42009
Fair Clustering with Multiple Colors
M Böhm, A Fazzone, S Leonardi, C Schwiegelshohn
arXiv preprint arXiv:2002.07892, 2020
22020
Sketch'Em All: Fast Approximate Similarity Search for Dynamic Data Streams
M Bury, C Schwiegelshohn, M Sorella
Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018
22018
Similarity search for dynamic data streams
M Bury, C Schwiegelshohn, M Sorella
IEEE Transactions on Knowledge and Data Engineering, 2019
12019
(1 + )-Approximate Incremental Matching in Constant Deterministic Amortized Time
F Grandoni, S Leonardi, P Sankowski, C Schwiegelshohn, S Solomon
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
12019
On finding the Jaccard center
M Bury, C Schwiegelshohn
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
12017
Spectral Relaxations and Fair Densest Subgraphs
A Anagnostopoulos, L Becchetti, A Fazzone, C Menghini, ...
Proceedings of the 29th ACM International Conference on Information …, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20