The following pages link to (Q3995616):
Displayed 50 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- A coloring property for stable allocations (Q274058) (← links)
- Modelling practical placement of trainee teachers to schools (Q301931) (← links)
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- Analysis of stochastic matching markets (Q378330) (← links)
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- The complexity of approximately counting stable matchings (Q441846) (← links)
- Improved approximation bounds for the student-project allocation problem with preferences over projects (Q450528) (← links)
- Singleton core in many-to-one matching problems (Q477777) (← links)
- Stability and strategy-proofness for college admissions with an eligibility criterion (Q490945) (← links)
- Stable marriage with general preferences (Q506532) (← links)
- A computational approach to the multi-period many-to-one matching with ties (Q512877) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Popular mixed matchings (Q541674) (← links)
- Potential-partnership networks and the dynamical structure of monogamous populations (Q614599) (← links)
- Stochastic stability for roommate markets (Q617674) (← links)
- Bounded unpopularity matchings (Q644804) (← links)
- On the complexity of distributed stable matching with small messages (Q660987) (← links)
- Complexity of the sex-equal stable marriage problem (Q689901) (← links)
- Smith and Rawls share a room: stability and medians (Q708883) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- Characterization of super-stable matchings (Q832893) (← links)
- The complexity of the certification of properties of stable marriage (Q834962) (← links)
- Hardness results on the man-exchange stable marriage problem with short preference lists (Q845882) (← links)
- A one-shot deviation principle for stability in matching problems (Q894006) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- Friend of my friend: network formation with two-hop benefit (Q904688) (← links)
- Core of coalition formation games and fixed-point methods (Q904830) (← links)
- A deferred acceptance algorithm with contracts (Q908183) (← links)
- A maximum stable matching for the roommates problem (Q922705) (← 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)
- A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
- Rotations in the stable \(b\)-matching problem (Q964393) (← links)
- Size versus stability in the marriage problem (Q964402) (← links)
- Optimal popular matchings (Q967372) (← links)
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples (Q975759) (← links)
- Geometric stable roommates (Q976079) (← links)
- Sexually transmitted infections and the marriage problem (Q977795) (← links)
- Unravelling in two-sided matching markets and similarity of preferences (Q980964) (← links)
- The college admissions problem with lower and common quotas (Q986550) (← links)
- An improved approximation lower bound for finding almost stable maximum matchings (Q989570) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- Student-project allocation with preferences over projects (Q1002100) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Stable matching problems with exchange restrictions (Q1016052) (← links)
- Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085) (← links)