Correction After publication of this work [1], we noted that we inadvertently included the wrong version of Table two. The Charlson scores presented in the table of the published paper did not exclude heart failure (as described in the methods). Therefore all estimates of comorbidity burden are inflated by one point. While this changes the absolute values of the comorbidity burden it does not a...

In both developing and developed countries, health ministries closely examine use of so-called nudges to promote population health and welfare. Cass Sunstein and Richard Thaler, who developed the concept, define a nudge as “any aspect of the choice architecture that alters people’s behavior in a predictable way without forbidding any options or significantly changing their economic incentives. ...

Unwanted visitors.

The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for (P5, dart)-free graphs, (P5, banner)-free graphs, (P5, bull)-free graphs, and (fork, bull)-free graphs.

The present contribution introduces and studies simple semi-conditional ET0L grammars (SSC-ET0L grammars for short). It is demonstrated that SSC-ET0L grammars with permitting and forbidding conditions of length no more than one and two, respectively, generate all the family of recursively enumerable languages; if erasing productions are not allowed, these grammars generate precisely the family ...