- Susanne Albers, Helmut Alt, and Stefan Näher (editors): Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, volume 5760. Springer LNCS, 2009.
- Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, and Wolfgang Thomas (editors): Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming, volume 5555-5556. Springer LNCS, 2009.
- Susanne Albers and Jean-Yves Marion (editors): Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science. IBFI Schloss Dagstuhl, 2009. ISBN 978-3-939897-09-5.
- Susanne Albers and Antonios Antoniadis: Race to Idle: New Algorithms for Speed Scaling with a Sleep State. In: SODA 2012: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1266-1285, 2012.
- Susanne Albers, Antonios Antoniadis, and Gero Greiner: On multi-processor speed scaling with migration. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011, pages 279-288, 2011.
- Susanne Albers: Energy-efficient algorithms, Communications of the ACM, 53(5): 86-96, 2010.
- Susanne Albers: Algorithms for energy management. In: Proc. 5th International Computer Science Symposium in Russia (CSR10), volume 6072, pages 1-11, 2010. Springer LNCS 6072. Contribution of an invited talk.
- Susanne Albers: Online-Algorithmen: Was ist es wert, die Zukunft zu kennen?, Informatik-Spektrum, 33(5): 438-443, 2010. Special issue on Theoretical Computer Science dedicated to Ingo Wegener.
- Susanne Albers: New results on web caching with request reordering, Algorithmica, 58(2): 461-477, 2010.
- Susanne Albers and Tobias Jacobs: An experimental study of new and known online packet buffering algorithms, Algorithmica, 57(4): 725-746, 2010.
- Susanne Albers and Pascal Lenzner: On approximate Nash equilibria in network design. In: Proc. 6th Workshop on Internet & Network Economics (WINE 2010), pages 14-25, 2010. Springer LNCS 6484.
- Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtvech Rödl, and Mathias Schacht: Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions, SIAM Journal on Computing, 39(6): 2336-2362, 2010.
- Antonios Antoniadis and A. Lingas: Approximability of Edge Matching Puzzles. In: Proceedings of SOFSEM 2010: 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Ml'yn, Czech Republic, January 23-29, 2010, pages 153-164, 2010.
- Hiêp Hàn and Mathias Schacht: Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Journal of Combinatorial Theory (B), 100(3): 332-346, 2010.
- Jan Hladký and Mathias Schacht: Note on bipartite graph tilings, SIAM Journal on Discrete Mathematics, 24(2): 357-362, 2010.
- Yoshiharu Kohayakawa, Brendan Nagle, Vojtvech Rödl, and Mathias Schacht: Weak regularity and linear hypergraphs, Journal of Combinatorial Theory (B), 100(2): 151-160, 2010.
