This paper surveys the theory of bidimensionality. This theory characterizes a broad range of
graph problems ('bidimensional') that admit efficient approximate or fixed-parameter …

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 …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

We introduce a new framework for designing fixed-parameter algorithms with
subexponential running time---2 O (√ k) n O (1). Our results apply to a broad family of graph …

Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the
power of data reduction by preprocessing from a theoretical as well as a practical side. In …

Besides the very successful concept of tree-width (see [Bodlaender, H. and Koster, A.(2007)
Combinatorial optimisation on graphs of bounded treewidth. These are special issues on …

We study the existence of polynomial kernels, for parameterized problems without a
polynomial kernel on general graphs, when restricted to graphs of bounded twin-width. Our …

Wireless sensor networks (WSNs) provide a convenient way to monitor the physical
environment. They consist of a large number of sensors that have sensing, computing, and …

We demonstrate a new connection between fixed-parameter tractability and approximation
algorithms for combinatorial optimization problems on planar graphs and their …

We consider the price of stability for Nash and correlated equilibria of linear congestion
games. The price of stability is the optimistic price of anarchy, the ratio of the cost of the best …