-
Chapter and Conference Paper
Branch and Bound Algorithm for Vertex Bisection Minimization Problem
Vertex Bisection Minimization problem (VBMP) consists of partitioning the vertex set V of a graph G = (V, E) into two sets B and B′ where ...
-
Article
Open AccessBioluminescence Microscopy as a Method to Measure Single Cell Androgen Receptor Activity Heterogeneous Responses to Antiandrogens
Cancer cell heterogeneity is well-documented. Therefore, techniques to monitor single cell heterogeneous responses to treatment are needed. We developed a highly translational and quantitative bioluminescence ...
-
Article
Open AccessCorrection: Corrigendum: Bioluminescence Microscopy as a Method to Measure Single Cell Androgen Receptor Activity Heterogeneous Responses to Antiandrogens
Scientific Reports 6: Article number: 33968; published online: 28 September 2016; updated: 21 November 2016.
-
Article
Minimizing cyclic cutwidth of graphs using a memetic algorithm
Cyclic cutwidth minimization problem (CCMP) consists of embedding a graph onto a circle such that the maximum cutwidth in a region is minimized. It is an NP-complete problem and for some classes of graphs, exa...
-
Chapter and Conference Paper
Mixed Dominating Set: A Parameterized Perspective
In the mixed dominating set (mds) problem, we are given an n-vertex graph G and a positive integer k, and the objective is to decide whether there exists a set
-
Chapter and Conference Paper
List Colouring of Graphs Using a Genetic Algorithm
The List Colouring Problem (LCP) is an NP-Hard optimization problem in which the goal is to find a proper list colouring of a graph G = (V, E) such that the number of colours used is minimized. This paper deals w...
-
Chapter and Conference Paper
Hitting and Covering Partially
d-Hitting Set and d-Set Cover are among the classical NP-hard problems. In this paper, we study variants of d-Hitting Set and d-Set Cover, which are called Partial d -Hitting Set (Partial
-
Chapter and Conference Paper
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
Let \(\mathrm{\Pi }\) be a family of graphs. In the classical
-
Chapter and Conference Paper
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set
In vertex deletion problems on graphs, the task is to find a set of minimum number of vertices whose deletion results in a graph with some specific property. The class of vertex deletion problems contains seve...
-
Chapter and Conference Paper
Quadratic Vertex Kernel for Split Vertex Deletion
A graph is called a split graph if its vertex set can be partitioned into a clique and an independent set. Split graphs have rich mathematical structure and interesting algorithmic properties making it one of ...
-
Article
Gehrlein stability in committee selection: parameterized hardness and algorithms
In a multiwinner election based on the Condorcet criterion, we are given a set of candidates, and a set of voters with strict preference rankings over the candidates. A committee is weakly Gehrlein stable (WGS) i...
-
Article
Parameterized Complexity of Conflict-Free Matchings and Paths
An input to a conflict-free variant of a classical problem \(\Gamma \)Γ, called Conflict-Free\(\Gamma \)Γ, consists of an instance I of \(\Gamma \)Γ coupled with a graph H, called the conflict graph. A solution t...
-
Article
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
Let π be a family of graphs. In the classical π-Vertex Deletion problem, given a graph G and a positive integer k, the objective is to check whether there exists a subset S of at most k vertices such that G − S i...
-
Article
Open AccessAssessing the nanotechnology on the grounds of costs, benefits, and risks
The technical innovations are based on the principles of science with the assurance of outweighing their cost and risk factors with the benefits to society. But sometimes, the innovation either itself becomes ...
-
Chapter
Composition and Arrangement of Carbon-Derived Membranes for Purifying Wastewater
Wastewater can be treated in many ways, out of which membrane separation technology is considered the most effective and unique one. Especially, carbon nanotubes (CNTs)-based membranes are getting noteworthy a...
-
Chapter and Conference Paper
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms
This paper studies gerrymandering on graphs from a computational viewpoint (introduced by Cohen-Zemach et al. [AAMAS 2018] and continued by Ito et al. [AAMAS 2019]). Our contributions are two-fold: conceptual and...
-
Chapter
Waterborne Polyurethanes Additive Technologies
Waterborne polyurathenes (WBPUs) possess flexible properties and are environmentally friendly, these properties of WBPUs have attracted growing interest in an extensive range of industrial applications. While ...
-
Chapter and Conference Paper
Parameterized Complexity of d-Hitting Set with Quotas
In this paper we study a variant of the classic d -Hitting Set problem with lower and upper capacity constraints, say A and B, respectively. The input to the problem consists of a universe U, a set family, ...
-
Chapter and Conference Paper
Circumventing Connectivity for Kernelization
Classical vertex subset problems demanding connectivity are of the following form: given an input graph G on n vertices and an integer k, find a set S of at most k vertices that satisfies a property and G[S] is c...
-
Chapter
The Role of Carbon Nanocomposite Membranes for Water and Wastewater Treatment
The water pollution is greatest global concerns due to contamination of environmental factors, which is rising day by day. To remove the pollutants from the water and wastewater is a challenging task, and the ...
