Book

• Algorithmics of Matching Under Preferences, World Scientific, 2013.

Book chapters

• Algorithmics of Matching Markets, with Jiehua Chen. In Online and Matching-Based Market Design (Federico Echenique, Nicole Immorlica and Vijay Vazirani, eds), Cambridge University Press, 2023. The full book can be downloaded from here (password "OMBMD_CUP").
• Matching Under Preferences, with Bettina Klaus and Francesca Rossi. Chapter 14 of Handbook of Computational Social Choice (Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel Procaccia, eds), pp. 333-355, Cambridge University Press, 2016. Postprint.
• The Hospitals / Residents problem. In Encyclopedia of Algorithms (Ming-Yang Kao, ed.), pages 1-6, Springer, 2015, ISBN 978-3-642-27848-8. Postprint.

Edited journal issues

• Special issue of Algorithms on Matching Under Preferences, with Péter Biró (Guest Editors). Editorial.
• Special issue of Algorithmica on Matching Under Preferences, with Rob Irving and Kazuo Iwama (Guest Editors), volume 58, number 1, 2010. Editorial.

Journal papers

1. Packing K_r s in bounded degree graphs, with Michael McKay, to appear in Discrete Applied Mathematics, 2024.
2. Envy-freeness in 3D Hedonic Games, with Ágnes Cseh and Michael McKay, to appear in Autonomous Agents and Multi-Agent Systems, 2024.
3. New algorithms for hierarchical optimisation in kidney exchange programmes, with Maxence Delorme, Sergio García, Jacek Gondzio, Joerg Kalcsics and William Pettersson, to appear in Operations Research, 2024 (Open Access).
4. On weakly and strongly popular rankings, with Sonja Kraiczy and Ágnes Cseh, Discrete Applied Mathematics, 340 : 134-152, 2023 (Open Access).
5. Half-Cycle: A new formulation for modelling kidney exchange problems, with Maxence Delorme and Tom Smeets, Operations Research Letters, 51 : 234-241, 2023 (Open Access).
6. Super-stability in the Student-Project Allocation Problem with Ties, with Sofiat Olaosebikan, Journal of Combinatorial Optimization, 43 : 1203-1239, 2022 (Open Access).
7. Improved instance generation for kidney exchange programmes, with Maxence Delorme, Sergio García, Jacek Gondzio, Joerg Kalcsics, William Pettersson and James Trimble, Computers & Operations Research, 141 : 105707, 2022 (Open Access).
8. Student-Project Allocation with Preferences over Projects: Algorithmic and Experimental Results, with Duncan Milne and Sofiat Olaosebikan, Discrete Applied Mathematics, 308 : 220-234, 2022 (Open Access).
9. Data and optimization requirements for Kidney Exchange Programs, with Bart Smeulders, William Pettersson, Ana Viana, Paolo Ferrari et al, Health Informatics Journal, 27 (2) : 1-15, 2021 (Open Access).
10. Algorithmic aspects of upper edge domination, with Jérôme Monnot and Henning Fernau, Theoretical Computer Science 877 : 46-57, 2021. Postprint.
11. Stability in the Hospitals / Residents problem with Couples and Ties: Mathematical models and computational studies, with Maxence Delorme, Sergio García, Jacek Gondzio, Joerg Kalcsics and William Pettersson, Omega, 103 : 102386, 2021. Postprint.
12. Improving solve times of stable matching problems through preprocessing, with William Pettersson, Maxence Delorme, Sergio García, Jacek Gondzio and Joerg Kalcsics, Computers & Operations Research, 128 : 105128, 2021 (Open Access).
13. Modelling and Optimisation in European Kidney Exchange Programmes, with Péter Biró, Joris van de Klundert et al.. European Journal of Operational Research, 291 (2) : 447-456, 2021 (Open Access).
14. A General Framework for Stable Roommates Problems using Answer Set Programming, with Esra Erdem, Müge Fidan and Patrick Prosser. Theory and Practice of Logic Programming, 20 (6) : 911-925, 2020 (Open Access).
15. Size versus truthfulness in the House Allocation problem (journal version), with Piotr Krysta, Baharak Rastegari and Jinshan Zhang. Algorithmica 81 (9): 3422-3463, 2019 (Open Access).
16. Building kidney exchange programmes in Europe - An overview of exchange practice and activities, with Péter Biró, Bernadette Haase-Kromwijk et al. Transplantation, 103 (7) : 1514–1522, 2019 (Open Access).
17. Mathematical models for stable matching problems with ties and incomplete lists, with Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics and William Pettersson. European Journal of Operational Research, 277 (2) : 426-441, 2019 (Open Access).
18. The Stable Roommates problem with short lists, with Ágnes Cseh and Rob Irving. Theory of Computing Systems, 63 (1) : 128-149, 2019 (Open Access).
19. Pareto optimal matchings of students to courses in the presence of prerequisites, with Katarína Cechlárová and Bettina Klaus. Discrete Optimization, 29 : 174-195, 2018 (Open Access).
20. Matchings with lower quotas: Algorithms and complexity, with Ashwin Arulselvan, Ágnes Cseh, Martin Groβ and Jannik Matuschke. Algorithmica, 80 (1) : 185-208, 2018 (Open Access).
21. “Almost stable” matchings in the Hospitals / Residents problem with Couples, with Iain McBride and James Trimble. Constraints, 22 (1) : 50-72, 2017 (Open Access). Received Distinguished Paper Award at CP 2016. Postprint. Associated research data.
22. Stable matchings of teachers to schools, with Katarína Cechlárová, Tamás Fleiner and Iain McBride. Theoretical Computer Science, 653 : 15-25, 2016 (Open Access).
23. Pareto Optimal Matchings in Many-to-Many Markets with Ties, with Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Ocel’áková and Baharak Rastegari. Theory of Computing Systems, 59 (4) : 700–721, 2016 (Open Access).
24. Stable marriage and roommates problems with restricted edges: Complexity and approximability with Ágnes Cseh. Discrete Optimization, 20 : 62-89, 2016 (Open Access).
25. Modelling practical placement of trainee teachers to schools, with Katarína Cechlárová, Tamás Fleiner, Iain McBride and Eva Potpinková. Central European Journal of Operations Research, 23 (3) : 547-562, 2015. Postprint.
26. Paired and altruistic kidney donation in the UK: Algorithms and experimentation, with Gregg O’Malley. ACM Journal of Experimental Algorithmics, volume 19, number 2, article 2.6, 21 pages, 2014. Postprint.
27. “Almost stable” matchings in the Roommates problem with bounded lists, with Péter Biró and Eric McDermid. Theoretical Computer Science, 432 : 10-20, 2012. Postprint.
28. An algorithm for a super-stable roommates problem, with Tamás Fleiner and Rob Irving. Theoretical Computer Science, 412 (50) : 7059-7065, 2011. Postprint.
29. The College Admissions Problem with Lower and Common Quotas, with Péter Biró, Tamás Fleiner and Rob Irving. Theoretical Computer Science, 411 : 3136-3153, 2010. The full version of this paper is available as Technical Report no. TR-2009-303, Department of Computing Science, University of Glasgow, 2009. Postprint.
30. Keeping partners together: Algorithmic results for the Hospitals / Residents problem with Couples, with Eric McDermid. Journal of Combinatorial Optimization, 19 (3) : 279-303, 2010. Postprint. Errata.
31. Size versus stability in the Marriage problem, with Péter Biró and Shubham Mittal. Theoretical Computer Science, 411 : 1828-1841, 2010. Postprint.
32. Popular matchings in the weighted capacitated house allocation problem (journal version), with Colin Sng. Journal of Discrete Algorithms, 8:102-116, 2010. Postprint.
33. Maximum weight cycle packing in directed graphs, with application to kidney exchange programs, with Péter Biró and Romeo Rizzi. Discrete Mathematics, Algorithms and Applications, 1 (4) : 499-517, 2009. Postprint.
34. Finding large stable matchings, with Rob Irving. ACM Journal of Experimental Algorithmics, volume 14, section 1, article 2, 30 pages, 2009. Postprint.
35. Vertex and edge covers with clustering properties: complexity and algorithms, with Henning Fernau. Journal of Discrete Algorithms, 7 (2) : 149-167, 2009. Postprint.
36. Stable marriage with ties and bounded length preference lists, with Rob Irving and Gregg O’Malley. Journal of Discrete Algorithms, 7 (2) : 213-219, 2009. Postprint.
37. The Stable Roommates problem with Globally-Ranked Pairs, with David Abraham, Ariel Levavi and Gregg O’Malley. Internet Mathematics 5(4):493-515, 2008. Postprint.
38. The Stable Marriage Problem with Master Preference Lists, with Rob Irving and Sandy Scott. Discrete Applied Mathematics, 156 (15) : 2959-2977, 2008. Postprint.
39. Student-project allocation with preferences over projects, with Gregg O’Malley. Journal of Discrete Algorithms, 6 : 553-560, 2008. Postprint.
40. Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems, with Rob Irving. Journal of Combinatorial Optimization, 16 (3) : 279-292, 2008. Postprint.
41. Efficient algorithms for generalized stable marriage and roommates problems, with Tamás Fleiner and Rob Irving. Theoretical Computer Science, 381 (1-3) : 162-176, 2007. Postprint.
42. Two algorithms for the Student-Project Allocation problem, with David Abraham and Rob Irving. Journal of Discrete Algorithms, 5 (1) :73-90, 2007. Errata. Postprint.
43. The Exchange-Stable Marriage Problem, with Katarína Cechlárová. Discrete Applied Mathematics, 152 (1-3) : 109-122, 2005. Postprint.
44. On the approximability of the maximum induced matching problem, with William Duckworth and Michele Zito. Journal of Discrete Algorithms, 3(1):79-91, 2005. Postprint.
45. Combined Super-/Substring and Super-/Subsequence Problems, with Martin Middendorf. Theoretical Computer Science, 320 (2-3) : 247-267, 2004. Postprint.
46. Approximability results for stable marriage problems with ties, with Magnús Halldórsson, Rob Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita and Sandy Scott. Theoretical Computer Science, 306 (1-3) : 431-447, 2003. Postprint.
47. The Stable Roommates Problem with Ties, with Rob Irving. Journal of Algorithms, 43:85-105, 2002. Errata. Postprint.
48. Hard variants of stable marriage, with Rob Irving, Kazuo Iwama, Shuichi Miyazaki and Yasufumi Morita. Theoretical Computer Science, 276 (1-2) : 261-279, 2002. The full version of this paper is available as Technical Report no. TR-1999-43, Department of Computing Science, University of Glasgow, 1999. Postprint.
49. The structure of stable marriage with indifference. Discrete Applied Mathematics, 122 (1-3) : 167-181, 2002. Postprint.
50. On the algorithmic complexity of twelve covering and independence parameters of graphs. Discrete Applied Mathematics, 91 (1-3) : 155-175, 1999. Postprint.
51. The b-chromatic number of a graph, with Rob Irving. Discrete Applied Mathematics, 91 (1-3) : 127-141, 1999. Postprint.

