Rolf Niedermeier
Rolf Niedermeier | |
|---|---|
| Born | 21 July 1966 |
| Died | 19 March 2022 (aged 55) |
| Nationality | German |
| Alma mater | |
| Known for | Computer Science |
| Institutions | |
| Doctoral advisor | Klaus-Jörn Lange[1] |
| Website | www |
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
Theoretical Computer Science at the University of Jena.[6] Between 2010 and 2022 he led the Algorithmics and Computational Complexity group at the Technical University of Berlin. He supervised thirty Doctoral students, and headed eighteen DFG-funded research projects.[7]
Book
- Niedermeier, Rolf (2006). Invitation to Fixed-Parameter Algorithms. Oxford University Press. ISBN 978-0-198-56607-6.
References
- ^ "Mathematics Genealogy Project". Retrieved 2022-04-05.
- ^ "Home". Rolf Niedermeier. TU Berlin. Retrieved 2022-04-05.
- ISBN 9780191524158.
- ^ "Google scholar". Rolf Niedermeier. Retrieved 2022-04-05.
- ^ "Obituary for Prof. Dr. Rolf Niedermeier". University of Tübingen. Retrieved 2022-09-06.
- ^ "Algorithmen für harte Probleme". Informationsdienst Wissenschaft. Retrieved 2022-09-06.
- ^ "GEPRIS: Professor Dr. Rolf Niedermeier". German Research Foundation (DFG). Retrieved 2022-05-22.
External links
- Rolf Niedermeier publications indexed by Google Scholar
| International | |
|---|---|
| National | |
| Academics | |
| Other | |