1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2018★ 1 cited
Maximal and maximum transitive relation contained in a given binary relation
Sourav Chakraborty, Shamik Ghosh, Nitesh Jha +1
We study the problem of finding a \textit{maximal} transitive relation contained in a given binary relation. Given a binary relation of size defined on a set of size , we pr…
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…