![]() | Up a level |
Baldini, Giulia ORCID: 0000-0002-5929-0271, Schmidt, Melanie
ORCID: 0000-0003-4856-3905, Zäske, Charlotte and Caldeira, Liliana
(2021).
Mapping Brain Clusterings to Reproduce Missing MRI Scans.
Technical Report.
Bercea, Ioana Oriana, Groß, Martin, Khuller, Samir, Kumar, Aounon, Rösner, Clemens, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie
ORCID: 0000-0003-4856-3905
(2019).
On the Cost of Essentially Fair Clusterings.
In:
Approximation, randomization, and combinatorial optimization: algorithms and techniques : APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA,
18:1-18:22.
Wadern:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
ISBN 9783959771252
Blömer, Johannes, Lammersen, Christiane, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Sohler, Christian
(2016).
Theoretical Analysis of the k-Means Algorithm - A Survey.
In:
Algorithm Engineering - Selected Results and Surveys,
pp. 81-116.
Cham:
Springer.
ISBN 978-3-319-49487-6
Dressler, Daniel, Groß, Martin, Kappmeier, Jan-Philipp, Kelter, Timon, Kulbatzki, Joscha, Plümpe, Daniel ORCID: 0000-0001-7381-912X, Schlechter, Gordon, Schmidt, Melanie
ORCID: 0000-0003-4856-3905, Skutella, Martin and Temme, Sylvie
(2010).
On the use of network flow techniques for assigning evacuees to exits.
Procedia Engineering, 3.
pp. 205-215.
Amsterdam [u.a.]:
Elsevier.
ISSN 1877-7058
Dressler, Daniel, Groß, Martin, Schlechter, Gordon, Schmidt, Melanie, Skutella, Martin, Temme, Sylvie, Kappmeier, Jan-Philipp W., Kelter, Timon, Kulbatzki, Joscha and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X
(2010).
On the Use of Network Flow Techniques for Assigning Evacuees to Exits.
Procedia Engineering, 3.
pp. 205-215.
Elsevier.
Feldman, Dan, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Sohler, Christian
(2020).
Turning Big Data Into Tiny Data: Constant-Size Coresets for k-Means, PCA, and Projective Clustering.
SIAM J. Comput., 49 (3).
pp. 601-657.
Philadelphia, Pa.:
SIAM.
ISSN 0097-5397
Feldman, Dan, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Sohler, Christian
(2013).
Turning big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering.
In:
Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 1434-1453.
New York:
SIAM.
ISBN 978-1-61197-251-1
Fichtenberger, Hendrik, Gillé, Marc, Schmidt, Melanie ORCID: 0000-0003-4856-3905, Schwiegelshohn, Chris and Sohler, Christian
(2013).
BICO: BIRCH Meets Coresets for k-Means Clustering.
In:
Algorithms - ESA 2013 : 21st annual European symposium ; proceedings,
pp. 481-492.
Berlin:
Springer.
ISBN 978-3-642-40449-8
Groß, Martin, Gupta, Anupam, Kumar, Amit, Matuschke, Jannik, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X, Schmidt, Melanie
ORCID: 0000-0003-4856-3905 and Verschae, José
(2018).
A Local-Search Algorithm for Steiner Forest.
In:
9th Innovations in Theoretical Computer Science Conference (ITCS 2018),
31:1-31:17.
Wadern:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
ISBN 978-3-95977-060-6
Groß, Martin, Kappmeier, Jan-Philipp W., Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie
ORCID: 0000-0003-4856-3905
(2012).
Approximating Earliest Arrival Flows in Arbitrary Networks.
In:
Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings,
pp. 551-562.
Berlin:
Springer.
ISBN 978-3-642-33090-2
Großwendt, Anna, Röglin, Heiko and Schmidt, Melanie ORCID: 0000-0003-4856-3905
(2019).
Analysis of Ward's Method.
In:
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 2939-2957.
New York:
SIAM.
ISBN 978-1-61197-548-2
Gupta, Anupam, Guruganesh, Guru and Schmidt, Melanie ORCID: 0000-0003-4856-3905
(2016).
Approximation Algorithms for Aversion k-Clustering via Local k-Median.
In:
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016),
66:1-66:13.
Wadern:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
ISBN 978-3-95977-013-2
Hellweg, Frank, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Sohler, Christian
(2010).
Testing Euclidean Spanners.
In:
Algorithms – ESA 2010 : 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings,
pp. 60-71.
Berlin:
Springer.
ISBN 978-3-642-15775-2
Hellweg, Frank, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Sohler, Christian
(2010).
Testing Euclidean Spanners.
In:
Property Testing - Current Research and Surveys,
pp. 306-311.
Berlin [u.a.]:
Springer.
ISBN 978-3-642-16367-8
Jansen, Thomas, Schmidt, Melanie ORCID: 0000-0003-4856-3905, Sudholt, Dirk, Witt, Carsten and Zarges, Christine
(2009).
Ingo Wegener.
Evolutionary Computation, 17 (1).
pp. 1-2.
Cambridge:
MIT Pr..
ISSN 1530-9304
Kappmeier, Jan-Philipp W., Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie
ORCID: 0000-0003-4856-3905
(2015).
Solving k-means on High-Dimensional Big Data.
In:
Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings,
pp. 259-270.
Cham:
Springer.
ISBN 978-3-319-20085-9
Lammersen, Christiane, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Sohler, Christian
(2015).
Probabilistic k-Median Clustering in Data Streams.
Theory of computing systems, 56 (1).
pp. 251-290.
New York:
Springer.
ISSN 1432-4350
Lammersen, Christiane, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Sohler, Christian
(2012).
Probabilistic k-Median Clustering in Data Streams.
In:
Approximation and Online Algorithms : WAOA 2012,
pp. 70-81.
Berlin:
Springer.
ISBN 978-3-642-38016-7
Lee, Euiwoong, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Wright, John
(2017).
Improved and simplified inapproximability for k-means.
Information processing letters, 120.
pp. 40-43.
Amsterdam:
Elsevier.
ISSN 1872-6119
Rösner, Clemens and Schmidt, Melanie ORCID: 0000-0003-4856-3905
(2018).
Privacy Preserving Clustering with Constraints.
In:
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018),
96:1-96:14.
Wadern:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
ISBN 978-3-95977-076-7
Schmidt, Melanie ORCID: 0000-0003-4856-3905
(2014).
Kernmengen und Datenstromalgorithmen für das k-means Problem und verwandte Zielfunktionen im Clustering.
In:
Ausgezeichnete Informatikdissertationen 2014,
pp. 261-270.
Bonn:
Gesellschaft für Informatik e.V. (GI).
ISBN 978-3-88579-419-6
Schmidt, Melanie ORCID: 0000-0003-4856-3905, Schwiegelshohn, Chris and Sohler, Christian
(2019).
Fair Coresets and Streaming Algorithms for Fair k-means.
In:
Approximation and online algorithms ; 17th international workshop, WAOA 2019, Munich, Germany, September 12-13, 2019 : revised selected papers,
pp. 232-251.
Cham:
Springer.
ISBN 978-3-030-39479-0
Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Skutella, Martin
(2010).
Earliest Arrival Flows in Networks with Multiple Sinks.
Electronic Notes in Discrete Mathematics, 36.
pp. 607-614.
Amsterdam:
Elsevier.
ISSN 1571-0653
Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Skutella, Martin
(2014).
Earliest arrival flows in networks with multiple sinks.
Discrete applied mathematics, 164.
pp. 320-327.
Amsterdam:
Elsevier.
ISSN 0166-218X