On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs

Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar. In this paper, we present a polynomial-time algorithm to test whether a given graph is maximal outer-fan-planar. The algorithm can also be employed to produce an outer-fan-planar embedding, if one exists. On the negative side, we show that testing fan-planarity of a graph is NP-hard, for the case where the rotation system (i.e., the cyclic order of the edges around each vertex) is given

Recognizing and Drawing IC-planar Graphs

IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$ vertices, we present an $O(n)$-time algorithm that computes a straight-line drawing of $G$ in quadratic area, and an $O(n^3)$-time algorithm that computes a straight-line drawing of $G$ with right-angle crossings in exponential area. Both these area requirements are worst-case optimal. We also show that it is NP-complete to test IC-planarity both in the general case and in the case in which a rotation system is fixed for the input graph. Furthermore, we describe a polynomial-time algorithm to test whether a set of matching edges can be added to a triangulated planar graph such that the resulting graph is IC-planar

Issues potentially affecting quality of life arising from long-term medicines use: a qualitative study

Background Polypharmacy is increasing and managing large number of medicines may create a burden for patients. Many patients have negative views of medicines and their use can adversely affect quality of life. No studies have specifically explored the impact of general long-term medicines use on quality of life. Objective To determine the issues which patients taking long-term medicines consider affect their day-to-day lives, including quality of life. Setting Four primary care general practices in North West England Methods Face-to-face interviews with adults living at home, prescribed four or more regular medicines for at least 1 year. Interviewees were identified from primary care medical records and purposively selected to ensure different types of medicines use. Interviews were recorded, transcribed and analysed thematically. Results Twenty-one interviews were conducted and analysed. Patients used an average of 7.8 medicines, 51 % were preventive, 40 % for symptom relief and 9 % treatment. Eight themes emerged: relationships with health professionals, practicalities, information, efficacy, side effects, attitudes, impact and control. Ability to discuss medicines with health professionals varied and many views were coloured by negative experiences, mainly with doctors. All interviewees had developed routines for using multiple medicines, some requiring considerable effort. Few felt able to exert control over medicines routines specified by health professionals. Over half sought additional information about medicines whereas others avoided this, trusting in doctors to guide their medicines use. Patients recognised their inability to assess efficacy for many medicines, notably those used for prophylaxis. All were concerned about possible side effects and some had poor experiences of discussing concerns with doctors. Medicines led to restrictions on social activities and personal life to the extent that, for some, life can revolve around medicines. Conclusion There is a multiplicity and complexity of issues surrounding medicines use, which impact on day-to-day lives for patients with long-term conditions. While most patients adapt to long-term medicines use, others did so at some cost to their quality of life

Dimethyl fumarate in patients admitted to hospital with COVID-19 (RECOVERY): a randomised, controlled, open-label, platform trial

Dimethyl fumarate (DMF) inhibits inflammasome-mediated inflammation and has been proposed as a treatment for patients hospitalised with COVID-19. This randomised, controlled, open-label platform trial (Randomised Evaluation of COVID-19 Therapy [RECOVERY]), is assessing multiple treatments in patients hospitalised for COVID-19 (NCT04381936, ISRCTN50189673). In this assessment of DMF performed at 27 UK hospitals, adults were randomly allocated (1:1) to either usual standard of care alone or usual standard of care plus DMF. The primary outcome was clinical status on day 5 measured on a seven-point ordinal scale. Secondary outcomes were time to sustained improvement in clinical status, time to discharge, day 5 peripheral blood oxygenation, day 5 C-reactive protein, and improvement in day 10 clinical status. Between 2 March 2021 and 18 November 2021, 713 patients were enroled in the DMF evaluation, of whom 356 were randomly allocated to receive usual care plus DMF, and 357 to usual care alone. 95% of patients received corticosteroids as part of routine care. There was no evidence of a beneficial effect of DMF on clinical status at day 5 (common odds ratio of unfavourable outcome 1.12; 95% CI 0.86-1.47; p = 0.40). There was no significant effect of DMF on any secondary outcome

Dimethyl fumarate in patients admitted to hospital with COVID-19 (RECOVERY): a randomised, controlled, open-label, platform trial

