Server Cloud Scheduling
M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).

Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179.

Kinetic Facility Location
B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.

Denesting by Bounded Degree Radicals
J. Blömer, Algorithmica 28 (2002) 2–15.

I/O-Efficient Well-Separated Pair Decomposition and Applications
S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.

Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.

Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.