The optimization version of the Unique Label Cover problem is at the heart of the Unique Games Conjecture which has played an important role in the proof of several tight inapproximability results. In recent years, this problem has been also studied extensively from the point of view of parameterized complexity. Chitnis et al. [FOCS 2012, SICOMP 2016] proved that this problem is fixed-parameter...

The environment surrounding the embryos has a profound impact on the developmental process and phenotypic outcomes of the organism. In species with temperature-dependent sex determination, gonadal sex is determined by the incubation temperature of the eggs. A mechanistic link between temperature and transcriptional regulation of developmental genes, however, remains elusive. In this study, we e...

Among the most important targets for chemopreventive intervention and drug development are deregulated signal transduction pathways. Ras proteins serve as central connectors between signals generated at the plasma membrane and nuclear effectors; thus, disrupting the Ras signaling pathway could have significant potential as a cancer chemopreventive strategy. Target organs for Ras-based chemoprev...

Given a set of n points P in the plane, each colored with one of the t given colors, a color-spanning set S ⊂ P is a subset of t points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning set whose diameter is minimum (among all color-spanning sets of P ). Somehow symmetrically, the largest closest pair color-spanning set (LCPCS) is a color-spanning set whos...

Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a single exponential FPT algorithm with running time O(cn(n+m)), c = min{18, k} that turns graph G into an interval graph by deleting at most k vertices from G. This solves an open problem posed by Marx [19]. We also provide a single exponential FPT algorithm with running time O(cn(n + m)), c = min{17...

The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergraphs with so-called hypernodes and show that, for m = 2, it remains fixed-parameter tractable (FPT), parameterized by the number of hyperedges. This is accomplished by a nontrivial extension of the dynamic programming a...