McDermid, E. and Irving, R.W. (2014) Sex-equal stable matchings: complexity and exact algorithms. Algorithmica, 38(3), pp. 545-570. (doi: 10.1007/s00453-012-9672-0)

Biro, P. and McDermid, E. (2014) Matching with sizes (or scheduling with processing set restrictions). Discrete Applied Mathematics, 164(1), pp. 61-67. (doi: 10.1016/j.dam.2011.11.003)

Biro, P. and Norman, G. (2013) Analysis of stochastic matching markets. International Journal of Game Theory, 42(4), pp. 1021-1040. (doi: 10.1007/s00182-012-0352-8)

Manlove, D. (2013) Algorithmics Of Matching Under Preferences. Series: Theoretical computer science. World Scientific Publishing. ISBN 9789814425247

Biró, P., Manlove, D.F. and McDermid, E.J. (2012) "Almost stable" matchings in the roommates problem with bounded preference lists. Theoretical Computer Science, 432, pp. 10-20. (doi: 10.1016/j.tcs.2012.01.022)

Biro, P., Kern, W. and Paulusma, D. (2012) Computing solutions for matching games. International Journal of Game Theory, 41(1), pp. 75-90. (doi: 10.1007/s00182-011-0273-y)

Fleiner, T., Irving, R.W. and Manlove, D.F. (2011) An algorithm for a super-stable roommates problem. Theoretical Computer Science, 421(50), pp. 7059-7065. (doi: 10.1016/j.tcs.2011.09.012)

Biro, P., Irving, R.W. and Schlotter, I. (2011) Stable matching with couples: an empirical study. ACM Journal of Experimental Algorithmics, 16, Art 1.2. (doi: 10.1145/1963190.1970372)

Biro, P. and McDermid, E. (2010) Three-sided stable matchings with cyclic preferences. Algorithmica, 58(1), pp. 5-18. (doi: 10.1007/s00453-009-9315-2)

Biró, P. and McDermid, E. (2010) Matching with sizes (or scheduling with processing set restrictions). Electronic Notes in Discrete Mathematics, 36(1), pp. 335-342. (doi: 10.1016/j.endm.2010.05.043)

Biro, P., Fleiner, T., Irving, R.W. and Manlove, D.F. (2010) The College Admissions problem with lower and common quotas. Theoretical Computer Science, 411(34-36), pp. 3136-3153. (doi: 10.1016/j.tcs.2010.05.005)

Sng, C.T.S. and Manlove, D.F. (2010) Popular matchings in the weighted capacitated house allocation problem. Journal of Discrete Algorithms, 8(2), pp. 102-116. (doi: 10.1016/j.jda.2008.11.008)

Biro, P. and Fleiner, T. (2010) The integral stable allocation problem on graphs. Discrete Optimization, 7(1-2), pp. 64-73. (doi: 10.1016/j.disopt.2010.02.002)

McDermid, E.J. and Manlove, D.F. (2010) Keeping partners together: algorithmic results for the hospitals/residents problem with couples. Journal of Combinatorial Optimization, 19(3), pp. 279-303. (doi: 10.1007/s10878-009-9257-2)

Biro, P., Manlove, D.F. and Mittal, S. (2010) Size versus stability in the marriage problem. Theoretical Computer Science, 411(16-18), pp. 1828-1841. (doi: 10.1016/j.tcs.2010.02.003)

Biró, P., Irving, R. and Manlove, D.F. (2010) Popular matchings in the marriage and roommates problems. Lecture Notes in Computer Science, 6078, pp. 97-108. (doi: 10.1007/978-3-642-13073-1_10)

Biro, P., Kern, W., and Paulusma, D. (2010) On solution concepts for matching games. Lecture Notes in Computer Science, 6108, pp. 117-127. (doi: 10.1007/978-3-642-13562-0_12)

Biro, P., Manlove, D.F. and Rizzi, R. (2009) Maximum weight cycle packing in directed graphs, with application to kidney exchange programs. Discrete Mathematics, Algorithms and Applications, 1(4), pp. 499-517. (doi: 10.1142/S1793830909000373)

Irving, R.W. and Manlove, D.F. (2009) Finding large stable matchings. Journal of Experimental Algorithmics, 14, 1.2. (doi: 10.1145/1498698.1537595)

McDermid, E. (2009) A 3/2-approximation algorithm for general stable marriage. Lecture Notes in Computer Science, 5555, pp. 689-700. (doi: 10.1007/978-3-642-02927-1_57)

McDermid, E. and Irving, R.W. (2009) Popular matchings: structure and algorithms. Lecture Notes in Computer Science, 5609, pp. 506-515. (doi: 10.1007/978-3-642-02882-3_50)

Fernau, H. and Manlove, D.F. (2009) Vertex and edge covers with clustering properties: complexity and algorithms. Journal of Discrete Algorithms, 7(2), pp. 149-167. (doi: 10.1016/j.jda.2008.09.007)

Irving, R.W., Manlove, D.F. and O'Malley, G. (2009) Stable marriage with ties and bounded length preference lists. Journal of Discrete Algorithms, 7(2), pp. 213-219. (doi: 10.1016/j.jda.2008.09.003)

Biro, P., Manlove, D.F. and Mittal, S. (2009) Size versus stability in the marriage problem. In: Approximation and Online Algorithms. Springer, pp. 15-28. ISBN 9783540939795 (doi: 10.1007/978-3-540-93980-1_2)

Manlove, D.F. and O'Malley, G. (2008) Student-project allocation with preferences over projects. Journal of Discrete Algorithms, 6(4), pp. 553-560. (doi: 10.1016/j.jda.2008.07.003)

Irving, R.W. (2008) Stable matching problems with exchange restrictions. Journal of Combinatorial Optimization, 16(4), pp. 344-360. (doi: 10.1007/s10878-008-9153-1)

Irving, R.W. and Manlove, D.F. (2008) Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems. Journal of Combinatorial Optimization, 16(3), pp. 279-292. (doi: 10.1007/s10878-007-9133-x)

Irving, R.W.,, Manlove, D.F. and Scott, S. (2008) The stable marriage problem with master preference lists. Discrete Applied Mathematics, 156(15), pp. 2959-2977. (doi: 10.1016/j.dam.2008.01.002)

Fleiner, T., Irving, R. W. and Manlove, D. F. (2008) An Algorithm for a Super-Stable Roommates Problem. In: Match-UP 2008: Matching Under Preferences - Algorithms and Complexity, Reykjavík, Iceland, 06 Jul 2008, pp. 126-132.

Irving, R.W. (2008) Optimal stable marriage. Working Paper. Springer US. (doi: 10.1007/978-0-387-30162-4_271).

Sng, C. T.S. and Manlove, D. F. (2007) Popular Matchings in the Weighted Capacitated House Allocation Problem. In: Algorithms and Complexity in Durham 2007: Proceedings of the Third ACiD Workshop, Durham, UK, 17-19 Sep 2007, pp. 129-140. ISBN 9781904987550

Irving, R. W., Manlove, D.F. and Scott, S. (2000) The hospitals/residents problem with ties. In: Proceedings of SWAT 2000: the 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 5-7 July, 2000, pp. 259-271. ISBN 3-540-67690-2