An efficient algorithm for the “optimal” stable marriage
Journal of the ACM (JACM)
A new fixed point approach for stable networks stable marriages
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On likely solutions of a stable matching problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Stable Marriage and Genetic Algorithms: A Fertile Union
Journal of Heuristics
Concerning the maximum number of stable matchings in the stable marriage problem
Discrete Mathematics
Counting dyadic equipartitions of the unit square
Discrete Mathematics - Kleitman and combinatorics: a celebration
The structure of stable marriage with indifference
Discrete Applied Mathematics
The stable marriage problem with restricted pairs
Theoretical Computer Science
Polynomial time algorithm for an optimal stable assignment with multiple partners
Theoretical Computer Science
Hardness results on the man-exchange stable marriage problem with short preference lists
Information Processing Letters
Efficient algorithms for generalized Stable Marriage and Roommates problems
Theoretical Computer Science
On the stable b-matching problem in multigraphs
Discrete Applied Mathematics
A unified approach to finding good stable matchings in the hospitals/residents setting
Theoretical Computer Science
The stable marriage problem with master preference lists
Discrete Applied Mathematics
Size Versus Stability in the Marriage Problem
Approximation and Online Algorithms
Stable marriage with ties and bounded length preference lists
Journal of Discrete Algorithms
On the likely number of solutions for the stable marriage problem
Combinatorics, Probability and Computing
A 3/2-Approximation Algorithm for General Stable Marriage
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Finding a Level Ideal of a Poset
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Size versus stability in the marriage problem
Theoretical Computer Science
Stable marriages with multiple partners: efficient search for an optimal solution
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Cheating to get better roommates in a random stable matching
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The generalized median stable matchings: finding them is not that easy
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Approximation algorithms for the sex-equal stable marriage problem
ACM Transactions on Algorithms (TALG)
The complexity of approximately counting stable matchings
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Adaptive stable marriage algorithms
Proceedings of the 48th Annual Southeast Regional Conference
SIAM Journal on Discrete Mathematics
The complexity of approximately counting stable matchings
Theoretical Computer Science
The complexity of approximately counting stable roommate assignments
Journal of Computer and System Sciences
Mathematics of Operations Research
Linear programming brings marital bliss
Operations Research Letters
Approximation algorithms for the sex-equal stable marriage problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Two-sided matching with partial information
Proceedings of the fourteenth ACM conference on Electronic commerce
A number of stable matchings in models of the Gale-Shapley type
Discrete Applied Mathematics
Note: Blockers and antiblockers of stable matchings
Theoretical Computer Science
Hi-index | 0.01 |