Summary
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 edit
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]
Books edit
Steger is the author of a German-language textbook on combinatorics:
- Steger, Angelika (2007). Diskrete Strukturen Bd. 1. Kombinatorik, Graphentheorie, Algebra / Angelika Steger (in German). Berlin. ISBN 978-3-540-46660-4. OCLC 196449143.
{{cite book}}: CS1 maint: location missing publisher (link)[4]
and a monograph on the Steiner tree problem:
Recognition edit
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.[6]
References edit
- ^ Birth year from German National Library catalog entry, retrieved 2018-12-02.
- ^ a b c Faculty profile, ETHZ, retrieved 2016-07-03.
- ^ Angelika Steger at the Mathematics Genealogy Project
- ^ Steger, Angelika (16 August 2002). "Diskrete Strukturen konkret erklärt zum Ersten". Spektrum der Wissenschaft (in German). Retrieved 23 November 2022.
- ^ Member profile, Academy of Sciences Leopoldina, retrieved 2016-07-03.
- ^ ICM Plenary and Invited Speakers since 1897 Archived 2017-11-24 at the Wayback Machine, International Mathematical Union, retrieved 2016-07-03.
External links edit
- Angelika Steger publications indexed by Google Scholar