Rolf Niedermeier
German professor of computer science (1966–2022)
From Wikipedia, the free encyclopedia
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 | 21 July 1966 |
| Died | 19 March 2022 (aged 55) |
| Alma mater | |
| Known for | Parameterized complexity |
| Scientific career | |
| Fields | Computer Science |
| Institutions | |
| Doctoral advisor | Klaus-Jörn Lange[1] |
| Website | www |
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
- Niedermeier, Rolf (2006). Invitation to Fixed-Parameter Algorithms. Oxford University Press. doi:10.1093/acprof:oso/9780198566076.001.0001. ISBN 978-0-198-56607-6.
