2 citations · 5 across the 4 of their papers we have counts for
4 papers
Popularity in the generalized Hospital Residents Setting
Meghana Nasre, Amit Rawat
We consider the problem of computing popular matchings in a bipartite graph G = (R U H, E) where R and H denote a set of residents and a set of hospitals respectively. Each hospita…
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights. F…
Rank Maximal Matchings -- Structure and Algorithms
Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar
Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M i…
Popularity at Minimum Cost
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
We consider an extension of the {\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of peop…