The following pages link to (Q4418671):
Displaying 23 items.
- Stable marriage with general preferences (Q506532) (← links)
- The stable marriage problem with ties and restricted edges (Q783028) (← links)
- Two algorithms for the student-project allocation problem (Q924544) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707) (← links)
- Equivalence of two-sided stable matching (Q1631687) (← links)
- Three-sided stable matching problem with two of them as cooperative partners (Q1740415) (← links)
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- Improving solution times for stable matching problems through preprocessing (Q2027037) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Two problems in max-size popular matchings (Q2415362) (← links)
- Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints (Q3449577) (← links)
- (Q3604325) (← links)
- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings (Q5041200) (← links)
- Pairwise Preferences in the Stable Marriage Problem (Q5090469) (← links)
- (Q5136309) (← links)
- Bribery and Control in Stable Marriage (Q5154751) (← links)
- Pareto Stable Matchings under One-Sided Matroid Constraints (Q5232161) (← links)
- Super-stability in the student-project allocation problem with ties (Q5918742) (← links)
- Balancing stability and efficiency in team formation as a generalized roommate problem (Q6078610) (← links)
- Effective data reduction for strongly stable matching in very sparse graphs (Q6663523) (← links)
