Prof. Dr. Susanne Albers
Academic Career and Research Areas
Professor Albers’ (b. 1965) research interests are in the field of efficient algorithms. The focus of her scientific work is the design and analysis of online and approximation algorithms. Other focuses of her research work address the fields of algorithmic game theory and algorithm engineering.
Professor Albers studied mathematics, computer science and business administration at the University of Osnabrück. She then moved to Saarland University and the Max Planck Institute for Informatics, first as a PhD student and subsequently as a senior researcher. At the end of 1999 she was appointed associate professor at the University of Dortmund. From 2001 to 2009 she held a full professorship and chair in the Department of Computer Science at the University of Freiburg. Between 2009 and 2013 she was a full professor at the Humboldt University of Berlin and headed a research group focusing on algorithms and complexity. Professor Albers has been a professor at TUM since 2013. She is a member of Leopoldina, the German National Academy of Sciences, and the Academy of Sciences and Literature in Mainz. She is also a fellow of the German Informatics Society (GI).
- Advanced Grant, European Research Council (ERC) (2016)
- Gottfried Wilhelm Leibniz Prize (DFG) (2008)
- Otto Hahn Medal from the Max Planck Society (1993)
Key Publications (all publications)
Albers S, Eilts S, Even-Dar E, Mansour Y, Roditty L: "On Nash Equilibria for a Network Creation Game". ACM Trans. Economics and Comput. 2014; 2(1): 2:1-2:27.Abstract
Albers S: “Energy-efficient algorithms”. Communications of the ACM. 2010; 53(5): 86-96.Abstract
Albers S, Favrholdt LM, Giel O: “On paging with locality of reference”. Journal of Computer and System Sciences. 2005; 70(2): 145-175.Abstract
Albers S, Garg N, Leonardi S: “Minimizing stall time in single and parallel disk systems”. Journal of the ACM. 2000; 47(6): 969-986.Abstract
Albers, S: “Better bounds for online scheduling”. SIAM Journal on Computing. 1999; 29(2): 459-473.Abstract