502 search results - page 1 / 101 » Popular Mixed Matchings |
120
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
112
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
105
Voted
CIAC
2010
Springer
16 years 25 days ago
2010
Springer
108
Voted
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
105
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer