Subexponential parameterized algorithms

We give a review of a series of techniques and results on the design of subexponential parameterized algorithms for graph problems. The design of such algorithms usually consists of two main steps: first find a branch (or tree) decomposition of the input graph whose width is bounded by a sublinear function of the parameter and, second, use this decomposition to solve the problem in time that is single exponential to this bound. The main tool for the first step is the Bidimensionality Theory. Here we present not only the potential, but also the boundaries, of this theory. For the second step, we describe recent techniques, associating the analysis of subexponential algorithms to combinatorial bounds related to Catalan numbers. As a result, we have 2O(k)⋅nO(1) time algorithms for a wide variety of parameterized problems on graphs, where nn is the size of the graph and kk is the parameter.