Pages that link to "Item:Q2309466"
From MaRDI portal
The following pages link to Stable matchings with covering constraints: a complete computational trichotomy (Q2309466):
Displaying 6 items.
- Stable marriage with covering constraints -- a complete computational trichotomy (Q681890) (← links)
- An algorithm to compute the full set of many-to-many stable matchings. (Q1431789) (← links)
- Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective (Q6162047) (← links)
- Popular critical matchings in the many-to-many setting (Q6199405) (← links)
