In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information

Based on this convergence result, a method for determining the radius of analyticity of solutions of the generalized KdV equation is derived.. Results from the new method and a

if a heavy workload is making health workers reduce the quality of the services, we ought to observe a negative relationship between exogenous shifts in demand (caseload) and the

We show that for several classes of sparse graphs, including planar graphs, graphs of bounded vertex degree and graphs excluding some fixed graph as a minor, an improved solution in

The game of cops and robbers is a pursuit-evasion game played on a graph, where a team of pursuers is trying to catch an evader. See also [5,28] for references on

In this paper we considered the Subgraph Isomorphism problem and the #Subgraph Isomorphism problem and gave the best known algorithms, in terms of time and space requirements, for

For this, it is necessary to go through the entire characterization of H -minor-free graphs given by Robertson and Seymour in their Graph Minors project (in particular, in [37])

We find that most observed patient and GP characteristics are significantly associated with the length of sick leave (LSL) and medical diagnosis is an important observed factor

the structure of several parameters in sparse graph classes such as planar graphs [1,3,5,14,19,34,37,42,44] bounded genus graphs [20,36], graphs excluding some single-crossing graph