Megow, Nicole Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Günther, E., König, F., & Megow, N. (2010). Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width. In E. Bampis, & K. Jansen (Eds.), Approximation and Online Algorithms (pp. 170-181). Berlin: Springer. doi:10.1007/978-3-642-12450-1_16.
