N
Nada Pulath
Researcher at Indian Institutes of Technology
Publications - 2
Citations - 8
Nada Pulath is an academic researcher from Indian Institutes of Technology. The author has contributed to research in topics: Vertex (geometry) & Bipartite graph. The author has an hindex of 2, co-authored 2 publications receiving 4 citations.
Papers
More filters
Book ChapterDOI
Classified Rank-Maximal Matchings and Popular Matchings – Algorithms and Hardness
TL;DR: This paper considers the problem of computing an optimal matching in a bipartite graph where elements of A specify preferences over their neighbors in P, possibly involving ties, and each vertex can have capacities and classifications.
Posted Content
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings
TL;DR: An O(|E|^2)-time algorithm for finding a feasible rank-maximal matching, when each classification is a laminar family and an NP-hardness result when classes are non-laminar even under strict preference lists, and even when only posts have classifications.