Conference papers

1. Couples can be tractable: New algorithms and hardness results for the Hospitals/Residents problem with Couples, with Gergely Csáji, Iain McBride and James Trimble, to appear in Proceedings of IJCAI 24: the 33rd International Joint Conference on Artificial Intelligence.
2. The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences, with Michael McKay. In Proceedings of SAGT 2021: the 14th International Symposium on Algorithmic Game Theory, volume 12885 of Lecture Notes in Computer Science, Springer, pages 266-280, 2021. Postprint. The full version of this paper is available as Technical Report no. 2107.04368, Computing Research Repository, Cornell University Library, 2021.
3. On weakly and strongly popular rankings (extended abstract), with Sonja Kraiczy and Ágnes Cseh. In Proceedings of AAMAS 2021: the 20th International Conference on Autonomous Agents and Multi-Agent Systems, pages 1563-1565, IFAAMAS, 2021. Postprint. The full version of this paper is available as Technical Report no. 2102.01361, Computing Research Repository, Cornell University Library, 2021.
4. Algorithms for new types of fair stable matchings, with Frances Cooper. In Proceedings of SEA 2020: the 18th International Symposium on Experimental Algorithms, volume 160 of Leibniz International Proceedings in Informatics (LIPIcs), article 20, pages 1-13, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2020. Postprint. The full version of this paper is available as Technical Report no. 2001.10875, Computing Research Repository, Cornell University Library, 2020.
5. An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties, with Sofiat Olaosebikan. In Proceedings of CALDAM 2020: the 6th Annual International Conference on Algorithms and Discrete Applied Mathematics, volume 12016 of Lecture Notes in Computer Science, pages 384-399, Springer, 2020. Postprint. The full version of this paper is available as Technical Report no. 1911.10262, Computing Research Repository, Cornell University Library, 2019.
6. Super-stability in the Student-Project Allocation Problem with Ties, with Sofiat Olaosebikan. In Proceedings of COCOA 2018: the 12th Annual International Conference on Combinatorial Optimization and Applications, volume 11346 of Lecture Notes in Computer Science, pages 357-371, Springer, 2018. Postprint. The full version of this paper appeared in Journal of Combinatorial Optimization, 43 : 1203-1239, 2022.
7. A 3/2-approximation algorithm for the Student-Project Allocation problem, with Frances Cooper. In Proceedings of SEA 2018: the 17th International Symposium on Experimental Algorithms, volume 103 of Leibniz International Proceedings in Informatics (LIPIcs), article 8, pages 1-13, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. Postprint. The full version of this paper is available as Technical Report no. 1804.02731, Computing Research Repository, Cornell University Library, 2018.
8. An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects, with Duncan Milne and Sofiat Olaosebikan. In Proceedings of ISCO 2018: the 5th International Symposium on Combinatorial Optimization, volume 10856 of Lecture Notes in Computer Science, pages 313-325, Springer, 2018. Postprint. The full version of this paper appeared in Discrete Applied Mathematics, 308 : 220-234, 2022.
9. The Stable Roommates problem with short lists, with Ágnes Cseh and Rob Irving. In Proceedings of SAGT 2016: the 9th International Symposium on Algorithmic Game Theory, volume 9928 of Lecture Notes in Computer Science, pages 207-219, Springer, 2016. Postprint. The full version of this paper appeared in Theory of Computing Systems, 63 (1) : 128-149, 2019.
10. Position-indexed formulations for kidney exchange, with John P. Dickerson, Ben Plaut, Tuomas Sandholm and James Trimble. In Proceedings of EC 2016: the 17th ACM Conference on Economics and Computation, pages 25-42, ACM, 2016. Errata. Postprint. The full version of this paper is available as Technical Report no. 1606.01623, Computing Research Repository, Cornell University Library, 2016.
11. Preference elicitation in matching markets via interviews: A study of offline benchmarks, with Baharak Rastegari and Paul Goldberg. In Proceedings of AAMAS 2016: the 15th International Conference on Autonomous Agents and Multi-Agent Systems, pages 1393-1394, IFAAMAS, 2016. Postprint. The full version of this paper is available as Technical Report no. 1602.04792, Computing Research Repository, Cornell University Library, 2016.
12. Many-to-one matchings with lower quotas: Algorithms and complexity, with Ashwin Arulselvan, Ágnes Cseh, Martin Groβ and Jannik Matuschke. In Proceedings of ISAAC 2015: the 26th International Symposium on Algorithms and Computation, volume 9472 of Lecture Notes in Computer Science, pages 176-187, Springer, 2015 (Open Access). The full version of this paper appeared in Algorithmica, 80 (1) : 185-208, 2018.
13. Pareto Optimal Matchings in Many-to-Many Markets with Ties, with Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Ocel’áková and Baharak Rastegari. In Proceedings of SAGT 2015: the 8th International Symposium on Algorithmic Game Theory, volume 9347 of Lecture Notes in Computer Science, pages 27-39, Springer, 2015. Postprint. The full version of this paper appeared in Theory of Computing Systems, 59 (4) : 700–721, 2016.
14. Stable marriage and roommates problems with restricted edges: Complexity and approximability, with Ágnes Cseh. In Proceedings of SAGT 2015: the 8th International Symposium on Algorithmic Game Theory, volume 9347 of Lecture Notes in Computer Science, pages 15-26, Springer, 2015. Postprint. The full version of this paper appeared in Discrete Optimization, 20 : 62-89, 2016.
15. Profile-based optimal matchings in the Student-Project Allocation problem, with Augustine Kwanashie, Rob Irving and Colin Sng. In Proceedings of IWOCA 2014: the 25th International Workshop on Combinatorial Algorithms, volume 8986 of Lecture Notes in Computer Science, pages 213-225, Springer, 2015. Postprint. The full version of this paper is available as Technical Report no. 1403.0751, Computing Research Repository, Cornell University Library, 2014. Associated research data.
16. Size versus truthfulness in the House Allocation problem, with Piotr Krysta, Baharak Rastegari and Jinshan Zhang. In Proceedings of EC 2014: the 15th ACM Conference on Economics and Computation, pages 453-470, ACM, 2014. Postprint. The full version of this paper appeared in Algorithmica 81 (9): 3422-3463, 201.
17. The Hospitals / Residents problem with Couples: Complexity and Integer Programming models, with Péter Biro and Iain McBride. In Proceedings of SEA 2014: the 13th International Symposium on Experimental Algorithms, volume 8504 of Lecture Notes in Computer Science, pages 10-21, Springer, 2014. Postprint. Associated research data. The full version of this paper is available as Technical Report no. 1308.4534, Computing Research Repository, Cornell University Library, 2013.
18. An Integer Programming approach to the Hospitals / Residents problem with Ties, with Augustine Kwanashie. In Proceedings of OR 2013: the International Conference on Operations Research, pages 263-269, Springer, 2014. Postprint. Associated research data. The full version of this paper is available as Technical Report no. 1308.4064, Computing Research Repository, Cornell University Library, 2013.
19. An Integer Programming Model for the Hospitals/Residents Problem with Couples, with Iain McBride. In Proceedings of OR 2013: the International Conference on Operations Research, pages 293-299, Springer, 2014. Postprint. Associated research data. The full version of this paper is available as Technical Report no. 1308.4534, Computing Research Repository, Cornell University Library, 2013.
20. Socially Stable matchings in the Hospitals / Residents problem, with Georgios Askalidis, Nicole Immorlica, Augustine Kwanashie and Emmanouil Pountourakis. In Proceedings of WADS 2013: the 13th Algorithms and Data Structures Symposium, volume 8037 of Lecture Notes in Computer Science, pages 85-96, Springer, 2013. Postprint. The full version of this paper is available as Technical Report no. 1303.2041, Computing Research Repository, Cornell University Library, 2013.
21. Paired and altruistic kidney donation in the UK: Algorithms and experimentation, with Gregg O’Malley. In Proceedings of SEA 2012: the 11th International Symposium on Experimental Algorithms, volume 7276 of Lecture Notes in Computer Science, pages 271-282, Springer, 2012. Postprint. The full version of this paper appeared in ACM Journal of Experimental Algorithmics, volume 19, number 2, article 2.6, 21 pages, 2014.
22. Popular matchings in the Marriage and Roommates problems, with Péter Biró and Rob Irving. In Proceedings of CIAC 2010: the 7th International Conference on Algorithms and Complexity, volume 6078 of Lecture Notes in Computer Science, pages 97-108, Springer, 2010. Postprint. The full version of this paper is available as Technical Report no. TR-2009-306, Department of Computing Science, University of Glasgow, 2009.
23. Size versus stability in the Marriage problem, with Péter Biró and Shubham Mittal. In Proceedings of WAOA 2008: the 6th Workshop on Approximation and Online Algorithms, volume 5426 of Lecture Notes in Computer Science, pages 15-28, Springer, 2009. Postprint. The full version of this paper appeared in Theoretical Computer Science, 411 : 1828-1841, 2010.
24. The Stable Roommates problem with Globally-Ranked Pairs, with David Abraham, Ariel Levavi and Gregg O’Malley. In Proceedings of WINE 2007: the 3rd International Workshop On Internet and Network Economics, volume 4858 of Lecture Notes in Computer Science, pages 431-444, Springer, 2007. Postprint. The full version of this paper appeared in Internet Mathematics 5(4):493-515, 2008.
25. An 8/5-approximation algorithm for a hard variant of stable marriage, with Rob Irving. In Proceedings of COCOON 2007: the 13th Annual International Computing and Combinatorics Conference, volume 4598 of Lecture Notes in Computer Science, pages 548–558, Springer, 2007. Postprint. Note: there is a mistake in the COCOON paper, and the correct performance guarantee for the approximation algorithm is 5/3. See the full version of the paper in Journal of Combinatorial Optimization, 16 (3) : 279-292, 2008.
26. A Constraint Programming Approach to the Hospitals / Residents Problem, with Gregg O’Malley, Patrick Prosser and Chris Unsworth. In Proceedings of CP-AI-OR 2007: the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 4510 of Lecture Notes in Computer Science, pages 155-170, Springer, 2007. Postprint. The full version of this paper is available as Technical Report no. TR-2007-236, Department of Computing Science, University of Glasgow, 2007.
27. Popular matchings in the Capacitated House Allocation problem, with Colin Sng. In Proceedings of ESA 2006: the 14th Annual European Symposium on Algorithms, volume 4168 of Lecture Notes in Computer Science, pages 492-503, Springer, 2006. Postprint. The full version of this paper is available as Technical Report no. TR-2006-222, Department of Computing Science, University of Glasgow, 2006.
28. “Almost stable” matchings in the Roommates problem, with David Abraham and Péter Biró. In Proceedings of WAOA 2005: the 3rd Workshop on Approximation and Online Algorithms, volume 3879 of Lecture Notes in Computer Science, pages 1-14, Springer, 2006. Postprint.
29. Pareto Optimality in House Allocation Problems, with David Abraham, Katarína Cechlárová and Kurt Mehlhorn. In Proceedings of ISAAC 2004: the 15th Annual International Symposium on Algorithms and Computation, volume 3341 of Lecture Notes in Computer Science, pages 3-15, Springer, 2004. Postprint. Some fonts were missing in the printing of the hard-copy version (but not the on-line version) of this paper. Springer printed a corrected version in Proceedings of ISAAC 2005: the 16th Annual International Symposium on Algorithms and Computation, volume 3827 of Lecture Notes in Computer Science, pages 1163-1175, Springer, 2005.
30. The Student-Project Allocation Problem, with David Abraham and Rob Irving. In Proceedings of ISAAC 2003: the 14th Annual International Symposium on Algorithms and Computation, volume 2906 of Lecture Notes in Computer Science, pages 474-484, Springer, 2003. Postprint. The full version of this paper appeared in Journal of Discrete Algorithms, 5 (1) :73-90, 2007.
31. Strong Stability in the Hospitals / Residents Problem, with Rob Irving and Sandy Scott. In Proceedings of STACS 2003: the 20th International Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pages 439-450, Springer, 2003. Postprint. The full version of this paper is available as Technical Report no. TR-2002-123, Department of Computing Science, University of Glasgow, 2002 (revised May 2005).
32. A Constraint Programming Approach to the Stable Marriage Problem, with Ian Gent, Rob Irving, Patrick Prosser and Barbara Smith. In Proceedings of CP '01: the 7th International Conference on Principles and Practice of Constraint Programming, volume 2239 of Lecture Notes in Computer Science, pages 225-239, Springer, 2001. Postprint.
33. The Hospitals/Residents Problem with Ties, with Rob Irving and Sandy Scott. In Proceedings of SWAT 2000: the 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 259-271. Springer, 2000. Postprint.
34. Stable marriage with incomplete lists and ties, with Kazuo Iwama, Shuichi Miyazaki and Yasufumi Morita. In Proceedings of ICALP '99: the 26th International Colloquium on Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science, pages 443-452. Springer, 1999. Postprint. The full version of this paper appeared in Theoretical Computer Science, 276 (1-2) : 261-279, 2002.

Workshop papers

1. Pareto optimal matchings of students to courses in the presence of prerequisites, with Katarína Cechlárová and Bettina Klaus. In Proceedings of COMSOC 2016: the 6th International Workshop on Computational Social Choice. Postprint. The full version of this paper appeared in Discrete Optimization, 29 : 174-195, 2018.
2. Preference elicitation in matching markets via interviews: A study of offline benchmarks, with Baharak Rastegari and Paul Goldberg. In Proceedings of EXPLORE 2016: the 3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice, 2016. The full version of this paper is available as Technical Report no. 1602.04792, Computing Research Repository, Cornell University Library, 2016. Postprint.
3. An algorithm for a super-stable roommates problem, with Tamás Fleiner and Rob Irving. In Proceedings of Match-UP: Matching Under Preferences – Algorithms and Complexity, held at ICALP 2008, pages 126-132. The full version of this paper appeared in Theoretical Computer Science, 412 (50) : 7059-7065, 2011.
4. Popular matchings in the weighted capacitated house allocation problem, with Colin Sng. In Proceedings of ACiD 2007: the 3rd Algorithms and Complexity in Durham workshop, volume 9 of Texts in Algorithmics, pages 129-140, College Publications, 2007. The full version of this paper appeared in Journal of Discrete Algorithms, 8:102-116, 2010.
5. Stable marriage with ties and bounded length preference lists, with Rob Irving and Gregg O’Malley. In Proceedings of ACiD 2006: the 2nd Algorithms and Complexity in Durham workshop, volume 7 of Texts in Algorithmics, pages 95-106, College Publications, 2006. The full version of this paper appeared in Journal of Discrete Algorithms, 7 (2) : 213-219, 2009.
6. Vertex and edge covers with clustering properties: complexity and algorithms, with Henning Fernau. In Proceedings of ACiD 2006: the 2nd Algorithms and Complexity in Durham workshop, volume 7 of Texts in Algorithmics, pages 69-84, College Publications, 2006. The full version of this paper appeared in Journal of Discrete Algorithms, 7 (2) : 149-167, 2009.
7. The Kidney Exchange Game, with Katarína Cechlárová and Tamás Fleiner. In Proceedings of SOR ’05: the 8th International Symposium on Operations Research in Slovenia, pages 77-83, 2005. IM Preprint series A, no. 5/2005, PJ Šafárik University, Faculty of Science, Institute of Mathematics.
8. A Constraint Programming Approach to the Hospitals / Residents Problem, with Gregg O’Malley, Patrick Prosser and Chris Unsworth. In Proceedings of the Fourth Workshop on Modelling and Reformulating Constraint Satisfaction Problems, held at CP ’05, pages 28-43, 2005. The full version of this paper is available as Technical Report no. TR-2005-196, Department of Computing Science, University of Glasgow, 2005. A version of this paper was published in Proceedings of CP-AI-OR 2007: the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 4510 of Lecture Notes in Computer Science, pages 155-170, Springer, 2007.
9. Modelling and solving the stable marriage problem using constraint programming, with Gregg O’Malley. In Proceedings of the Fifth Workshop on Modelling and Solving Problems with Constraints, held at IJCAI ’05, pages 10-17, 2005. The full version of this paper is available as Technical Report no. TR-2005-192, Department of Computing Science, University of Glasgow, 2005.
10. Student-project allocation with preferences over projects, with Gregg O’Malley. In Proceedings of ACiD 2005: the 1st Algorithms and Complexity in Durham workshop, volume 4 of Texts in Algorithmics, pages 69-80, KCL Publications, 2005. The full version of this paper appeared in Journal of Discrete Algorithms, 6 : 553-560, 2008.

