View source for Melanie Schmidt

{{Short description|German computer scientist}}
{{Use dmy dates|cs1-dates=ly|date=December 2023}}
{{Use list-defined references|date=December 2023}}
'''Melanie Schmidt''' is a German computer scientist whose research involves algorithms for [[cluster analysis]], including [[approximation algorithm]]s, [[coreset]]s, [[Fairness (machine learning)|algorithmic fairness]], and [[inapproximability]].{{r|appointed}} She holds the chair for Algorithms and Data Structures in the Computer Science Department at [[Heinrich Heine University Düsseldorf]].{{r|chair}}

==Education and career==
Schmidt earned a diploma in computer science in 2009 through study at both the [[Technical University of Dortmund]] and the [[University of Verona]] in Italy.{{r|appointed}} She continued at the Technical University of Dortmund for doctoral study in computer science, and completed her doctorate ([[Dr. rer. nat.]]) in 2014 with the dissertation ''Coresets and streaming algorithms for the {{nowrap|<math>k</math>-means}} problem and related clustering objectives'', jointly supervised by Christian Sohler, {{ill|Johannes Blömer|de}}, and Gernot Fink.{{r|appointed|mg|diss}}

After postdoctoral research at [[Carnegie Mellon University]] in the US and at the [[University of Bonn]], she took a position at the [[University of Cologne]] in 2019 as junior professor of machine learning. She moved to her present position in Düsseldorf in 2021.{{r|appointed}}

==Selected publications==
*{{citation
 | last1 = Lee | first1 = Euiwoong
 | last2 = Schmidt | first2 = Melanie
 | last3 = Wright | first3 = John
 | doi = 10.1016/J.IPL.2016.11.009
 | journal = Information Processing Letters
 | pages = 40–43
 | title = Improved and simplified inapproximability for {{nowrap|<math>k</math>-means}}
 | volume = 120
 | year = 2017| arxiv = 1509.00916
 }}
*{{citation
 | last1 = Rösner | first1 = Clemens
 | last2 = Schmidt | first2 = Melanie
 | editor1-last = Chatzigiannakis | editor1-first = Ioannis
 | editor2-last = Kaklamanis | editor2-first = Christos
 | editor3-last = Marx | editor3-first = Dániel
 | editor4-last = Sannella | editor4-first = Donald
 | contribution = Privacy preserving clustering with constraints
 | doi = 10.4230/LIPICS.ICALP.2018.96
 | pages = 96:1–96:14
 | publisher = Schloss Dagstuhl – Leibniz-Zentrum für Informatik
 | series = LIPIcs
 | title = 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9–13, 2018, Prague, Czech Republic
 | volume = 107
 | year = 2018| doi-access = free
 | s2cid = 3343460
 }}
*{{citation
 | last1 = Schmidt | first1 = Melanie
 | last2 = Schwiegelshohn | first2 = Chris
 | last3 = Sohler | first3 = Christian
 | editor1-last = Bampis | editor1-first = Evripidis
 | editor2-last = Megow | editor2-first = Nicole
 | contribution = Fair coresets and streaming algorithms for fair {{nowrap|<math>k</math>-means}}
 | doi = 10.1007/978-3-030-39479-0_16
 | pages = 232–251
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Approximation and Online Algorithms – 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers
 | volume = 11926
 | year = 2019| isbn = 978-3-030-39478-3
 | s2cid = 57189168
 }}
*{{citation
 | last1 = Feldman | first1 = Dan
 | last2 = Schmidt | first2 = Melanie
 | last3 = Sohler | first3 = Christian
 | doi = 10.1137/18M1209854
 | issue = 3
 | journal = SIAM Journal on Computing
 | pages = 601–657
 | title = Turning big data into tiny data: Constant-size coresets for {{nowrap|<math>k</math>-means,}} PCA, and projective clustering
 | volume = 49
 | year = 2020| arxiv = 1807.04518
 }}; previously announced at the 2013 ACM–SIAM Symposium on Discrete Algorithms (SODA)

==References==
{{reflist|refs=

<ref name=appointed>{{citation|url=https://www.math-nat-fak.hhu.de/aktuelles-1/aktuelles-detailansicht/dr-melanie-schmidt-zur-w2-professorin-in-der-informatik-an-der-hhu-ernannt|title=Mathematisch-Naturwissenschaftliche Fakultät: Dr. Melanie Schmidt zur W2-Professorin in der Informatik an der HHU ernannt|language=de|date=1 December 2021|work=HHU Math.-Nat. Faculty News|publisher=Heinrich Heine University Düsseldorf|access-date=2023-12-24}}</ref>

<ref name=chair>{{citation|url=https://www.algo.hhu.de/en/research-groups/algorithms-and-data-structures/our-team-1|title=Our team|work=Algorithms and Data Structures|publisher=Heinrich Heine University Düsseldorf|access-date=2023-12-24}}</ref>

<ref name=diss>{{citation|title=Coresets and streaming algorithms for the {{nowrap|<math>k</math>-means}} problem and related clustering objectives|first=Melanie|last=Schmidt|hdl=2003/34099|doi=10.17877/DE290R-43|publisher=Technical University of Dortmund|year=2014|type=Doctoral dissertation}}</ref>

<ref name=mg>{{mathgenealogy|192868}}; note that as of 2023-12-24 this incorrectly lists [[Ingo Wegener]] (died 2008) as an advisor instead of Gernot Fink.</ref>

}}

==External links==
*[http://melanie-schmidt.de/ Home page]
*{{Google Scholar id|OGQnf_IAAAAJ}}

{{Authority control|state=collapsed}}

{{DEFAULTSORT:Schmidt, Melanie}}
[[Category:Year of birth missing (living people)]]
[[Category:Living people]]
[[Category:German computer scientists]]
[[Category:German women computer scientists]]
[[Category:Researchers in geometric algorithms]]
[[Category:Technical University of Dortmund alumni]]
[[Category:University of Verona alumni]]
[[Category:Academic staff of the University of Cologne]]
[[Category:Academic staff of Heinrich Heine University Düsseldorf]]