Английская Википедия:Angelika Steger

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

Шаблон:Short description

Файл:Steger MFO13483 (cropped).jpg
Steger at Oberwolfach, 2011
Файл:Kahn Sudakov Steger MFO13483.jpg
Organizers of a 2011 MFO workshop on combinatorics, left to right: Jeff Kahn, Benjamin Sudakov, 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]

Books

Steger is the author of a German-language textbook on combinatorics:

and a monograph on the Steiner tree problem:

Recognition

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

Шаблон:Reflist

External links

Шаблон:Authority control