Erratum: The Stable Allocation (or Ordinal Transportation) Problem
Mathematics of Operations Research
Student admissions and faculty recruitment
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
Many-to-One Stable Matching: Geometry and Fairness
Mathematics of Operations Research
Polynomial time algorithm for an optimal stable assignment with multiple partners
Theoretical Computer Science
The stable fixtures problem-A many-to-many extension of stable roommates
Discrete Applied Mathematics
The Generalized Stable Allocation Problem
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Stable marriages with multiple partners: efficient search for an optimal solution
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
INFORMS Journal on Computing
Characterizations of the optimal stable allocation mechanism
Operations Research Letters
Note: Blockers and antiblockers of stable matchings
Theoretical Computer Science
| Hi-index | 0.05 |