• Publications
  • Influence
Simulated Annealing
  • 944
  • 57
  • PDF
Efficient Algorithms for Model Checking Pushdown Systems
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 theExpand
  • 378
  • 34
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems
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 dExpand
  • 150
  • 24
Determination of the sedimentation coefficient distribution by least-squares boundary modeling.
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. DirectExpand
  • 266
  • 15
An efficient fixed-parameter algorithm for 3-Hitting Set
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 oneExpand
  • 152
  • 12
New Upper Bounds for Maximum Satisfiability
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 paperExpand
  • 96
  • 10
  • PDF
Exact Solutions for CLOSEST STRING and Related Problems
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, findExpand
  • 72
  • 9
A general method to speed up fixed-parameter-tractable algorithms
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 parameterizedExpand
  • 146
  • 7
  • PDF
Courcelle's theorem - A game-theoretic approach
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 automatonExpand
  • 54
  • 7
  • PDF
A Fine-grained Analysis of a Simple Independent Set Algorithm
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
  • 47
  • 7
  • PDF