Abstract Machine scheduling problems are a long-time key domain of algorithms and
complexity research. A novel approach to machine scheduling problems are fixed …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

We introduce the framework of cross-composition for proving kernelization lower bounds. A
classical problem L\and/or-cross-composes into a parameterized problem Q if it is possible …

We study the parameterized complexity of various classic vertex-deletion problems such as
Odd cycle transversal, Vertex planarization, and Chordal vertex deletion under hybrid …

Computational Social Choice is an interdisciplinary research area involving Economics,
Political Science, and Social Science on the one side, and Mathematics and Computer …

Inductive k k-independent graphs generalize chordal graphs and have recently been
advocated in the context of interference-avoiding wireless communication scheduling. The …

Continuous-time dynamic models are indispensable for many disciplines of science and
engineering. This article proposes a new approach for estimating unknown parameters of …

We prove that graph problems with finite integer index have linear kernels on graphs of
bounded expansion when parameterized by the size of a modulator to constant-treedepth …

Community detection is an important task in the analysis of biological, social or technical
networks. We survey different models of cohesive graphs, commonly referred to as clique …

We study the design of fixed-parameter algorithms for problems already known to be
solvable in polynomial time. The main motivation is to get more efficient algorithms for …