Kernelization is a strong and widely-applied technique in parameterized complexity. In a nutshell, a kernelization algorithm, or simply a kernel, is a polynomial-time transformation that transforms… (More)

For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-Dominating Set, essentially no better algorithm is presently known than the one which tries all possible… (More)

For many fixed-parameter problems that are trivially solvable in polynomial-time, such as kDOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible… (More)

For many fixed-parameter problems that are trivially soluable in polynomial time, such as (k-)DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible… (More)

In this paper we give a programmatic overview of parame-terized computational complexity in the broad context of the problem of coping with computational intractability. We give some examples of how… (More)

How random is a real? Given two reals, which is more random? If we partition reals into equivalence classes of reals of the “same degrees of randomness”, what does the resulting structure look like?… (More)