b'@article{ITMMP2006,'b'\nTITLE = {Rank-Maximal Matchings},\nAUTHOR = {Irving, Robert W. and Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna},\nLANGUAGE = {eng},\nLOCALID = {Local-ID: C1256428004B93B8-B6D1D2487C87162EC125728E003DA65E-ITMMP2006},\nYEAR = {2006},\nDATE = {2006},\nABSTRACT = {Suppose that each member of a set A of applicants ranks a subset of a set P of posts in an order of preference, possibly involving ties. A matching is a set of (applicant, post) pairs such that each applicant and each post appears in at most one pair. A rank-maximal matching is one in which the maximum possible number of applicants are matched to their first choice post, and subject to that condition, the maximum possible number are matched to their second choice post, and so on. This is a relevant concept in any practical matching situation and it was first studied by Irving [2003].We give an algorithm to compute a rank-maximal matching with running time O(min(n + C,C$\\surd$n)m), where C is the maximal rank of an edge used in a rank-maximal matching, n is the number of applicants and posts and m is the total size of the preference lists.},\nJOURNAL = {ACM Transactions on Algorithms},\nVOLUME = {2},\nPAGES = {602--610},\n}\n'