Titlebook: Parameterized and Exact Computation; 8th International Sy Gregory Gutin,Stefan Szeider Conference proceedings 2013 Springer International P

Trigger-Point

AVERT

OUTRE

顽固

On Subexponential and FPT-Time Inapproximability, of them being very active in its own, there is an increasing attention to the connection between these different frameworks. In particular, whether . would be better approximable once endowed with subexponential-time or FPT-time is a central question. In this article, we provide new insights to thi

范围广

Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization,ality problems as . . ., . ., etc. By developing a technique that we call “greediness-for-parameterization”, we obtain fixed parameter algorithms with respect to a pair of parameters ., the size of the solution (but . its value) and ., the maximum degree of the input graph. In particular, greediness

同位素

ALLAY

Incompressibility of ,-Free Edge Modification, most . edges so that the resulting graph is .-free, i.e., contains no induced subgraph isomorphic to .. These .-free edge modification problems are well known to be FPT for every fixed .. In this paper, we study the nonexistence of polynomial kernels for them in terms of the structure of ., and com

Verify

Deject

断言

Subgraphs Satisfying MSO Properties on ,-Topologically Orderable Digraphs,ether with such an ordering, one may count the number of subgraphs of . that at the same time satisfy a monadic second order formula . and are the union of . . paths, in time .(.,.,.)·. .. Our result implies the polynomial time solvability of many natural counting problems on digraphs admitting .-to