Bienkowski, M., Byrka, J., Korzeniowski, M., &; Meyer auf der Heide, F. (2009). Optimal algorithms for page migration in dynamic networks. Journal of Discrete Algorithms, 545–569.https://doi.org/10.1016/j.jda.2008.07.006 
LibreCat: /record/16398
DOI: 10.1016/j.jda.2008.07.006

Monien, B., &; Preis, R. (2006). Upper bounds on the Bisection Width of 3- and 4-regular Graphs. Journal of Discrete Algorithms, 475–498.https://doi.org/10.1016/j.jda.2005.12.009 
LibreCat: /record/16641
DOI: 10.1016/j.jda.2005.12.009

Juurlink, B., Kolman, P., Meyer auf der Heide, F., &; Rieping, I. (2003). Optimal broadcast on parallel locality models. Journal of Discrete Algorithms, 151–166.https://doi.org/10.1016/s1570-8667(03)00023-6 
LibreCat: /record/16482
DOI: 10.1016/s1570-8667(03)00023-6