Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs

The aims of this work were: (1) to study whether Lf CECT5716 could promote juvenile growth and maturation in a GF drosophila model upon undernutrition and to compare this effect

Les causes les plus fréquentes d’hirsutisme sont le syndrome des ovaires micro-polykystiques (75%), l’hirsutisme idiopathique (20%) et l’hyperplasie congénitale des surrénales

This result is obtained through a reduction to the problem of enumerating the paths of a directed acyclic graph and is illustrated through two examples: the enumeration of the

We develop a reduction memetic algorithm (RMA) for the graph coloring problem, a feasible and infeasible search algorithm (FISA) for the equitable coloring problem, an adaptive

I present an efficient algorithm which lists the minimal separators of a 3- connected planar graph in O(n) per separator.. Keywords: 3-connected planar graphs, minimal

However, since the graph is 3-connected planar, anyone of these neighbourhoods is necessarily maximal for inclusion, because if some neighbourhood S was a strict subset of some

In Section III we present a generic dynamic programming framework for solving combi- natorial optimization problems on graphs with bounded path- width.. In Section IV

59 See Milanovic, supra note 6, at 8: ‘Jurisdiction is the actual exercise of control and authority by a state, while title and sovereignty establish the state’s right in