Rolf Niedermeier

Rolf Niedermeier (21 July 1966 – 19 March 2022) was a professor of computer science,[2] known for his research in computational complexity theory, especially in parameterized complexity,[3] graph theory, computational social choice, and social network analysis.[4]

Rolf Niedermeier
Born(1966-07-21)21 July 1966
Died19 March 2022(2022-03-19) (aged 55)
NationalityGerman
OccupationComputer Scientist, Professor
Scientific career
FieldsComputer Science
InstitutionsTechnical University of Berlin, University of Jena, University of Tübingen
Doctoral advisorKlaus-Jörn Lange[1]
Websitewww.akt.tu-berlin.de/menue/team/niedermeier_rolf/


Biography

Rolf Niedermeier studied Computer Science with Mathematics at the Technical University of Munich (1991 – 1994). He received his Ph.D. in Computer Science from the University of Tübingen in 1996. Subsequently, he did his post-doc at the Charles University in Prague in 1998 with Jaroslav Nešetřil. In 1999 he joined the University of Tübingen, where he became the head of Emmy Noether research group (2002 – 2004). From 2004 to 2010 he was a professor of Theoretical Computer Science at the University of Jena. Between 2010 and 2022 he led the Algorithmics and Computational Complexity group at the Technical University of Berlin. He graduated 20 PhD students.


References
  1. "Mathematics Genealogy Project". Retrieved 2022-04-05.
  2. "Home". Rolf Niedermeier. Retrieved 2022-04-05.
  3. Niedermeier, Rolf (1996). Invitation to Fixed-Parameter Algorithms. Oxford University Press. p. 316. ISBN 9780191524158.
  4. "Google scholar". Rolf Niedermeier. Retrieved 2022-04-05.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.