Pages that link to "Item:Q456691"
From MaRDI portal
The following pages link to Stable assignment with couples: parameterized complexity and local search (Q456691):
Displaying 21 items.
- Matching couples with Scarf's algorithm (Q314433) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Searching for better fill-in (Q2453556) (← links)
- MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY (Q2854007) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
- Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective (Q6162047) (← links)