25 citations · 25 across the 9 of their papers we have counts for
8 papers · 1 filter
On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar +1
Given an undirected graph G and a set A \subseteq V(G), an A-path is a path in G that starts and ends at two distinct vertices of A with intermediate vertices in V(G) \setminus A.…
Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
Aritra Banik, Sujoy Bhore, Palash Dey +1
The kidney exchange mechanism allows many patient-donor pairs who are otherwise incompatible with each other to come together and exchange kidneys along a cycle. However, due to in…
Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
Aritra Banik, Mano Prakash Parthasarathi, Venkatesh Raman +2
The Minimum Consistent Subset (MCS) problem arises naturally in the context of supervised clustering and instance selection. In supervised clustering, one aims to infer a meaningfu…
On Colorful Vertex and Edge Cover Problems
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
In this paper, we study two generalizations of Vertex Cover and Edge Cover, namely Colorful Vertex Cover and Colorful Edge Cover. In the Colorful Vertex Cover problem, given an …
Parameterized Complexity of Graph Partitioning into Connected Clusters
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik +1
Given an undirected graph and integers , balanced connected -partition problem () asks whether there exists a partition of the vertex se…
Structural Parameterizations of Budgeted Graph Coloring
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik +1
We introduce a variant of the graph coloring problem, which we denote as {\sc Budgeted Coloring Problem} (\bcp). Given a graph , an integer and an ordered list of integers $…