17 citations · 48 across the 19 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Counting Popular Matchings in House Allocation Problems
Rupam Acharyya, Sourav Chakraborty, Nitesh Jha
We study the problem of counting the number of popular matchings in a given instance. A popular matching instance consists of agents A and houses H, where each agent ranks a subset…
cs.CG2013
Helly-Type Theorems in Property Testing
Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy +1
Helly's theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If is a set of points in , we say tha…