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]
RolfNiedermeier (21 July 1966 – 19 March 2022) was a professor of computer science, known for his research in computational complexity theory, especially...
and implementation in C". Archived from the original on 2020-10-08. Niedermeier, Rolf (1996). "Recursively divisible problems". Algorithms and Computation...
LNCS 9235 MFCS 2016 Kraków, Poland Piotr Faliszewski Anca Muscholl RolfNiedermeier LIPIcs 58 MFCS 2017 Aalborg, Denmark Kim G. Larsen Hans L. Bodlaender...
have incrementally improved the klam value of this problem to 37. Niedermeier, Rolf (1998), "Some prospects for efficient fixed parameter algorithms"...
was RolfNiedermeier and Mike spent part of 2007 and most of 2008 at the Friedrich-Schiller-Universität in Jena, Germany, working with Niedermeier. Also...
8, Cambridge University Press, pp. 299–302, ISBN 9780521387071. Niedermeier, Rolf (2006), Invitation to Fixed Parameter Algorithms, Oxford Lecture Series...
classes of hypergraph duality and related problems", in Grohe, Martin; Niedermeier, Rolf (eds.), Parameterized and Exact Computation, Third International Workshop...
application to facility location problems. Journal of the ACM. p. 459-473. Niedermeier, Rolf (2006). Invitation to Fixed-Parameter Algorithms. Oxford University...