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
Hard variants of stable marriage
Theoretical Computer Science
Stable Marriage and Genetic Algorithms: A Fertile Union
Journal of Heuristics
The structure of stable marriage with indifference
Discrete Applied Mathematics
Inapproximability Results on Stable Marriage Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
The stable marriage problem with restricted pairs
Theoretical Computer Science
Approximability results for stable marriage problems with ties
Theoretical Computer Science
Efficient algorithms for generalized Stable Marriage and Roommates problems
Theoretical Computer Science
Sampling stable marriages: why spouse-swapping won't work
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to finding good stable matchings in the hospitals/residents setting
Theoretical Computer Science
Journal of Discrete Algorithms
The stable marriage problem with master preference lists
Discrete Applied Mathematics
Manipulation and gender neutrality in stable marriage procedures
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Compact Preference Representation in Stable Marriage Problems
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
The generalized median stable matchings: finding them is not that easy
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Local search algorithms on the Stable Marriage Problem: Experimental Studies
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
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
Manipulation complexity and gender neutrality in stable marriage procedures
Autonomous Agents and Multi-Agent Systems
Center stable matchings and centers of cover graphs of distributive lattices
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Procedural fairness in stable marriage problems
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
The complexity of approximately counting stable matchings
Theoretical Computer Science
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
INFORMS Journal on Computing
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
Modeling stable matching problems with answer set programming
RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
Note: Blockers and antiblockers of stable matchings
Theoretical Computer Science
Hi-index | 0.01 |