#### Filter Results:

- Full text PDF available (192)

#### Publication Year

1992

2018

- This year (22)
- Last 5 years (112)
- Last 10 years (199)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Rolf Niedermeier
- MFCS
- 2004

Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of parameterized complexity for… (More)

- Jochen Alber, Michael R. Fellows, Rolf Niedermeier
- J. ACM
- 2004

Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In particular, we prove that… (More)

- Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
- Algorithmica
- 2002

Abstract. We present an algorithm that constructively produces a solution to the k -DOMINATING SET problem for planar graphs in time O(c^ \sqrt k n) , where c=4^ 6\sqrt 34 . To obtain this result, we… (More)

- Jens Gramm, Rolf Niedermeier, Peter Rossmanith
- Algorithmica
- 2003

CLOSEST STRING is one of the core problems in the field of consensus word analysis with particular importance for computational biology. Given k strings of the same length and a nonnegative integer d… (More)

- Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
- J. Comput. Syst. Sci.
- 2006

We show that the NP-complete FEEDBACK VERTEX SET problem, which asks for the smallest set of vertices to remove from a graph to destroy all cycles, is deterministically solvable in O(ck · m) time.… (More)

- Rolf Niedermeier, Peter Rossmanith
- J. Discrete Algorithms
- 2003

- Jiong Guo, Rolf Niedermeier
- SIGACT News
- 2007

To solve NP-hard problems, polynomial-time preprocessing is a natural and promising approach. Preprocessing is based on data reduction techniques that take a problem's input instance and try to… (More)

- Jiong Guo, Rolf Niedermeier
- ICALP
- 2007

We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several concrete case studies, giving… (More)

- Rolf Niedermeier, Peter Rossmanith
- J. Algorithms
- 2000

The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses. This paper… (More)

- Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger
- IJCAI
- 2011

The Borda voting rule is a positional scoring rule where, for m candidates, for every vote the first candidate receives m− 1 points, the second m− 2 points and so on. A Borda winner is a candidate… (More)