Niedermeier Rolf

Rolf Niedermeier

Information about the author Rolf Niedermeier will soon be added to the site.
Found 8 papers in total
The Parameterized Complexity of Local Search for TSP, More Refined
The Parameterized Complexity of Local Search for TSP, More Refined
2013
We extend previous work on the parameterized complexity of local search for the...
Exact combinatorial algorithms and experiments for finding maximum k‐plexes
Exact combinatorial algorithms and experiments for finding maximum k‐plexes
2012
We propose new practical algorithms to find maximum‐cardinality k...
Approximation and Tidying–A Problem Kernel for s‐Plex Cluster Vertex Deletion
Approximation and Tidying–A Problem Kernel for s‐Plex Cluster Vertex Deletion
2012
We introduce the NP‐hard graph‐based data clustering problem s ‐...
Aspects of a multivariate complexity analysis for Rectangle Tiling
Aspects of a multivariate complexity analysis for Rectangle Tiling
2011
We identify very restricted cases of Rectangle Tiling that remain NP‐hard....
Graph‐based data clustering with overlaps
Graph‐based data clustering with overlaps
2011
We introduce overlap cluster graph modification problems where, other than in most...
Separator-based data reduction for signed graph balancing
Separator-based data reduction for signed graph balancing
2010
Polynomial-time data reduction is a classical approach to hard graph problems....
Experiments on data reduction for optimal domination in networks
Experiments on data reduction for optimal domination in networks
2006
We present empirical results on computing optimal dominating sets in networks by means...
Tree decompositions of graphs: Saving memory in dynamic programming
Tree decompositions of graphs: Saving memory in dynamic programming
2006
We propose a simple and effective heuristic to save memory in dynamic programming on...
Papers per page: