Result 1 to 10 of 10 total
An algorithm for a super-stable roommates problem. (English)
Theor. Comput. Sci. 412, No. 50, 7059-7065 (2011).
1
On stable matchings and flows. (English)
Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28‒30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 51-62 (2010).
2
Bistable versions of the marriages and roommates problems. (English)
J. Comput. Syst. Sci. 59, No.3, 504-520 (1999).
3
On the stable marriage polytope. (English)
Discrete Math. 148, No.1-3, 141-159 (1996).
4
On a random instance of a ‘stable roommates’ problem: Likely behavior of the proposal algorithm. (English)
Comb. Probab. Comput. 2, No.1, 53-92 (1993).
5
A unifying approach to the structures of the stable matching problems. (English)
Comput. Math. Appl. 22, No.6, 13-27 (1991).
6
Comment on "worst-case choice for the stable marriage problem". (English)
Inf. Process. Lett. 24, 139 (1987).
7
Complete unisexual stable marriages. (English)
Soochow J. Math. 4, 149-151 (1978).
8
Stable permutations in latin squares. (English)
Soochow J. Math. 4, 63-72 (1978).
9
Complete stable marriages. (English)
Soochow J. Math. Nat. Sci. 3, 41-51 (1977).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
