Angelika Steger

Angelika Steger (born 1962)[1] is a mathematician and computer scientist whose research interests include graph theory, randomized algorithms, and approximation algorithms. She is a professor at ETH Zurich.[2]

Education and career

After earlier studies at the University of Freiburg and Heidelberg University, Steger earned a master's degree from Stony Brook University in 1985.[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, Diskrete Strukturen 1: Kombinatorik, Graphentheorie, Algebra (Springer, 2007)[4] and, with Prömel, a monograph on the Steiner tree problem, The Steiner tree problem: a tour through graphs, algorithms, and complexity (Vieweg, 2002).[5]


Steger was elected to the Academy of Sciences Leopoldina in 2007.[6] She was an invited speaker at the International Congress of Mathematicians in 2014.[7]


  1. Birth year from German National Library catalog entry, retrieved 2018-12-02.
  2. Faculty profile, ETHZ, retrieved 2016-07-03.
  3. Angelika Steger at the Mathematics Genealogy Project
  4. Review of Diskrete Strukturen by Markus Mathys, Spektrum der Wissenschaft (in German).
  5. Review of The Steiner tree problem by Ding-Zhu Du (2003), MR1891564.
  6. Member profile, Academy of Sciences Leopoldina, retrieved 2016-07-03.
  7. ICM Plenary and Invited Speakers since 1897, International Mathematical Union, retrieved 2016-07-03.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.