Invited seminars

  1. Egerváry Research Group on Combinatorial Optimization, Department of Operations Research, Eötvös Loránd University, Budapest, June 2004. The Stable Roommates Problem with Ties (DFM).
  2. University of Liverpool, Department of Computer Science, March 2004. Algorithms for Student-Project Allocation (DFM).
  3. Kyoto University, Japan, School of Informatics, December 2003. Strong Stability in the Hospitals / Residents Problem (DFM).
  4. University of Edinburgh, School of Informatics, LFCS Institute, November 2003. Algorithms for Student-Project Allocation (DFM).
  5. University of Durham, Department of Computer Science, October 2003. Algorithms for Student-Project Allocation (DFM).
  6. University of Alicante, Spain, Department of Economic Analysis, September 2002. The Hospitals / Residents Problem and some extensions (DFM).
  7. University of Alicante, Spain, Department of Economic Analysis, September 2002. The Stable Roommates Problem and some extensions (DFM).

Contributed talks at conferences

  1. Workshop on Approximation and Online Algorithms, Palma, Mallorca, October 2005. "Almost Stable" Matchings in the Roommates Problem (DFM).
  2. International Symposium on Algorithms and Computation, Hong Kong, December 2004. Pareto Optimality in House Allocation problems (DFM).
  3. International Symposium on Algorithms and Computation, Kyoto, Japan, December 2003. The Student/Project Allocation problem (DJA).
  4. International Symposium on Theoretical Aspects of Computer Science, Berlin, German, February 2003. Strong Stability in the Hospitals / Residents problem (SAS).

Contributed talks at workshops

  1. British Colloquium for Theoretical Computer Science, Swansea, April 2006. Stable Marriage with Ties and Constant Length Preference Lists (GO’M).
  2. CP ’05 workshop on Modelling and Reformulating Constraint Satisfaction Problems, Sitges, Spain, September 2005. A Constraint Programming Approach to the Hospitals / Residents Problem (CU).
  3. IJCAI ’05 workshop on Modelling and Solving Problems with Constraints, Edinburgh, July 2005. Modelling and Solving the Stable Marriage Problem Using Constraint Programming (GO’M).
  4. British Combinatorial Conference, Durham, July 2005. "Almost Stable" Matchings in the Roommates Problem (DFM).
  5. Algorithms and Complexity in Durham workshop, July 2005. Student-Project Allocation with Preferences over Projects (DFM).
  6. British Colloquium for Theoretical Computer Science, Nottingham, March 2005. Pareto Optimality in House Allocation problems (DFM).
  7. British Colloquium for Theoretical Computer Science, Pitlochry, April 2004. Approximability Results for Induced Matchings in Graphs (DFM).
  8. British Colloquium for Theoretical Computer Science, Leicester, April 2003. Strong Stability in the Hospitals / Residents Problem (DFM).

Local seminars

  1. November 2005. "Almost Stable" Matchings in the Roommates Problem (DFM).
  2. June 2005. Student Project Allocation with Preferences over Projects (DFM).
  3. October 2004. Pareto optimality in house allocation problems (DFM).
  4. October 2003. Algorithms for Student-Project Allocation (DFM).
  5. October 2002. A Grand Tour of Stable Matching Problems with Indifference (DFM).

Posters

  1. Royal Society of Edinburgh Awards Reception, September 2004. Efficent Algorithms for Matching Problems: Introduction (DFM).
  2. Royal Society of Edinburgh Awards Reception, September 2004. Efficent Algorithms for Matching Problems: Pareto optimality (DFM).

People

  • DJA: David Abraham
  • DFM: David Manlove
  • GO’M: Gregg O’Malley
  • SAS: Sandy Scott
  • CU: Chris Unsworth

Grant details

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