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

Improving previous work, we give an O(2.270k + n) time algorithm for 3-Hitting Set, which is efficient for small values of k, a typical occurrence in some applications.Expand

We prove that MaxSat can be solved in time O(|F|·1.3803K), where |F| is the length of a formula F in conjunctive normal form and K is the number of clauses in F.Expand

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 that recognizes or rejects a tree decomposition of the structure.Expand

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 algorithms work in two stages: reduction to a problem kernel and bounded search tree.Expand