May 15, 2016 · We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained.

Sep 30, 2017 · We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists (sri) that are ...

We show that the problem of deciding whether an instance of d-srti admits a stable matching is NP-complete even if d = 3. We also consider the "most stable" ...

Sep 1, 2016 · In this section we study the complexity and approximability of the problem of deciding whether an instance of d-srti admits a stable matching, ...

We show that the problem of deciding whether an instance of d-srti admits a stable matching is NP-complete even if d = 3. We also consider the “most stable” ...

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists (sri) that are degree constrained ...

Sep 1, 2016 · We show that the problem of deciding whether an instance of d-srti admits a stable matching is NPNP -complete even if d=3d=3 . We also consider ...

The stable marriage problem is that of matching n men and n women, each of whom has ranked the members of the opposite sex in order of preference, ...

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, ...

The Stable Roommates problem with short lists. Cseh, Ágnes and Irwing, R.W. and Manlove, D.F. (2019) The Stable Roommates problem with short ...