-
Chapter and Conference Paper
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
A feedback vertex set (FVS) in a digraph is a subset of vertices whose removal makes the digraph acyclic. In other words, it hits all cycles in the digraph. Lokshtanov et al. [TALG ‘21] gave a factor 2 randomi...
-
Article
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules
Multiwinner elections have proven to be a fruitful research topic with many real-world applications. We contribute to this line of research by improving the state of the art regarding the computational complex...
-
Chapter and Conference Paper
More Effort Towards Multiagent Knapsack
In this paper, we study two multiagent variants of the knapsack problem. Fluschnik et al. [AAAI 2019] studied the model in which each agent expresses its preference by assigning a utility to every item. They s...
-
Chapter and Conference Paper
Gehrlein Stable Committee with Multi-modal Preferences
Inspired by Gehrlein stability in multiwinner election, in this paper, we define several notions of stability that are applicable in multiwinner elections with multimodal preferences, a model recently proposed...
-
Article
Genetic Diversity and Population Structure of a Medicinal Herb Houttuynia cordata Thunb. of North-East India
Intra-species genetic variability assessment is an effective tool in formulating genetic improvement and germplasm conservation strategies. Houttuynia cordata Thunb. is a semidomesticated medicinal herb consumed ...
-
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 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, ...
-
Article
Quadratic Vertex Kernel for Rainbow Matching
In this paper, we study the NP-complete colorful variant of the classic matching problem, namely, the Rainbow Matching problem. Given an edge-colored graph G and a positive integer k, the goal is to decide whethe...
-
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
Stability in barter exchange markets
The notion of stability is the foundation of several classic problems in economics and computer science that arise in a wide-variety of real-world situations, including Stable Marriage, Stable Roommate, Hospital ...
-
Article
Parameterized Algorithms and Kernels for Rainbow Matching
In this paper, we study the NP-complete colorful variant of the classical Matching problem, namely, the Rainbow Matching problem. Given an edge-colored graph G and a positive integer k, this problem asks whether ...
-
Chapter and Conference Paper
Balanced Stable Marriage: How Close Is Close Enough?
Balanced Stable Marriage (BSM) is a central optimization version of...
-
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
Stable Matching Games: Manipulation via Subgraph Isomorphism
In this paper we consider a problem that arises from a strategic issue in the stable matching model (with complete preference lists) from the viewpoint of exact-exponential time algorithms. Specifically, we st...
-
Article
Transgenic Tea Over-expressing Solanum tuberosum Endo-1,3-beta-d-glucanase Gene Conferred Resistance Against Blister Blight Disease
Tea (Camellia sinensis [L.] O. Kuntze) plant, one of the most important plantation crops in the world, is infected by a fungus called Exobasidium vexans leading to dreaded blister blight disease. The disease may ...
-
Chapter
Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis
We survey an emerging area of research within algorithmic game theory: multivariate analysis of games. This article surveys the landscape of work on various stable marriage problems and the use of parametrized...
-
Chapter and Conference Paper
Group Activity Selection on Graphs: Parameterized Analysis
In varied real-life situations, ranging from carpooling to workload delegation, several activities are to be performed, to which end each activity should be assigned to a group of agents. These situations are ...
-
Article
On the Advice Complexity of the k-server Problem Under Sparse Metrics
We consider the k-Server problem under the advice model of computation when the underlying metric space is sparse. On one side, we introduce Θ(1)-competitive algorithms for a wide range of sparse graphs. These al...
-
Article
Molecular Landscape of Helopeltis theivora Induced Transcriptome and Defense Gene Expression in Tea
Tea is the second most consumed beverage worldwide whose cultivation is greatly challenged by a large variety of biotic and abiotic stresses. Among the biotic factors, the hemipteran pest Helopeltis theivora Wate...
-
Article
Molecular Analysis of Drought Tolerance in Tea by cDNA-AFLP Based Transcript Profiling
A cDNA-AFLP approach was used to identify transcript and/or genes specifically expressed in response to drought in tea. Drought was artificially induced and whole genome transcript profiling was done at three ...