Dimethyl fumarate (DMF) inhibits inflammasome-mediated inflammation and has been proposed as a treatment for patients hospitalised with COVID-19. This randomised, controlled, open-label platform trial (Randomised Evaluation of COVID-19 Therapy [RECOVERY]), is assessing multiple treatments in patients hospitalised for COVID-19 (NCT04381936, ISRCTN50189673). In this assessment of DMF performed at 27 UK hospitals, adults were randomly allocated (1:1) to either usual standard of care alone or usual standard of care plus DMF. The primary outcome was clinical status on day 5 measured on a seven-point ordinal scale. Secondary outcomes were time to sustained improvement in clinical status, time to discharge, day 5 peripheral blood oxygenation, day 5 C-reactive protein, and improvement in day 10 clinical status. Between 2 March 2021 and 18 November 2021, 713 patients were enroled in the DMF evaluation, of whom 356 were randomly allocated to receive usual care plus DMF, and 357 to usual care alone. 95% of patients received corticosteroids as part of routine care. There was no evidence of a beneficial effect of DMF on clinical status at day 5 (common odds ratio of unfavourable outcome 1.12; 95% CI 0.86-1.47; p = 0.40). There was no significant effect of DMF on any secondary outcome

The Krüppel-like factor 2 and Krüppel-like factor 4 genes interact to maintain endothelial integrity in mouse embryonic vasculogenesis

Background Krüppel-like Factor 2 (KLF2) plays an important role in vessel maturation during embryonic development. In adult mice, KLF2 regulates expression of the tight junction protein occludin, which may allow KLF2 to maintain vascular integrity. Adult tamoxifen-inducible Krüppel-like Factor 4 (KLF4) knockout mice have thickened arterial intima following vascular injury. The role of KLF4, and the possible overlapping functions of KLF2 and KLF4, in the developing vasculature are not well-studied. Results Endothelial breaks are observed in a major vessel, the primary head vein (PHV), in KLF2-/-KLF4-/- embryos at E9.5. KLF2-/-KLF4-/- embryos die by E10.5, which is earlier than either single knockout. Gross hemorrhaging of multiple vessels may be the cause of death. E9.5 KLF2-/-KLF4+/- embryos do not exhibit gross hemorrhaging, but cross-sections display disruptions of the endothelial cell layer of the PHV, and these embryos generally also die by E10.5. Electron micrographs confirm that there are gaps in the PHV endothelial layer in E9.5 KLF2-/-KLF4-/- embryos, and show that the endothelial cells are abnormally bulbous compared to KLF2-/- and wild-type (WT). The amount of endothelial Nitric Oxide Synthase (eNOS) mRNA, which encodes an endothelial regulator, is reduced by 10-fold in E9.5 KLF2-/-KLF4-/- compared to KLF2-/- and WT embryos. VEGFR2, an eNOS inducer, and occludin, a tight junction protein, gene expression are also reduced in E9.5 KLF2-/-KLF4-/- compared to KLF2-/- and WT embryos. Conclusions This study begins to define the roles of KLF2 and KLF4 in the embryonic development of blood vessels. It indicates that the two genes interact to maintain an intact endothelial layer. KLF2 and KLF4 positively regulate the eNOS, VEGFR2 and occludin genes. Down-regulation of these genes in KLF2-/-KLF4-/- embryos may result in the observed loss of vascular integrity

Thigh-length compression stockings and DVT after stroke

Controversy exists as to whether neoadjuvant chemotherapy improves survival in patients with invasive bladder cancer, despite randomised controlled trials of more than 3000 patients. We undertook a systematic review and meta-analysis to assess the effect of such treatment on survival in patients with this disease

On RAC Drawings of Graphs with One Bend per Edge

A k-bend right-angle-crossing drawing or (k-bend RAC drawing}, for short) of a graph is a polyline drawing where each edge has at most k bends and the angles formed at the crossing points of the edges are 90 degrees. Accordingly, a graph that admits a k-bend RAC drawing is referred to as k-bend right-angle-crossing graph (or k-bend RAC, for short). In this paper, we continue the study of the maximum edge-density of 1-bend RAC graphs. We show that an n-vertex 1-bend RAC graph cannot have more than $5.5n-O(1)$ edges. We also demonstrate that there exist infinitely many n-vertex 1-bend RAC graphs with exactly $5n-O(1)$ edges. Our results improve both the previously known best upper bound of $6.5n-O(1)$ edges and the corresponding lower bound of $4.5n-O(\sqrt{n})$ edges by Arikushi et al. (Comput. Geom. 45(4), 169--177 (2012)).Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018