Pages that link to "Item:Q1959726"

The following pages link to Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726):

Displaying 19 items.

• The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
• Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
• Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
• Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
• Local search approaches in stable matching problems (Q1736586) (← links)
• Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
• Stable marriage with groups of similar agents (Q2190408) (← links)
• Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
• Parameterized dynamic cluster editing (Q2223691) (← links)
• Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
• Searching for better fill-in (Q2453556) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
• On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
• Parameterized Dynamic Cluster Editing (Q5090987) (← links)
• Balanced stable marriage: how close is close enough? (Q5918373) (← links)
• Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
• Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective (Q6162047) (← links)
• Adapting stable matchings to forced and forbidden pairs (Q6627043) (← links)