Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.”10.1145/3409385__ACM Transactions on Algorithms, vol. 16, no. 4, 2020, pp. 1–25, doi:10.1145/3409385.

Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.”10.1007/s11634-019-00366-7__Advances in Data Analysis and Classification, vol. 14, 2020, pp. 147–173, doi:10.1007/s11634-019-00366-7.

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”10.1016/j.tcs.2018.04.048__Theoretical Computer Science, vol. 754, Elsevier, 2019, pp. 88–106, doi:10.1016/j.tcs.2018.04.048.

Brauer, Sascha. Classification and Approximation of Geometric Location Problems. 2019, doi:10.17619/UNIPB/1-816.

Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.”10.4230/LIPIcs.ISAAC.2018.46__29th International Symposium on Algorithms and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:10.4230/LIPIcs.ISAAC.2018.46.

Bujna, Kathrin. Soft Clustering Algorithms - Theoretical and Practical Improvements. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-226.

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”10.1007/978-3-319-57586-5_11__Lecture Notes in Computer Science, edited by Dimitris Fotakis et al., vol. 10236, Springer International Publishing, 2017, pp. 116–27, doi:10.1007/978-3-319-57586-5_11.

Blömer, Johannes, et al. Hard-Clustering with Gaussian Mixture Models. Computing Research Repository, 2016.

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”10.1007/978-3-319-31750-2_24__Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.

Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.”10.1109/icdm.2016.0094__2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–10, doi:10.1109/icdm.2016.0094.

Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures. 2014.

Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.”10.1007/s00453-012-9717-4__Algorithmica, vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.

Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”10.1109/icpr.2014.253__2014 22nd International Conference on Pattern Recognition, IEEE, 2014, doi:10.1109/icpr.2014.253.

Kuntze, Daniel. Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements. Universität Paderborn, 2013.

Ackermann, Marcel Rudolf, et al. StreamKM++: A Clustering Algorithm for Data Streams. Vol. 17, ACM, 2012, doi:10.1145/2133803.2184450.

Ackermann, Marcel R., et al. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”10.1007/978-3-642-13731-0_21__SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.

Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.”10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4, 2010, pp. 59:1--59:26, doi:10.1145/1824777.1824779.

Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.

Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.