Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Efficient Algorithms for Model Checking Pushdown Systems

- J. Esparza, D. Hansel, P. Rossmanith, Stefan Schwoon
- Mathematics, Computer Science
- CAV
- 15 July 2000

We study model checking problems for pushdown systems and linear time logics. We show that the global model checking problem (computing the set of configurations, reachable or not, that violate the… Expand

Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems

- J. Gramm, R. Niedermeier, P. Rossmanith
- Mathematics, Computer Science
- Algorithmica
- 1 September 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… Expand

Determination of the sedimentation coefficient distribution by least-squares boundary modeling.

- P. Schuck, P. Rossmanith
- Chemistry, Medicine
- Biopolymers
- 15 October 2000

A new method is presented for the calculation of apparent sedimentation coefficient distributions g*(s) for the size-distribution analysis of polymers in sedimentation velocity experiments. Direct… Expand

An efficient fixed-parameter algorithm for 3-Hitting Set

- R. Niedermeier, P. Rossmanith
- Computer Science, Mathematics
- J. Discrete Algorithms
- 1 February 2003

Given a collection C of subsets of size three of a finite set S and a positive integer k, the 3-Hitting Set problem is to determine a subset S' ⊆ S with |S'| ≤ k, so that S' contains at least one… Expand

New Upper Bounds for Maximum Satisfiability

- R. Niedermeier, P. Rossmanith
- Mathematics, Computer Science
- J. Algorithms
- 1 July 2000

The (unweighted) Maximum Satisfiability problem (MaxSat) is: Given a Boolean formula in conjunctive normal form, find a truth assignment that satisfies the largest number of clauses. This paper… Expand

Exact Solutions for CLOSEST STRING and Related Problems

- J. Gramm, R. Niedermeier, P. Rossmanith
- Computer Science, Mathematics
- ISAAC
- 19 December 2001

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 same length and a positive integer d, find… Expand

A general method to speed up fixed-parameter-tractable algorithms

- R. Niedermeier, P. Rossmanith
- Mathematics, Computer Science
- Inf. Process. Lett.
- 29 February 2000

A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈L for some parameterized problem L. Many parameterized… Expand

Courcelle's theorem - A game-theoretic approach

- Joachim Kneis, A. Langer, P. Rossmanith
- Computer Science, Mathematics
- Discret. Optim.
- 19 April 2011

Courcelle's Theorem states that every problem definable in Monadic Second-Order logic can be solved in linear time on structures of bounded treewidth, for example, by constructing a tree automaton… Expand

A Fine-grained Analysis of a Simple Independent Set Algorithm

- Joachim Kneis, A. Langer, P. Rossmanith
- Computer Science
- FSTTCS
- 2009

We present a simple exact algorithm for the INDEPENDENT SET problem with a run- time bounded by O(1.2132 n poly(n)). This bound is obtained by, firstly, applying a new branching rule and, secondly,… Expand