1. Lecture Notes in Computer Science;D.J. Abraham,2006
2. Aldershof, B., Carducci, O.M.: Stable matching with couples. Discrete Appl. Math. 68, 203–207 (1996)
3. Ashlagi, I., Braverman, M., Hassidim, A.: Matching with couples revisited. Tech. Rep. arXiv: 1011.2121, Cornell University Library (2010)
4. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Tech. Rep. 49, ECCC (2003)
5. Biró, P.: Student admissions in Hungary as Gale and Shapley envisaged. Tech. Rep. TR-2008-291, University of Glasgow, Dept. of Computing Science (2008)