In submission

1. An exploration of project allocation procedures in UK psychology departments, with Nick Perham and Deborah Clayton.
2. Stable Marriage in Euclidean Space, with Yinghui Wen, José Rodríguez, Zhongyi Zhang and Jiong Guo.

Technical reports (not superseded by the above)

• Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples, with Gergely Csáji, Iain McBride and James Trimble.
• On absolutely and simply popular rankings, with Sonja Kraiczy and Ágnes Cseh.
• Two-sided profile-based optimality in the stable marriage problem, with Frances Cooper. Technical Report no. 1905.06626, Computing Research Repository, Cornell University Library, 2019.
• Pareto optimality in the Roommates problem, with David Abraham. Technical Report no. TR-2004-182, Department of Computing Science, University of Glasgow, 2004.
• Stable marriage with ties and unacceptable partners. Technical Report no. TR-1999-29, Department of Computing Science, University of Glasgow, 1999.
• On the 2-maximal independence number of a graph. Technical Report no. TR-1997-33, Department of Computing Science, University of Glasgow, 1997.

PhD thesis

• Minimaximal and maximinimal optimisation problems: a partial order-based approach. PhD thesis, University of Glasgow, Department of Computing Science, June 1998. Technical report TR-1998-27, Department of Computing Science, University of Glasgow.

Other papers

• Selected open problems in Matching Under Preferences, with Katarína Cechlárová and Ágnes Cseh. Bulletin of the EATCS, 128 : 14-38, 2019.
• How Operational Research helps kidney patients in the UK. Impact, 2018:1, 16-19.
• Algorithms for Kidney Donation. Newsletter of the London Mathematical Society, 475: 19-24, March 2018.
• The Joy of Matching, with Paul Harrenstein and Michael Wooldridge. IEEE Intelligent Systems, 28(2):81-85, 2013. Postprint.
• Algorithms for Foundation School Matching, with Rob Irving. Appendix H of Improving Selection into the Foundation Programme. An Option Appraisal, Medical Schools Council, January 2010.
• Stability in labour market games, with Katarína Cechlárová and Rob Irving. ERCIM News (Special Theme on Games Technology), 57: 27-28, 2004.