Server Cloud Scheduling
M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).
LibreCat: /record/50458
DOI: 10.1007/s00453-023-01189-x

Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
LibreCat: /record/31479
DOI: 10.1007/s00453-022-00978-0

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

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.
LibreCat: /record/48854
DOI: 10.1007/s00453-021-00838-3

Analysis of Agglomerative Clustering
M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).
LibreCat: /record/2976
DOI: 10.1007/s00453-012-9717-4

Kinetic Facility Location
B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.
LibreCat: /record/19011
DOI: 10.1007/s00453-008-9250-7

Denesting by Bounded Degree Radicals
J. Blömer, Algorithmica 28 (2002) 2–15.
LibreCat: /record/35857
DOI: 10.1007/s004530010028

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.
LibreCat: /record/18962
DOI: 10.1007/s00453-005-1197-3

Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.
LibreCat: /record/16699
DOI: 10.1007/bf01955042

Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
LibreCat: /record/16700
DOI: 10.1007/bf01940878