9 papers
Fair, Efficient and Connected Allocations on Graphs
Susobhan Bandopadhyay, Anish Datta, Palash Dey +2
We study the classical and parameterized complexity of efficient connected allocation problems on graphs, where efficiency is measured by egalitarian and utilitarian welfare maximi…
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.…
Shift Bribery over Social Networks
Ashlesha Hota, Susobhan Bandopadhyay, Palash Dey
In shift bribery, a briber seeks to promote his preferred candidate by paying voters to raise their ranking. Classical models of shift bribery assume voters act independently, over…
Large planar -cliques
Susobhan Bandopadhyay, Sagnik Sen, S Taruni
An \textit{-graph} is a graph having both arcs and edges, and its arcs (resp., edges) are labeled using one of the (resp., ) different symbols. An \textit{…
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'…
On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar +1
We study the SHORTEST PATH problem with positive disjunctive constraints from the perspective of parameterized complexity. For positive disjunctive constraints, there are certain p…