Author:
Englert Matthias,Westermann Matthias
Reference31 articles.
1. Aboud A (2008) Correlation clustering with penalties and approximating the reordering buffer management problem. Master’s thesis, Computer Science Department, The Technion—Israel Institute of Technology
2. Adamaszek A, Czumaj A, Englert M, Räcke H (2011) Almost tight bounds for reordering buffer management. In: Proceedings of the 43rd ACM symposium on theory of computing (STOC), San Jose, pp 607–616
3. Adamaszek A, Czumaj A, Englert M, Räcke H (2012) Optimal online buffer scheduling for block devices. In: Proceedings of the 44th ACM symposium on theory of computing (STOC), New York, pp 589–598
4. Albers S, Hellwig M (2012) On the value of job migration in online makespan minimization. In: Proceedings of the 20th European symposium on algorithms (ESA), Ljubljana, pp 84–95
5. Asahiro Y, Kawahara K, Miyano E (2012) NP-hardness of the sorting buffer problem on the uniform metric. Discret Appl Math 160(10–11):1453–1464