Angelika Steger (born 1962)[1] is a mathematician and computer scientist whose research interests include graph theory, randomized algorithms, and approximation algorithms.
[2] She completed a doctorate from the University of Bonn in 1990, under the supervision of Hans Jürgen Prömel, with a dissertation on random combinatorial structures,[3] and earned her habilitation from Bonn in 1994.
After a visiting position at the University of Kiel, she became a professor at the University of Duisburg in 1995, moved to the Technical University of Munich in 1996, and moved again to ETH Zurich in 2003.
[2] Steger is the author of a German-language textbook on combinatorics: and a monograph on the Steiner tree problem: Steger was elected to the Academy of Sciences Leopoldina in 2007.
[5] She was an invited speaker at the International Congress of Mathematicians in 2014.