Angelika Steger
From Wikipedia, the free encyclopedia
.jpg)
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]
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:
- 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:
- Prömel, Hans Jürgen; Steger, Angelika (2002). The Steiner Tree Problem : a Tour through Graphs, Algorithms, and Complexity. Wiesbaden: Vieweg+Teubner Verlag. ISBN 978-3-322-80291-0. OCLC 851804416.
