1. Abraham, D.J., Biró, P., & Manlove, D.F (2006). “Almost stable” matchings in the Roommates problem. In Proceedings of WAOA ’05: the 3rd Workshop on Approximation and Online Algorithms, volume 3879 of Lecture Notes in Computer Science (pp. 1–14). Springer.
2. Aldershof, B., & Carducci, O.M. (1996). Stable matching with couples. Discrete Applied Mathematics, 68, 203–207.
3. Balinski, M., & Sönmez, T. (1999). A tale of two mechanisms: student placement. Journal of Economic Theory, 84(1), 73–94.
4. Biró, P. (2008). Student admissions in Hungary as Gale and Shapley envisaged. Technical Report TR-2008-291. University of Glasgow, Department of Computing Science.
5. Biró, P., Irving, R.W., & Schlotter, I. (2011). Stable matching with couples: an empirical study. ACM Journal of Experimental Algorithmics, 16. Section 1, article 2.