Melanie Schmidt

Orcid: 0000-0003-4856-3905

Affiliations:
  • University of Düsseldorf, Germany
  • University of Cologne, Germany (former)
  • University of Bonn, Institute of Computer Science, Germany (former)
  • Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA (former)
  • TU Dortmund, Germany (PhD 2014)


According to our database1, Melanie Schmidt authored at least 35 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Upper and lower bounds for complete linkage in general metric spaces.
Mach. Learn., January, 2024

2023
MRI Scan Synthesis Methods based on Clustering and Pix2Pix.
CoRR, 2023

Approximating Fair k-Min-Sum-Radii in R<sup>d</sup>.
CoRR, 2023

Approximating Fair k-Min-Sum-Radii in Euclidean Space.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Faster Query Times for Fully Dynamic k-Center Clustering with Outliers.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Connected k-Center and k-Diameter Clustering.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2021
Coresets for constrained k-median and k-means clustering in low dimensional Euclidean space.
CoRR, 2021

Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020
Turning Big Data Into Tiny Data: Constant-Size Coresets for k-Means, PCA, and Projective Clustering.
SIAM J. Comput., 2020

Noisy, Greedy and Not so Greedy k-Means++.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Fully dynamic hierarchical diameter k-clustering and k-center.
CoRR, 2019

Sublinear data structures for short Fréchet queries.
CoRR, 2019

Fair Coresets and Streaming Algorithms for Fair k-means.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

Analysis of Ward's Method.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

On the Cost of Essentially Fair Clusterings.
Proceedings of the Approximation, 2019

2018
Fair Coresets and Streaming Algorithms for Fair k-Means Clustering.
CoRR, 2018

A Local-Search Algorithm for Steiner Forest.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Privacy Preserving Clustering with Constraints.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Improved and simplified inapproximability for k-means.
Inf. Process. Lett., 2017

2016
Theoretical Analysis of the k-Means Algorithm - A Survey.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Theoretical Analysis of the $k$-Means Algorithm - A Survey.
CoRR, 2016

Approximation Algorithms for Aversion k-Clustering via Local k-Median.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Probabilistic k-Median Clustering in Data Streams.
Theory Comput. Syst., 2015

Solving k-means on High-Dimensional Big Data.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014
Kernmengen und Datenstromalgorithmen für das k-means Problem und verwandte Zielfunktionen im Clustering.
Proceedings of the Ausgezeichnete Informatikdissertationen 2014, 2014

Coresets and streaming algorithms for the k-means problem and related clustering objectives.
PhD thesis, 2014

2013
PROBI: A Heuristic for the probabilistic k-median problem.
CoRR, 2013

Turning big data into tiny data: Constant-size coresets for <i>k</i>-means, PCA and projective clustering.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

BICO: BIRCH Meets Coresets for k-Means Clustering.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Approximating Earliest Arrival Flows in Arbitrary Networks.
Proceedings of the Algorithms - ESA 2012, 2012

2010
Earliest Arrival Flows in Networks with Multiple Sinks.
Electron. Notes Discret. Math., 2010

Testing Euclidean Spanners.
Proceedings of the Property Testing - Current Research and Surveys, 2010

Testing Euclidean Spanners.
Proceedings of the Algorithms, 2010

2009
Kreuzzahlrätsel: Sudokus waren gestern.
Inform. Spektrum, 2009

Ingo Wegener.
Evol. Comput., 2009


  Loading...