Publications directly related to the project

Journal papers

  1. T. Fleiner, R.W. Irving and D.F. Manlove.  Efficient algorithms for generalised stable marriage and roommates problems.  To appear in Theoretical Computer Science. Postprint.
  2. D.F. Manlove and G. O'Malley. Student-project allocation with preferences over projects. To appear in Journal of Discrete Algorithms.
  3. D.J. Abraham, R.W. Irving and D.F. Manlove  Two algorithms for the student-project allocation problemJournal of Discrete Algorithms, 5 (1) : 73-90, 2007. Postprint.
  4. K. Cechlárová and D.F. Manlove   The Exchange-Stable Marriage ProblemDiscrete Applied Mathematics, 152 (1-3) : 109-122, 2005. Postprint.
  5. M.M. Halldórsson, R.W. Irving, K. Iwama, D.F. Manlove, S. Miyazaki, Y. Morita and S. Scott.  Approximability results for stable marriage problems with ties.  Theoretical Computer Science, 306 (1-3): 431-447, 2003. Postprint.

Conference papers

  1. D.F. Manlove, G. O’Malley, P. Prosser and C. Unsworth.  A Constraint Programming Approach to the Hospitals / Residents Problem.  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, pp. 155-170, Springer, 2007. The full version of this paper is available as Technical Report no. TR-2007-236 of the Computing Science Department of Glasgow University, 2007.
  2. D.J. Abraham, P. Biró and D.F. Manlove.  “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, 2006. Postprint
  3. D.J. Abraham, R.W. Irving and D.F. Manlove. The Student-Project Allocation Problem.  In Proceedings of ISAAC 2003: the 14th Annual International Symposium on Algorithms and Computation, volume 2906 of Lecture Notes in Computer Science, pp. 474-484.  Springer, 2003.  Postprint.  The full version of this paper is to appear in Journal of Discrete Algorithms.
  4. R.W. Irving, D.F. Manlove and S. Scott.  Strong stability in the Hospitals / Residents problem.  In Proceedings of STACS 2003: the 20th International Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pp.439-450.  Springer, 2003. Postprint.  The full version of this paper is available as Technical Report no. TR-2002-123 of the Computing Science Department of Glasgow University, 2002 (revised May 2005).

Workshop papers

  1. R.W. Irving, D.F. Manlove and G. O'Malley. Stable marriage with ties and bounded length preference lists.  In Proceedings of ACID 2006: the 2nd Algorithms and Complexity in Durham workshop, volume 7 of Texts in Algorithmics, pp. 95-106, College Publications, 2006.
  2. D.F. Manlove and G. O’Malley.  Modelling and solving the stable marriage problem using constraint programming.  In Proceedings of the Fifth Workshop on Modelling and Solving Problems with Constraints, held at IJCAI ’05, pp. 10-17, 2005.  The full version of this paper is available as Technical Report no. TR-2005-192 of the Computing Science Department of Glasgow University, 2005.
  3. D.F. Manlove and G. O’Malley.  Student-project allocation with preferences over projects.  In Proceedings of ACID 2005: the 1st Algorithms and Complexity in Durham workshop, volume 4 of Texts in Algorithmics, pp. 69-80, KCL Publications, 2005.

Thesis

  1. D.J. Abraham. Algorithmics of Two-Sided Matching Problems. MSc thesis, University of Glasgow, Department of Computing Science, 2003.

Other papers

  1. K. Cechlárová, R.W. Irving and D.F. Manlove.  Stability in labour market gamesERCIM News.  Vol. 57, pp. 27-28, 2004.

Submitted for publication

  1. R.W. Irving, D.F. Manlove and S. Scott. The Stable Marriage Problem with Master Preference Lists. Technical Report no. TR-2006-223 of the Computing Science Department of Glasgow University, 2006.


Publications indirectly related to the project

Journal papers

  1. W. Duckworth, D.F. Manlove and M. Zito.  On the approximability of the maximum induced matching problem.  Journal of Discrete Algorithms 3(1) :79-91, 2005.

Conference papers

  1. D.F. Manlove and C.T.S. Sng. Popular matchings in the Capacitated House Allocation Problem. In Proceedings of ESA ’06: 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 of the Computing Science Department of Glasgow University, 2006.
  2. D.J. Abraham, K. Cechlárová, D.F. Manlove and K. Mehlhorn.  Pareto-optimality in house allocation problems.  In Proceedings of ISAAC 2004: the 15th Annual International Symposium on Algorithms and Computation, volume 3341 of Lecture Notes in Computer Science, pp. 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, pp. 1163-1175, Springer, 2005.

Workshop papers

  1. K. Cechlárová and T. Fleiner and D. Manlove.  The Kidney Exchange Game.  In Proceedings of SOR ’05: the 8th International Symposium on Operations Research in Slovenia, pp. 77-83, 2005.

Technical reports (not associated with papers listed above)

  1. D.J. Abraham and D.F. Manlove.  Pareto optimality in the Roommates problem.  Technical report TR-2004-182 of the Computing Science Department of Glasgow University, 2004.

Grant details

Funding body:
EPSRC
Grant number:
GR/R84597/01
Duration:
1/10/02 - 31/03/06