Polynomial kernels for 3-leaf power graph modification problems

A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are V and such that (u,v) is an edge iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion, are FTP when parameterized by the size of the edge set modification. However polynomial kernel was known for none of these three problems. For each of them, we provide cubic kernels that can be computed in linear time for each of these problems. We thereby answer an open problem first mentioned by Dom, Guo, Huffner and Niedermeier (2005).Comment: Submitte

An FPT 2-Approximation for Tree-Cut Decomposition

The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47-66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequate than treewidth as an invariant that, when bounded, can accelerate the resolution of intractable problems. While designing algorithms for problems with bounded tree-cut width, it is important to have a parametrically tractable way to compute the exact value of this parameter or, at least, some constant approximation of it. In this paper we give a parameterized 2-approximation algorithm for the computation of tree-cut width; for an input $n$-vertex graph $G$ and an integer $w$, our algorithm either confirms that the tree-cut width of $G$ is more than $w$ or returns a tree-cut decomposition of $G$ certifying that its tree-cut width is at most $2w$, in time $2^{O(w^2\log w)} \cdot n^2$. Prior to this work, no constructive parameterized algorithms, even approximated ones, existed for computing the tree-cut width of a graph. As a consequence of the Graph Minors series by Robertson and Seymour, only the existence of a decision algorithm was known.Comment: 17 pages, 3 figure

Hitting forbidden subgraphs in graphs of bounded treewidth

We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph $H$ and an input graph $G$, the task is to find a set $X \subseteq V(G)$ of minimum size that hits all subgraphs of $G$ isomorphic to $H$. In the colorful variant of the problem, each vertex of $G$ is precolored with some color from $V(H)$ and we require to hit only $H$-subgraphs with matching colors. Standard techniques shows that for every fixed $H$, the problem is fixed-parameter tractable parameterized by the treewidth of $G$; however, it is not clear how exactly the running time should depend on treewidth. For the colorful variant, we demonstrate matching upper and lower bounds showing that the dependence of the running time on treewidth of $G$ is tightly governed by $\mu(H)$, the maximum size of a minimal vertex separator in $H$. That is, we show for every fixed $H$ that, on a graph of treewidth $t$, the colorful problem can be solved in time $2^{\mathcal{O}(t^{\mu(H)})}\cdot|V(G)|$, but cannot be solved in time $2^{o(t^{\mu(H)})}\cdot |V(G)|^{O(1)}$, assuming the Exponential Time Hypothesis (ETH). Furthermore, we give some preliminary results showing that, in the absence of colors, the parameterized complexity landscape of H-Subgraph Hitting is much richer.Comment: A full version of a paper presented at MFCS 201

Substance Misuse Education for Physicians: Why Older People are Important.

This perspective article focuses on the need for training and education for undergraduate medical students on substance-related disorders, and describes initiatives undertaken in the United Kingdom (UK), Netherlands, United States (US), and Norway to develop the skills, knowledge, and attitudes needed by future doctors to treat patients adequately. In addition, we stress that in postgraduate training, further steps should be taken to develop Addiction Medicine as a specialized and transverse medical domain. Alcohol use disorder is a growing public health problem in the geriatric population, and one that is likely to continue to increase as the baby boomer generation ages. Prescription drug misuse is a major concern, and nicotine misuse remains problematic in a substantial minority. Thus, Addiction Medicine training should address the problems for this specific population. In recent years, several countries have started an Addiction Medicine specialty. Although addiction psychiatry has been a subspecialty in the UK and US for more than 20 years, in most countries it has been a more recent development. Additional courses on addiction should be integrated into the curriculum at both undergraduate and postgraduate levels, as well as form part of the continuous training of other medical specialists. It is recommended that further research and mapping of what is currently taught in medical programs be undertaken, so as to enhance medical education in addiction and improve treatment services

Parameterized Approximation Schemes using Graph Widths

Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability of a number of problems which are known to be hard to solve exactly when parameterized by treewidth or clique-width. Our main contribution is to present a natural randomized rounding technique that extends well-known ideas and can be used for both of these widths. Applying this very generic technique we obtain approximation schemes for a number of problems, evading both polynomial-time inapproximability and parameterized intractability bounds

Unlocking biomarker discovery: Large scale application of aptamer proteomic technology for early detection of lung cancer

Lung cancer is the leading cause of cancer deaths, because ~84% of cases are diagnosed at an advanced stage. Worldwide in 2008, ~1.5 million people were diagnosed and ~1.3 million died – a survival rate unchanged since 1960. However, patients diagnosed at an early stage and have surgery experience an 86% overall 5-year survival. New diagnostics are therefore needed to identify lung cancer at this stage. Here we present the first large scale clinical use of aptamers to discover blood protein biomarkers in disease with our breakthrough proteomic technology. This multi-center case-control study was conducted in archived samples from 1,326 subjects from four independent studies of non-small cell lung cancer (NSCLC) in long-term tobacco-exposed populations. We measured >800 proteins in 15uL of serum, identified 44 candidate biomarkers, and developed a 12-protein panel that distinguished NSCLC from controls with 91% sensitivity and 84% specificity in a training set and 89% sensitivity and 83% specificity in a blinded, independent verification set. Performance was similar for early and late stage NSCLC. This is a significant advance in proteomics in an area of high clinical need

Julian of Norwich and her children today: Editions, translations and versions of her revelations

The viability of such concepts as "authorial intention," "the original text," "critical edition" and, above all, "scholarly editorial objectivity" is not what it was, and a study of the textual progeny of the revelations of Julian of Norwich--editions, versions, translations and selections--does little to rehabilitate them. Rather it tends to support the view that a history of reading is indeed a history of misreading or, more positively, that texts can have an organic life of their own that allows them to reproduce and evolve quite independently of their author. Julian's texts have had a more robustly continuous life than those of any other Middle English mystic. Their history--in manuscript and print, in editions more or less approximating Middle English and in translations more or less approaching Modern English--is virtually unbroken since the fifteenth century. But on this perilous journey, many and strange are the clutches into which she and her textual progeny have fallen

A Multivariate Approach for Checking Resiliency in Access Control

In recent years, several combinatorial problems were introduced in the area of access control. Typically, such problems deal with an authorization policy, seen as a relation $UR \subseteq U \times R$, where $(u, r) \in UR$ means that user $u$ is authorized to access resource $r$. Li, Tripunitara and Wang (2009) introduced the Resiliency Checking Problem (RCP), in which we are given an authorization policy, a subset of resources $P \subseteq R$, as well as integers $s \ge 0$, $d \ge 1$ and $t \geq 1$. It asks whether upon removal of any set of at most $s$ users, there still exist $d$ pairwise disjoint sets of at most $t$ users such that each set has collectively access to all resources in $P$. This problem possesses several parameters which appear to take small values in practice. We thus analyze the parameterized complexity of RCP with respect to these parameters, by considering all possible combinations of $|P|, s, d, t$. In all but one case, we are able to settle whether the problem is in FPT, XP, W[2]-hard, para-NP-hard or para-coNP-hard. We also consider the restricted case where $s=0$ for which we determine the complexity for all possible combinations of the parameters