3 papers
cs.GT2026
Fair Allocation under Conflict Constraints
Sarfaraz Equbal, Rohit Gurjar, Ayumi Igarashi +6
We study the fair allocation of indivisible items subject to conflict constraints. In this framework, the items are represented as the vertices of a graph, with edges corresponding…
cs.CG2024
Geometric Bipartite Matching is in NC
Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar
In this work, we study the parallel complexity of the Euclidean minimum-weight perfect matching (EWPM) problem. Here our graph is the complete bipartite graph on two sets of po…
cs.GT2024
Fair Interval Scheduling of Indivisible Chores
Sarfaraz Equbal, Rohit Gurjar, Yatharth Kumar +3
We study the problem of fairly assigning a set of discrete tasks (or chores) among a set of agents with additive valuations. Each chore is associated with a start and finish time,…