1. D.J. Abraham, Algorithmics of two-sided matching problems, Master’s Thesis, University of Glasgow, Department of Computing Science, 2003.
2. Approximation schemes for scheduling;Alon,1997
3. P. Biró, Matching with couples is NP-complete, 2007 (unpublished Manuscript).
4. P. Biró, E. McDermid, Matching with sizes (or scheduling with processing set restrictions), Technical Report TR-2010-307, University of Glasgow, Department of Computing Science, 2010.
5. College admissions and the stability of marriage;Gale;American Mathematical Monthly,1962