On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)

Related Items (1)

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Fundamentals of parameterized complexity
Sex-equal stable matchings: complexity and exact algorithms
Better and simpler approximation algorithms for the stable marriage problem
Group activity selection on graphs: parameterized analysis
Complexity of the sex-equal stable marriage problem
Improved approximation algorithms for two variants of the stable marriage problem with ties
On the parameterized complexity of multiple-interval graph problems
Stable marriage with ties and bounded length preference lists
Some remarks on the stable matching problem
A new fixed point approach for stable networks and stable marriages
Stable marriage and indifference
Approximability results for stable marriage problems with ties.
Which problems have strongly exponential complexity?
Hard variants of stable marriage.
The structure of stable marriage with indifference
Parameterized algorithms for stable matching with ties and incomplete lists
Linear time local approximation algorithm for maximum stable marriage
Stable matching with preferences derived from a psychological model
Parameterized complexity and local search approaches for the stable marriage problem with ties
Stable roommate with narcissistic, single-peaked, and single-crossing preferences
A characterization of the single-crossing domain
Parametrized complexity theory.
Approximation algorithms for the sex-equal stable marriage problem
A 3/2-Approximation Algorithm for General Stable Marriage
The Complexity of Satisfiability of Small Depth Circuits
The Complexity of Counting Stable Marriages
Stable networks and product graphs
On Problems as Hard as CNF-SAT
How hard is it to satisfy (almost) all roommates
Algorithmics of Matching Under Preferences
Parameterized Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Tree decompositions and social graphs
College Admissions and the Stability of Marriage
Balanced stable marriage: how close is close enough?
On the complexity of \(k\)-SAT

This page was built for publication: On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)