Rolf Niedermeier

Rolf Niedermeier (21 July 1966 – 19 March 2022) was a professor of computer science, known for his research in computational complexity theory, especially in parameterized complexity, graph theory, computational social choice, and social network analysis. Provided by Wikipedia
Showing 1 - 5 results of 5 for search 'Rolf Niedermeier', query time: 0.03s Refine Results
  1. 1
    Pattern-Guided k-Anonymity

    Pattern-Guided k-Anonymity by Rolf Niedermeier, André Nichterlein, Robert Bredereck

    Published 2013-10-01
    Get full text
    Article
  2. 2
    Co-Clustering under the Maximum Norm

    Co-Clustering under the Maximum Norm by Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier

    Published 2016-02-01
    Get full text
    Article
  3. 3
    The Parameterized Complexity of the Rainbow Subgraph Problem

    The Parameterized Complexity of the Rainbow Subgraph Problem by Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke

    Published 2015-02-01
    Get full text
    Article
  4. 4
    Efficient computation of optimal temporal walks under waiting-time constraints

    Efficient computation of optimal temporal walks under waiting-time constraints by Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier

    Published 2020-10-01
    Get full text
    Article
  5. 5
    <i>h</i>-Index manipulation by undoing merges

    <i>h</i>-Index manipulation by undoing merges by René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh

    Published 2020-01-01
    Get full text
    Article

Search Tools: