Editorial Board
Polynomial kernels for weighted problems
Closure properties of pattern languages
Sparse approximation is provably hard under coherent dictionaries
A lower bound for metric 1-median selection
Strong partial clones and the time complexity of SAT problems
An AFPTAS for variable sized bin packing with general activation costs
On a generalization of Nemhauser and Trotter's local optimization theorem
Parameterized complexity of the k-arc Chinese Postman Problem
On the parameterized complexity of b-chromatic number
On asymptotic gate complexity and depth of reversible circuits without additional memory
Trading performance for stability in Markov decision processes
d-k-min-wise independent family of hash functions
Optimal-depth sorting networks
Fast algorithms for Abelian periods in words and greatest common divisor queries
Kernelization using structural parameters on sparse graph classes
Solving parity games in big steps
Deciding whether a regular language is generated by a splicing system
A small minimal aperiodic reversible Turing machine
Contents