Hitting topological minor models in planar graphs is fixed parameter tractable

The essential replication initiation factor DnaB from Bacillus subtilis is not an integral membrane protein The dnaBS371P allele causes a reduction in the ability of DnaB to

Our main findings are that (i) when considering realistic failures (e.g., Weibull distributed) group replication can significantly lower application makespan on large-scale

case is deduced from this one using a detailed analysis of the group scheme in the case k is an algebraic closure of a finite field, and a general result on reductive group schemes due

Assume A is a family of connected planar graphs that satisfies the previous condition, and let X n denote the number of connected components that belong to A in a random planar

[Note: In (6) the variable z is used instead of w.] There is a bijection between rooted quadrangulations and non-separable rooted planar maps: black and white vertices in

For each of the resulting notions, one can compute a decomposition of width at most d (if one exists) in time f (d) · |O| c with f a computable function and c an integer

Finally, if G F has entwined cycles (set of cycles with common edges), we have designed a deterministic fixed-parameter algorithm for #2SAT, that is, an algorithm whose time

Lemma 2.8 If G contains a special configuration as facial subgraph, then either G is a small graph (characterized in Lemmas 2.2, 2.3, and 2.4) and γ P (G) ≤ n−2 4 , or each