Pubblicazioni di Schwiegelshohn Chris

2021

Bury M., Gentili M., Schwiegelshohn C., Sorella M.

2020

Jamalabadi S., Schwiegelshohn C., Schwiegelshohn U.
Commitment and Slack for Online Load Maximization. Annual ACM Symposium on Parallelism in Algorithms and Architectures 2020: 339-348

Schmidt M., Schwiegelshohn C., Sohler C.
Fair Coresets and Streaming Algorithms for Fair k-means. Approximation and Online Algorithms 2020: 232-251

Bury Marc, Schwiegelshohn Chris, Sorella Mara
Similarity Search for Dynamic Data Streams. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2020: 2241-2253

Anagnostopoulos A., Becchetti L., Fazzone A., Menghini C., Schwiegelshohn C.
Spectral Relaxations and Fair Densest Subgraphs. International Conference on Information and Knowledge Management, Proceedings 2020: 35-44

2019

Grandoni F., Leonardi S., Sankowski P., Schwiegelshohn C., Solomon S.
(1 + ε)-approximate incremental matching in constant deterministic amortized time. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms 2019: 1886-1898

Barnabo G., Leonardi S., Fazzone A., Schwiegelshohn C.
Algorithms for fair team formation in online labour marketplaces. WWW '19: Companion Proceedings of The 2019 World Wide Web Conference 2019: 484-490

Cohen-Addad Vincent, Hjuler Niklas Oskar D., Parotsidis Nikos, Saulpic David, SCHWIEGELSHOHN CHRIS RENE
Fully Dynamic Consistent Facility Location. Advances in Neural Information Processing Systems 33 (NIPS 2019) 2019: 3255-3265

Becchetti Luca, Bury Marc, Cohen-Addad Vincent, Grandoni Fabrizio, Schwiegelshohn Chris Rene
Oblivious Dimension Reduction fork-Means:Beyond Subspaces and the Johnson-Lindenstrauss Lemma. STOC '19 51st Annual ACM SIGACT Symposium on the Theory of Computing 2019: 1039-1050

Munteanu A., Schwiegelshohn C., Sohler C., Woodruff D. P.
On coresets for logistic regression. Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI) 2019: 267-268

Anagnostopoulos A., Angeletti F., Arcangeli F., Schwiegelshohn C., Vitaletti A.
Random projection to preserve patient privacy. CIKM 2018 Workshops at CIKM 2018 2019: -

Bury M., Grigorescu E., McGregor A., Monemizadeh M., Schwiegelshohn C., Vorotnikova S., Zhou S.

2018

Munteanu Alexander, Schwiegelshohn Chris
Munteanu A., Sohler C., Schwiegelshohn C., Woodruff D. P.
On coresets for logistic regression. NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing Systems 2018: 6561-6570

Anagnostopoulos A., Angeletti F., Arcangeli F., Schwiegelshohn C., Vitaletti A.
Anagnostopoulos A., Angeletti F., Arcangeli F., Schwiegelshohn C., Vitaletti A.
Random Projection to Preserve Patient Privacy. ACM 1st International Workshop on Knowledge Management for Healthcare (KMH2018) 2018: -

Bury Marc, Schwiegelshohn Chris Rene, Sorella Mara
Sketch 'Em All: Fast Approximate Similarity Search for Dynamic Data Streams. Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM 2018, Marina Del Rey, CA, USA, February 5-9, 2018 2018: 72-80

2017

Bury Marc, Schwiegelshohn CHRIS RENE
On finding the Jaccard center. 44th International Colloquium on Automata, Languages, and Programming, ICALP 201 2017: -

Cohen-Addad Vincent, Schwiegelshohn Chris
On the local structure of stable clustering instances. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) 2017: 49-60

2016

Cohen-Addad Vincent, Schwiegelshohn Chris, Sohler Christian
Diameter and k-center in sliding windows. 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 2016: -

Schwiegelshohn Chris, Schwiegelshohn Uwe
The power of migration for online slack scheduling. 24th Annual European Symposium on Algorithms (ESA 2016) 2016: -

2015

Bury Marc, Schwiegelshohn Chris
Sublinear estimation of weighted matchings in dynamic data streams. Algorithms –ESA 2015. 23rd Annual European SymposiumPatras, Greece, September 14–16, 2015Proceedings 2015: 263-274

2013

Fichtenberger Hendrik, Gillé Marc, Schmidt Melanie, Schwiegelshohn Chris, Sohler Christian
BICO: BIRCH meets coresets for k-means clustering. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2013: 481-492

2012

Canzar Stefan, Marschall Tobias, Rahmann Sven, Schwiegelshohn Chris
Solving the Minimum String Cover Problem. Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012 2012: 75-83

2009

Blom Hendrik, Küch Christiane, Losemann Katja, Schwiegelshohn Chris
PEPPA: a project for evolutionary predator prey algorithms. Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, Companion Material 2009: 1993-1998

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma