-
Article
Alkalimonas mucilaginosa sp. nov. and Alkalimonas cellulosilytica sp. nov. isolated from alkaline Lonar lake, India
Two alkaliphilic, Gram‐stain-negative bacterial strains (MEB004T and MEB108T) were isolated from water samples collected from Lonar lake, India. The phylogenetic analysis of their 16S rRNA gene sequences showed t...
-
Article
Open AccessDomination and Cut Problems on Chordal Graphs with Bounded Leafage
The leafage of a chordal graph G is the minimum integer \(\ell \) ℓ such th...
-
Article
Treedepth vs Circumference
The circumference of a graph G is the length of a longest cycle in G, or \(+\infty \)
-
Article
Open AccessSub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Fradkin and Seymour (J Comb Theory Ser B 110:19–46, 2015) defined the class of digraphs of bounded independence number as a generalization of the class of tournaments. They argued that the class of digraphs of...
-
Chapter and Conference Paper
Balanced Substructures in Bicolored Graphs
An edge-colored graph is said to be balanced if it has an equal number of edges of each color. Given a graph G whose edges are colored using two colors and a positive integer k, the objective in the Edge Balanced...
-
Article
Open AccessParameterized Complexity of Directed Spanner Problems
We initiate the parameterized complexity study of minimum t-spanner problems on directed graphs. For a positive integer t, a multiplicative t-spanner of a (directed) graph G is a spanning subgraph H such that the...
-
Chapter and Conference Paper
Parameterized Complexity of Weighted Multicut in Trees
The Edge Multicut problem is a classical cut problem where given an undirected graph G, a set of pairs of vertices \(\mathcal {P}\) , and ...
-
Chapter and Conference Paper
The Complexity of Contracting Bipartite Graphs into Small Cycles
For a positive integer \(\ell \ge 3\) , the \(C_\ell \) -Contrac...
-
Article
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
Given an n-vertex digraph D and a non-negative integer k, the Minimum Directed Bisection problem asks if the vertices of D can be partitioned into two parts, say L and R, such that
-
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 and Conference Paper
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS
In the Directed Feedback Vertex Set (DFVS) problem, given a digraph D and \(k\in \mathbb {N}\)
-
Article
Parameterised Algorithms for Deletion to Classes of DAGs
In the Directed Feedback Vertex Set (DFVS) problem, we are given a digraph D on n vertices and a positive integer k, and the objective is to check whether there exists a set of vertices S such that F = D − S is a...
-
Article
Possible role of thromboxane A2 in remote hind limb preconditioning-induced cardioprotection
Remote hind limb preconditioning (RIPC) is a protective strategy in which short episodes of ischemia and reperfusion in a remote organ (hind limb) protects the target organ (heart) against sustained ischemic r...
