Langbahn Team – Weltmeisterschaft

Rolf Niedermeier

Rolf Niedermeier
Born(1966-07-21)21 July 1966
Died19 March 2022(2022-03-19) (aged 55)
NationalityGerman
Alma mater
Known forParameterized complexity
Scientific career
FieldsComputer Science
Institutions
Doctoral advisorKlaus-Jörn Lange[1]
Websitewww.akt.tu-berlin.de/menue/team/niedermeier_rolf/[dead link]

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]

Biography

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).[5] From 2004 to 2010 he was a professor of theoretical computer science at the University of Jena.[6] Between 2010 and 2022 he led the Algorithmics and Computational Complexity group at Technische Universität Berlin. He supervised thirty doctoral students, and headed eighteen DFG-funded research projects.[7]

Book

References

  1. ^ "Mathematics Genealogy Project". Retrieved 2022-04-05.
  2. ^ "Home". Rolf Niedermeier. TU Berlin. 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.
  5. ^ "Obituary for Prof. Dr. Rolf Niedermeier". University of Tübingen. Retrieved 2022-09-06.
  6. ^ "Algorithmen für harte Probleme". Informationsdienst Wissenschaft. Retrieved 2022-09-06.
  7. ^ "GEPRIS: Professor Dr. Rolf Niedermeier". German Research Foundation (DFG). Retrieved 2022-05-22.