Pages that link to "Item:Q1201153"

The following pages link to A new fixed point approach for stable networks and stable marriages (Q1201153):

Displaying 29 items.

• Using maximal independent sets to solve problems in parallel (Q672378) (← 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)
• Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
• Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085) (← links)
• Approximability results for stable marriage problems with ties. (Q1426466) (← links)
• On a cutting plane heuristic for the stable roommates problem and its applications (Q1577118) (← links)
• Hard variants of stable marriage. (Q1605313) (← links)
• The stable roommates problem with short lists (Q1733384) (← links)
• Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
• Popular edges and dominant matchings (Q1800997) (← links)
• Stable matchings and linear programming (Q1923201) (← links)
• The stable roommates problem with choice functions (Q1959722) (← links)
• A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
• Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
• Complexity of fixed point counting problems in Boolean networks (Q2119407) (← links)
• The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
• Stable fractional matchings (Q2238635) (← links)
• Compact linear programs for 2SAT (Q2311345) (← links)
• Stable schedule matchings (Q2454577) (← links)
• The Stable Roommates Problem with Short Lists (Q2819460) (← links)
• The complexity of the comparator circuit value problem (Q2828221) (← links)
• Popularity, Mixed Matchings, and Self-Duality (Q5000640) (← links)
• How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
• Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
• (Q5091034) (← links)
• Review of the theory of stable matchings and contract systems (Q6039790) (← links)
• Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
• Maximum matchings and popularity (Q6490278) (← links)