Maack, M., Meyer auf der Heide, F., &; Pukrop, S. (2023). Server Cloud Scheduling. Algorithmica.https://doi.org/10.1007/s00453-023-01189-x 

Baswana, S., Gupta, S., &; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica.https://doi.org/10.1007/s00453-022-00978-0 

Magerkohl, S., Zimmer, D., Tasche, L., Schaper, M., Urbanek, S., &; Ponick, B. (2021). Funktionsoptimierte AM-Gestaltung eines E-Rotors. Antriebstechnik - Zeitschrift Für Konstruktion, Entwicklung Und Anwendung von Antrieben Und Steuerungen , 60(6), 36–43.

Bossek, J., Neumann, F., Peng, P., &; Sudholt, D. (2021). Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica, 83(10), 3148–3179.https://doi.org/10.1007/s00453-021-00838-3 

Ackermann, M. R., Blömer, J., Kuntze, D., &; Sohler, C. (2014). Analysis of Agglomerative Clustering. Algorithmica, 69.https://doi.org/10.1007/s00453-012-9717-4 

Degener, B., Gehweiler, J., &; Lammersen, C. (2010). Kinetic Facility Location. Algorithmica, 57(3), 562–584.https://doi.org/10.1007/s00453-008-9250-7 

Blömer, J. (2002). Denesting by Bounded Degree Radicals. Algorithmica, 28(1), 2–15.https://doi.org/10.1007/s004530010028 

Govindarajan, S., Lukovszki, T., Maheshwari, A., &; Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614).https://doi.org/10.1007/s00453-005-1197-3 

Meyer auf der Heide, F., Oesterdiekhoff, B., &; Wanka, R. (1996). Strongly adaptive token distribution. Algorithmica, 413–427.https://doi.org/10.1007/bf01955042 

Karp, R. M., Luby, M., &; Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. Algorithmica, 517–542.https://doi.org/10.1007/bf01940878