default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMelanie Schmidt 0001
Person information
- affiliation: Heinrich Heine University of Düsseldorf, Computer Science Department , Germany
- affiliation (former): University of Cologne, Department of Mathematics and Computer Science, Germany
- affiliation (former): University of Bonn, Institute of Computer Science, Germany
- affiliation (former): Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA
- affiliation (PhD 2014): TU Dortmund, Germany
Other persons with the same name
- Melanie Schmidt 0002 — Hamburg University of Technology
- Melanie Schmidt 0003 — Ruhr University Bochum
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Upper and lower bounds for complete linkage in general metric spaces. Mach. Learn. 113(1): 489-518 (2024)- [c20]Giulia Baldini
, Melanie Schmidt, Charlotte Zäske, Liliana Lourenco Caldeira:
MRI Scan Synthesis Methods Based on Clustering and Pix2Pix. AIME (2) 2024: 109-125 - [c19]Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt:
Local Search k-means++ with Foresight. SEA 2024: 7:1-7:20 - [i19]Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt:
Local Search k-means++ with Foresight. CoRR abs/2406.02739 (2024) - 2023
- [c18]Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. ICALP 2023: 50:1-50:20 - [c17]Leyla Biabani, Annika Hennes, Morteza Monemizadeh, Melanie Schmidt:
Faster Query Times for Fully Dynamic k-Center Clustering with Outliers. NeurIPS 2023 - [c16]Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla:
Approximating Fair k-Min-Sum-Radii in Euclidean Space. WAOA 2023: 119-133 - [i18]Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla:
Approximating Fair k-Min-Sum-Radii in Rd. CoRR abs/2309.00834 (2023) - [i17]Giulia Baldini, Melanie Schmidt, Charlotte Zäske, Liliana Lourenco Caldeira:
MRI Scan Synthesis Methods based on Clustering and Pix2Pix. CoRR abs/2312.05176 (2023) - 2022
- [i16]Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. CoRR abs/2211.02176 (2022) - 2021
- [c15]Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Upper and Lower Bounds for Complete Linkage in General Metric Spaces. APPROX-RANDOM 2021: 18:1-18:22 - [c14]Anna Arutyunova, Melanie Schmidt:
Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means. STACS 2021: 7:1-7:17 - [i15]Melanie Schmidt, Julian Wargalla:
Coresets for constrained k-median and k-means clustering in low dimensional Euclidean space. CoRR abs/2106.07319 (2021) - 2020
- [j7]Dan Feldman, Melanie Schmidt, Christian Sohler:
Turning Big Data Into Tiny Data: Constant-Size Coresets for k-Means, PCA, and Projective Clustering. SIAM J. Comput. 49(3): 601-657 (2020) - [c13]Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not so Greedy k-Means++. ESA 2020: 18:1-18:21 - [i14]Anna Arutyunova, Melanie Schmidt:
Achieving anonymity via weak lower bound constraints for k-median and k-means. CoRR abs/2009.03078 (2020)
2010 – 2019
- 2019
- [c12]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the Cost of Essentially Fair Clusterings. APPROX-RANDOM 2019: 18:1-18:22 - [c11]Anna Großwendt, Heiko Röglin, Melanie Schmidt:
Analysis of Ward's Method. SODA 2019: 2939-2957 - [c10]Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler:
Fair Coresets and Streaming Algorithms for Fair k-means. WAOA 2019: 232-251 - [i13]Anne Driemel, Ioannis Psarros, Melanie Schmidt:
Sublinear data structures for short Fréchet queries. CoRR abs/1907.04420 (2019) - [i12]Anna Großwendt, Heiko Röglin, Melanie Schmidt:
Analysis of Ward's Method. CoRR abs/1907.05094 (2019) - [i11]Melanie Schmidt, Christian Sohler:
Fully dynamic hierarchical diameter k-clustering and k-center. CoRR abs/1908.02645 (2019) - [i10]Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not So Greedy k-means++. CoRR abs/1912.00653 (2019) - 2018
- [c9]Clemens Rösner, Melanie Schmidt:
Privacy Preserving Clustering with Constraints. ICALP 2018: 96:1-96:14 - [c8]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. ITCS 2018: 31:1-31:17 - [i9]Clemens Rösner, Melanie Schmidt:
Privacy preserving clustering with constraints. CoRR abs/1802.02497 (2018) - [i8]Dan Feldman, Melanie Schmidt, Christian Sohler:
Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering. CoRR abs/1807.04518 (2018) - [i7]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the cost of essentially fair clusterings. CoRR abs/1811.10319 (2018) - [i6]Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler:
Fair Coresets and Streaming Algorithms for Fair k-Means Clustering. CoRR abs/1812.10854 (2018) - 2017
- [j6]Euiwoong Lee, Melanie Schmidt, John Wright:
Improved and simplified inapproximability for k-means. Inf. Process. Lett. 120: 40-43 (2017) - [i5]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. CoRR abs/1707.02753 (2017) - 2016
- [c7]Anupam Gupta, Guru Guruganesh, Melanie Schmidt:
Approximation Algorithms for Aversion k-Clustering via Local k-Median. ICALP 2016: 66:1-66:13 - [p3]Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Theoretical Analysis of the k-Means Algorithm - A Survey. Algorithm Engineering 2016: 81-116 - [i4]Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Theoretical Analysis of the $k$-Means Algorithm - A Survey. CoRR abs/1602.08254 (2016) - 2015
- [j5]Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Probabilistic k-Median Clustering in Data Streams. Theory Comput. Syst. 56(1): 251-290 (2015) - [c6]Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Solving k-means on High-Dimensional Big Data. SEA 2015: 259-270 - [i3]Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Solving k-means on High-dimensional Big Data. CoRR abs/1502.04265 (2015) - [i2]Euiwoong Lee, Melanie Schmidt, John Wright:
Improved and Simplified Inapproximability for k-means. CoRR abs/1509.00916 (2015) - 2014
- [b1]Melanie Schmidt:
Coresets and streaming algorithms for the k-means problem and related clustering objectives. Universität Dortmund, 2014, pp. I-XII, 1-257 - [j4]Melanie Schmidt, Martin Skutella:
Earliest arrival flows in networks with multiple sinks. Discret. Appl. Math. 164: 320-327 (2014) - [p2]Melanie Schmidt:
Kernmengen und Datenstromalgorithmen für das k-means Problem und verwandte Zielfunktionen im Clustering. Ausgezeichnete Informatikdissertationen 2014: 261-270 - 2013
- [c5]Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler:
BICO: BIRCH Meets Coresets for k-Means Clustering. ESA 2013: 481-492 - [c4]Dan Feldman, Melanie Schmidt, Christian Sohler:
Turning big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering. SODA 2013: 1434-1453 - [i1]Hendrik Fichtenberger, Melanie Schmidt:
PROBI: A Heuristic for the probabilistic k-median problem. CoRR abs/1309.5781 (2013) - 2012
- [c3]Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Approximating Earliest Arrival Flows in Arbitrary Networks. ESA 2012: 551-562 - [c2]Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Probabilistic k-Median Clustering in Data Streams. WAOA 2012: 70-81 - 2010
- [j3]Melanie Schmidt, Martin Skutella:
Earliest Arrival Flows in Networks with Multiple Sinks. Electron. Notes Discret. Math. 36: 607-614 (2010) - [c1]Frank Hellweg, Melanie Schmidt, Christian Sohler:
Testing Euclidean Spanners. ESA (1) 2010: 60-71 - [p1]Frank Hellweg, Melanie Schmidt, Christian Sohler:
Testing Euclidean Spanners. Property Testing 2010: 306-311
2000 – 2009
- 2009
- [j2]Thomas Jansen, Melanie Schmidt, Dirk Sudholt, Carsten Witt, Christine Zarges:
Ingo Wegener. Evol. Comput. 17(1): 1-2 (2009) - [j1]Martin Groß, Daniel Plümpe, Melanie Schmidt:
Kreuzzahlrätsel: Sudokus waren gestern. Inform. Spektrum 32(6): 538-545 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
