25 citations · 25 across the 11 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DM2024
Cuts in Graphs with Matroid Constraints
Aritra Banik, Fedor V. Fomin, Petr A. Golovach +3
{\sc Vertex -Cut} and {\sc Vertex Multiway Cut} are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these probl…
cs.CG2024
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
Aritra Banik, Sayani Das, Anil Maheshwari +6
In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph , consisting of a vertex set of size and an edge set .…
cs.GT2024
Conflict and Fairness in Resource Allocation
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta +4
In the standard model of fair allocation of resources to agents, every agent has some utility for every resource, and the goal is to assign resources to agents so that the agents'…