Dr David Manlove

  • Senior Lecturer (Computing Science)

telephone: 01413302794
email: David.Manlove@glasgow.ac.uk

Biography

Dr David Manlove is a Senior Lecturer at the School of Computing Science, University of Glasgow. He joined the academic staff in October 2000, and held a Royal Society of Edinburgh / Scottish Government Personal Research Fellowship from October 2003 to September 2006. His research interests lie in the area of algorithms and complexity.

Prior to starting as a lecturer, Dr Manlove was a Research Assistant, working on an EPSRC research project with Dr Rob Irving. He obtained his PhD in Computing Science from the University of Glasgow in 1998, working under the supervision of Dr Irving. Previously, he obtained a BA in Mathematics and Computation from the University of Oxford in 1995 (MA in 2000).

Dr Manlove is a Fellow of the Higher Education Academy and serves as Vice-Chair of COST Action CA15210 (ENCKEP: European Network for Collaboration on Kidney Exchange Programmes). Within the School, he is a member of the Formal Analysis, Theory and Algorithms research section.

Research interests

My research interests lie mainly in the field of Algorithms and Complexity.  That means that I am interested in the design and analysis of efficient algorithms, and proving results about the extent to which a problem can be solved optimally or approximately using an efficient algorithm.

I am most interested in designing algorithms for matching problems, which involve allocating agents to commodities (e.g., junior doctors to hospitals, students to projects or kidney patients to donors) in the presence of “ordinal preferences” (e.g., a junior doctor might have first, second and third-choice hospitals, etc.) or “cardinal utilities” (e.g., real-valued weights that model the benefit of a kidney patient being assigned to a particular donor).  The aim of a matching algorithm is to find an allocation that is optimal according to these ordinal preferences or cardinal utilities.

More specifically, my research interests include:

  • Matching problems with and without preferences
  • Algorithms for applications of matching problems:
    • kidney exchange
    • allocation of junior doctors to hospitals
    • school placement
    • student-project allocation
  • Algorithmic graph theory
  • Colouring, independence and domination in graphs
  • Complexity and approximability of optimisation problems
  • Integer programming models

Selected publications

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

Klaus, B., Manlove, D. F. and Rossi, F. (2016) Matching under preferences. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J. and Procaccia, A. D. (eds.) Handbook of Computational Social Choice. Cambridge University Press: Cambridge ; New York, pp. 333-355. ISBN 9781107060432

Dickerson, J. P., Manlove, D. F., Plaut, B., Sandholm, T. and Trimble, J. (2016) Position-Indexed Formulations for Kidney Exchange. In: 17th ACM Conference on Economics and Computation, Maastricht, The Netherlands, 24-28 Jul 2016, pp. 25-42. ISBN 9781450339360 (doi:10.1145/2940716.2940759)

Manlove, D. F., McBride, I. and Trimble, J. (2017) "Almost-stable" matchings in the Hospitals / Residents problem with Couples. Constraints, 22(1), pp. 50-72. (doi:10.1007/s10601-016-9249-7)

Grants

  • Engineering and Physical Sciences Research Council
    IP-MATCH: Integer Programming for Large and Complex Matching Problems (grant EP/P028306/01)
    1 November 2017 - 31 October 2020.  Amount £353,253.  Principal Investigator.
    (Joint project with the University of Edinburgh; UoE share £448,386.)
  • European Cooperation in Science and Technology (COST)
    ENCKEP: European Network for Collaboration on Kidney Exchange Programmes (Action CA15210)
    2 September 2016 - 1 September 2020.  Vice-chair.
  • Engineering and Physical Sciences Research Council, Institutional Sponsorship Fund
    New algorithms for paired and altruistic kidney donation (grant EP/N508792/1)
    1 October 2015 – 31 March 2016.  Amount: £17,765.  Principal Investigator.
  • Engineering and Physical Sciences Research Council, Impact Acceleration Account
    Algorithms for Paired and Altruistic Kidney Exchange (grant EP/K503903/1)
    1 January 2015 – 30 September 2015.  Amount: £29,640.  Principal Investigator.
  • Engineering and Physical Sciences Research Council
    Efficient Algorithms for Mechanism Design Without Monetary Transfer (grant EP/K010042/1)
    6 June 2013 – 5 June 2016.  Amount: £269,482.  Principal Investigator.
    (Joint project with the University of Liverpool; UoL share £329,764.)
  • NHS Blood and Transplant
    Optimising options and strategies for living donor kidney transplantation for incompatible donor-recipient pairs (project 10-11-ODT)
    1 January 2012 – 30 June 2013.  Amount: £151,902.  Co-Investigator.
  • Engineering and Physical Sciences Research Council, Knowledge Transfer Account
    Kidney Paired Exchange Data Analysis Toolkit
    1 July 2011 – 31 December 2011.  Amount: £32,307.  Principal Investigator.
  • NHS Blood and Transplant
    Software for the National Matching Scheme for Paired Donation
    1 April 2010 – 30 June 2011.  Amount: £108,709.  Principal Investigator.
  • Engineering and Physical Sciences Research Council
    MATCH-UP: Matching Under Preferences – Algorithms and Complexity (grant EP/E011993/1)
    1 June 2007 – 31 May 2010.  Amount: £324,087.  Co-Investigator.
  • Royal Society of Edinburgh, Scottish Executive Personal Research Fellowship
    Efficient Algorithms for Matching Problems.
    1 October 2003 – 30 September 2006.  Amount: £117,052.
  • Engineering and Physical Sciences Research Council, Fast Stream
    Algorithmics of Stable Matching Problems with Indifference (grant GR/R84597/01)
    1 October 2002 – 31 March 2006.  Amount: £63,480.  Principal Investigator

Supervision

Teaching

Additional information

All publications

List by: Type | Date

Jump to: 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999
Number of items: 75.

2017

Cseh, A., Irving, R. W. and Manlove, D. F. (2017) The Stable Roommates problem with short lists. Theory of Computing Systems, (doi:10.1007/s00224-017-9810-9) (Early Online Publication)

Manlove, D. F., McBride, I. and Trimble, J. (2017) "Almost-stable" matchings in the Hospitals / Residents problem with Couples. Constraints, 22(1), pp. 50-72. (doi:10.1007/s10601-016-9249-7)

2016

Arulselvan, A., Cseh, Á., Groß, M., Manlove, D. and Matuschke, J. (2016) Matchings with lower quotas: Algorithms and complexity. Algorithmica, (doi:10.1007/s00453-016-0252-6) (Early Online Publication)

Cechlarova, K., Fleiner, T., Manlove, D. F. and McBride, I. (2016) Stable matchings of teachers to schools. Theoretical Computer Science, 653, pp. 15-25. (doi:10.1016/j.tcs.2016.09.014)

Cechlárová, K., Eirinakis, P., Fleiner, T., Magos, D., Manlove, D., Mourtos, P., Ocel’áková, E. and Rastegari, B. (2016) Pareto optimal matchings in many-to-many markets with ties. Theory of Computing Systems, 59(4), pp. 700-721. (doi:10.1007/s00224-016-9677-1)

Cseh, A., Manlove, D. and Irving, R. W. (2016) The Stable Roommates Problem with Short Lists. In: 9th International Symposium on Algorithmic Game Theory (SAGT), Liverpool, UK, 19-21 Sept 2016, pp. 207-219. ISBN 9783662533536 (doi:10.1007/978-3-662-53354-3_17)

Dickerson, J. P., Manlove, D. F., Plaut, B., Sandholm, T. and Trimble, J. (2016) Position-Indexed Formulations for Kidney Exchange. In: 17th ACM Conference on Economics and Computation, Maastricht, The Netherlands, 24-28 Jul 2016, pp. 25-42. ISBN 9781450339360 (doi:10.1145/2940716.2940759)

Cseh, Á. and Manlove, D. F. (2016) Stable marriage and roommates problems with restricted edges: complexity and approximability. Discrete Optimization, 20, pp. 62-89. (doi:10.1016/j.disopt.2016.03.002)

Cechlarova, K., Klaus, B. and Manlove, D. (2016) Pareto Optimal Matchings of Students to Courses in the Presence of Prerequisites. In: Sixth International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, 22-24 June 2016,

Rastegari, B., Goldberg, P. and Manlove, D. (2016) Preference Elicitation in Matching Markets Via Interviews: A Study of Offline Benchmarks. In: EXPLORE 2016: 3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice, Singapore, 10 May 2016,

Klaus, B., Manlove, D. F. and Rossi, F. (2016) Matching under preferences. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J. and Procaccia, A. D. (eds.) Handbook of Computational Social Choice. Cambridge University Press: Cambridge ; New York, pp. 333-355. ISBN 9781107060432

Rastegari, B., Goldberg, P. and Manlove, D. (2016) Preference Elicitation in Matching Markets Via Interviews: A Study of Offline Benchmarks. In: AAMAS 2016, Singapore, 9-13 May 2016, pp. 1393-1394. ISBN 9781450342391

2015

Cseh, Á. and Manlove, D. (2015) Stable marriage and roommates problems with restricted edges: complexity and approximability. Lecture Notes in Computer Science, 9347, pp. 15-26. (doi:10.1007/978-3-662-48433-3_2)

Cechlárová, K., Fleiner, T., Manlove, D. F., McBride, I. and Potpinková, E. (2015) Modelling practical placement of trainee teachers to schools. Central European Journal of Operations Research, 23(3), pp. 547-562. (doi:10.1007/s10100-014-0356-5)

Arulselvan, A., Cseh, A., Groß, M., Manlove, D. F. and Matuschke, J. (2015) Many-to-one matchings with lower quotas: algorithms and complexity. In: ISAAC 2015: the 26th International Symposium on Algorithms, Nagoya, Japan, 9-11 Dec 2015, pp. 176-187. ISBN 9783662489710 (doi:10.1007/978-3-662-48971-0_16)

Cechlárová, K., Eirinakis, P., Fleiner, T., Magos, D., Manlove, D., Mourtos, I., Ocel’áková, E. and Rastegari, B. (2015) Pareto optimal matchings in many-to-many markets with ties. Lecture Notes in Computer Science, 9347, pp. 27-39. (doi:10.1007/978-3-662-48433-3_3)

Kwanashie, A., Irving, R. W., Manlove, D. F. and Sng, C. T.S. (2015) Profile-Based Optimal Matchings in the Student-Project Allocation Problem. In: Combinatorial Algorithms: 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), Duluth, MN, USA, 15-17 Oct 2014, pp. 213-225. ISBN 9783319193151 (doi:10.1007/978-3-319-19315-1_19)

Manlove, D. F. (2015) The hospitals/residents problem. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms. Springer Berlin Heidelberg, pp. 1-6. ISBN 9783642278488 (doi:10.1007/978-3-642-27848-8_180-2)

2014

Manlove, D. and O'Malley, G. (2014) Paired and altruistic kidney donation in the UK: Algorithms and experimentation. Journal of Experimental Algorithmics, 19(2), 2.6. (doi:10.1145/2670129)

Kwanashie, A. and Manlove, D. F. (2014) An integer programming approach to the Hospitals/Residents problem with ties. In: Operations Research Proceedings 2013: Selected Papers of the International Conference on Operations Research, OR2013. Series: Operations Research Proceedings. Springer International Publishing, pp. 263-269. ISBN 9783319070001 (doi:10.1007/978-3-319-07001-8_36)

Biró, P. and Manlove, D. F. (2014) Editorial: special issue on matching under preferences. Algorithms, 7(2), pp. 203-205. (doi:10.3390/a7020203)

Biró, P., Manlove, D. F. and McBride, I. (2014) The Hospitals/Residents Problem with Couples: complexity and integer programming models. Lecture Notes in Computer Science, 8504, pp. 10-21. (doi:10.1007/978-3-319-07959-2_2)

Krysta, P., Manlove, D., Rastegari, B. and Zhang, J. (2014) Size versus truthfulness in the house allocation problem. In: Fifteenth ACM Conference on Economics and Computation (EC'14), Palo Alto, CA USA, 8-12 June 2014, pp. 453-470. (doi:10.1145/2600057.2602868)

McBride, I. and Manlove, D. F. (2014) An integer programming Model for the Hospitals/Residents Problem with Couples. In: Operations Research Proceedings 2013: Selected Papers of the International Conference on Operations Research, OR2013. Series: Operations Research Proceedings. Springer International Publishing, pp. 293-299. ISBN 9783319070001 (doi:10.1007/978-3-319-07001-8_40)

2013

Askalidis, G., Immorlica, N., Kwanashie, A., Manlove, D.F. and Pountourakis, E. (2013) Socially stable matchings in the hospitals / residents problem. Lecture Notes in Computer Science, 8037, pp. 85-96. (doi:10.1007/978-3-642-40104-6_8)

Harrenstein, P., Manlove, D. and Wooldridge, M. (2013) The joy of matching. IEEE Intelligent Systems, 28(2), pp. 81-85. (doi:10.1109/MIS.2013.49)

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

2012

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)

Manlove, D.F. and O’Malley, G. (2012) Paired and altruistic kidney donation in the UK: algorithms and experimentation. Lecture Notes in Computer Science, 7276, pp. 271-282. (doi:10.1007/978-3-642-30850-5_24)

2011

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)

2010

Manlove, D.F., Irving, R.W. and Iwama, K. (2010) Guest editorial: Special issue on matching under preferences. Algorithmica, 58(1), pp. 1-4. (doi:10.1007/s00453-010-9415-z)

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)

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)

2009

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)

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)

2008

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. 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.

Abraham, D.J., Levavi, A., Manlove, D.F. and O'Malley, G. (2008) The stable roommates problem with globally-ranked pairs. Internet Mathematics, 5(4), pp. 493-515. (doi:10.1080/15427951.2008.10129167)

Manlove, D.F. (2008) Hospitals/residents problem. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms. Springer, pp. 390-394. ISBN 9780387301624 (doi:10.1007/978-0-387-30162-4_180)

2007

Fleiner, T., Irving, R.W. and Manlove, D.F. (2007) Efficient algorithms for generalized Stable Marriage and Roommates problems. Theoretical Computer Science, 381(1-3), pp. 162-176. (doi:10.1016/j.tcs.2007.04.029)

Irving, R.W. and Manlove, D.F. (2007) An 8/5 approximation algorithm for a hard variant of stable marriage. In: Proceedings of COCOON 2007, 13th Annual International Computing and Combinatorics Conference, Banff, Canada, 16-19 July 2007, pp. 548-558. (doi:10.1007/978-3-540-73545-8_53)

Manlove, D.F., O'Malley, G., Prosser, P. and Unsworth, C. (2007) A constraint programming approach to the hospitals/residents problem. In: Proceedings of CP-AI-OR '07: the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Brussels, Belgium, 23-26 May, 2007, pp. 155-170. (doi:10.1007/978-3-540-72397-4_12)

Abraham, D.J., Irving, R.W. and Manlove, D.F. (2007) Two algorithms for the student-project allocation problem. Journal of Discrete Algorithms, 5(1), pp. 73-90. (doi:10.1016/j.jda.2006.03.006)

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

2006

Manlove, D.F. and Sng, C.T.S. (2006) Popular Matchings in the Capacitated House Allocation Problem. In: Proceedings of ESA 2006: the 14th Annual European Symposium on Algorithms, Zurich, Switzerland, 11-13 September 2006, pp. 492-503. ISBN 978-3-540-38875-3 (doi:10.1007/11841036_45)

Abraham, D.J., Biro, P. and Manlove, D.F. (2006) "Almost stable" matchings in the Roommates problem. In: Proceedings of WAOA 2005: the 3rd International Workshop on Approximation and Online Algorithms, Palma, Mallorca, 6-7 October, 2005, pp. 1-14. ISBN 3-540-32207-8 (doi:10.1007/11671411_1)

Fernau, H. and Manlove, D. F. (2006) Vertex and Edge Covers With Clustering Properties: Complexity and Algorithms. In: Algorithms and Complexity in Durham 2006: Proceedings of the Second ACiD Workshop, Durham, UK, 18-20 Sep 2006, pp. 69-84. ISBN 9781904987383

Irving, R. W., Manlove, D. F. and O'Malley, G. (2006) Stable Marriage with Ties and Bounded Length Preference Lists. In: Algorithms and Complexity in Durham 2006: Proceedings of the Second ACiD Workshop, Durham, UK, 18-20 Sep 2006, pp. 95-106. ISBN 9781904987383

2005

Cechlarova, K. and Manlove, D.F. (2005) The exchange-stable marriage problem. Discrete Applied Mathematics, 152(1-3), pp. 109-122. (doi:10.1016/j.dam.2005.06.003)

Cechlárová, K., Fleiner, T. and Manlove, D. (2005) The Kidney Exchange Game. In: 8th International Symposium on Operational Research in Slovenia, Nova Gorica, Slovenia, 28-30 Sep 2005, pp. 77-83. ISBN 9789616165204

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

Manlove, D. F. and O'Malley, G. (2005) Modelling and Solving the Stable Marriage Problem Using Constraint Programming. In: Fifth Workshop on Modelling and Solving Problems with Constraints, Edinburgh, Scotland, 30 Jul - 05 Aug 2005, pp. 10-17.

Manlove, D. F. and O'Malley, G. (2005) Student-Project Allocation with Preferences over Projects. In: Algorithms and Complexity in Durham 2005: Proceedings of the First ACiD Workshop, Durham, UK, 08-10 Jul 2005, pp. 69-80. ISBN 9781904987109

Manlove, D. F. , O'Malley, G., Prosser, P. and Unsworth, C. (2005) A Constraint Programming Approach to the Hospitals / Residents Problem. In: Fourth Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Sitges, Spain, 01-05 Oct 2005, pp. 28-43.

2004

Middendorf, M. and Manlove, D.F. (2004) Combined super-/substring and super-/subsequence problems. Theoretical Computer Science, 320(2-3), pp. 247-267. (doi:10.1016/j.tcs.2004.02.001)

Abraham, D.J., Cechlarova, K., Manlove, D.F. and Mehlhorn, K. (2004) Pareto optimality in house allocation problems. In: Proceedings of ISAAC 2004: the 15th Annual International Symposium on Algorithms and Computation, Hong Kong, 20-22 December, 2004, pp. 3-15. ISBN 3-540-24131-0

2003

Halldorsson, M., Irving, R.W., Iwama, K., Manlove, D. F., Miyazaki, S., Morita, Y. and Scott, S. (2003) Approximability results for stable marriage problems with ties. Theoretical Computer Science, 306(1-3), pp. 431-447. (doi:10.1016/S0304-3975(03)00321-9)

Abraham, D.J., Irving, R.W. and Manlove, D.F. (2003) The student-project allocation problem. In: Proceedings of ISAAC 2003: the 14th Annual International Symposium on Algorithms and Computation, Kyoto, Japan, 15-17 December, 2003, pp. 474-484. ISBN 3-540-20695-7

Irving, R.W., Manlove, D.F. and Scott, S. (2003) Strong stability in the Hospitals/Residents problem. In: Proceedings of STACS 2003: the 20th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 27 February - 1 March, 2003, pp. 439-450. ISBN 3-540-00623-0

2002

Irving, R. W. and Manlove, D.F. (2002) The stable roommates problem with ties. Journal of Algorithms, 43(1), pp. 85-105. (doi:10.1006/jagm.2002.1219)

Manlove, D.F. (2002) The structure of stable marriage with indifference. Discrete Applied Mathematics, 122(1-3), pp. 167-181. (doi:10.1016/S0166-218X(01)00322-5)

Manlove, D.F., Irving, R. W., Iwama, K., Miyazaki, S. and Morita, Y. (2002) Hard variants of stable marriage. Theoretical Computer Science, 276(1-2), pp. 261-279. (doi:10.1016/S0304-3975(01)00206-7)

2001

Gent, I. P., Irving, R.W., Manlove, D.F., Prosser, P. and Smith, B.M. (2001) A constraint programming approach to the stable marriage problem. In: Proceedings of CP '01: the 7th International Conference on Principles and Practice of Constraint Programming, Paphos, Cyprus, 26 November - 1 December, 2001, pp. 225-239. ISBN 3-540-42863-1

2000

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

1999

Irving, R.W. and Manlove, D.F. (1999) The b-chromatic number of a graph. Discrete Applied Mathematics, 91(1-3), pp. 127-141. (doi:10.1016/S0166-218X(98)00146-2)

Iwama, K., Manlove, D.F., Miyazaki, S. and Morita, Y. (1999) Stable marriage with incomplete lists and ties. In: Proceedings of ICALP '99: the 26th International Colloquium on Automata, Languages and Programming, Prague, Czech Republic, 11-15 July, 1999, pp. 443-452. ISBN 3-540-66224-3

Manlove, D.F. (1999) On the algorithmic complexity of twelve covering and independence parameters of graphs. Discrete Applied Mathematics, 91(1-3), pp. 155-175. (doi:10.1016/S0166-218X(98)00147-4)

This list was generated on Fri Nov 17 14:34:08 2017 GMT.
Number of items: 75.

Articles

Cseh, A., Irving, R. W. and Manlove, D. F. (2017) The Stable Roommates problem with short lists. Theory of Computing Systems, (doi:10.1007/s00224-017-9810-9) (Early Online Publication)

Manlove, D. F., McBride, I. and Trimble, J. (2017) "Almost-stable" matchings in the Hospitals / Residents problem with Couples. Constraints, 22(1), pp. 50-72. (doi:10.1007/s10601-016-9249-7)

Arulselvan, A., Cseh, Á., Groß, M., Manlove, D. and Matuschke, J. (2016) Matchings with lower quotas: Algorithms and complexity. Algorithmica, (doi:10.1007/s00453-016-0252-6) (Early Online Publication)

Cechlarova, K., Fleiner, T., Manlove, D. F. and McBride, I. (2016) Stable matchings of teachers to schools. Theoretical Computer Science, 653, pp. 15-25. (doi:10.1016/j.tcs.2016.09.014)

Cechlárová, K., Eirinakis, P., Fleiner, T., Magos, D., Manlove, D., Mourtos, P., Ocel’áková, E. and Rastegari, B. (2016) Pareto optimal matchings in many-to-many markets with ties. Theory of Computing Systems, 59(4), pp. 700-721. (doi:10.1007/s00224-016-9677-1)

Cseh, Á. and Manlove, D. F. (2016) Stable marriage and roommates problems with restricted edges: complexity and approximability. Discrete Optimization, 20, pp. 62-89. (doi:10.1016/j.disopt.2016.03.002)

Cseh, Á. and Manlove, D. (2015) Stable marriage and roommates problems with restricted edges: complexity and approximability. Lecture Notes in Computer Science, 9347, pp. 15-26. (doi:10.1007/978-3-662-48433-3_2)

Cechlárová, K., Fleiner, T., Manlove, D. F., McBride, I. and Potpinková, E. (2015) Modelling practical placement of trainee teachers to schools. Central European Journal of Operations Research, 23(3), pp. 547-562. (doi:10.1007/s10100-014-0356-5)

Cechlárová, K., Eirinakis, P., Fleiner, T., Magos, D., Manlove, D., Mourtos, I., Ocel’áková, E. and Rastegari, B. (2015) Pareto optimal matchings in many-to-many markets with ties. Lecture Notes in Computer Science, 9347, pp. 27-39. (doi:10.1007/978-3-662-48433-3_3)

Manlove, D. and O'Malley, G. (2014) Paired and altruistic kidney donation in the UK: Algorithms and experimentation. Journal of Experimental Algorithmics, 19(2), 2.6. (doi:10.1145/2670129)

Biró, P. and Manlove, D. F. (2014) Editorial: special issue on matching under preferences. Algorithms, 7(2), pp. 203-205. (doi:10.3390/a7020203)

Biró, P., Manlove, D. F. and McBride, I. (2014) The Hospitals/Residents Problem with Couples: complexity and integer programming models. Lecture Notes in Computer Science, 8504, pp. 10-21. (doi:10.1007/978-3-319-07959-2_2)

Askalidis, G., Immorlica, N., Kwanashie, A., Manlove, D.F. and Pountourakis, E. (2013) Socially stable matchings in the hospitals / residents problem. Lecture Notes in Computer Science, 8037, pp. 85-96. (doi:10.1007/978-3-642-40104-6_8)

Harrenstein, P., Manlove, D. and Wooldridge, M. (2013) The joy of matching. IEEE Intelligent Systems, 28(2), pp. 81-85. (doi:10.1109/MIS.2013.49)

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)

Manlove, D.F. and O’Malley, G. (2012) Paired and altruistic kidney donation in the UK: algorithms and experimentation. Lecture Notes in Computer Science, 7276, pp. 271-282. (doi:10.1007/978-3-642-30850-5_24)

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)

Manlove, D.F., Irving, R.W. and Iwama, K. (2010) Guest editorial: Special issue on matching under preferences. Algorithmica, 58(1), pp. 1-4. (doi:10.1007/s00453-010-9415-z)

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)

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., 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)

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)

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. 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)

Abraham, D.J., Levavi, A., Manlove, D.F. and O'Malley, G. (2008) The stable roommates problem with globally-ranked pairs. Internet Mathematics, 5(4), pp. 493-515. (doi:10.1080/15427951.2008.10129167)

Fleiner, T., Irving, R.W. and Manlove, D.F. (2007) Efficient algorithms for generalized Stable Marriage and Roommates problems. Theoretical Computer Science, 381(1-3), pp. 162-176. (doi:10.1016/j.tcs.2007.04.029)

Abraham, D.J., Irving, R.W. and Manlove, D.F. (2007) Two algorithms for the student-project allocation problem. Journal of Discrete Algorithms, 5(1), pp. 73-90. (doi:10.1016/j.jda.2006.03.006)

Cechlarova, K. and Manlove, D.F. (2005) The exchange-stable marriage problem. Discrete Applied Mathematics, 152(1-3), pp. 109-122. (doi:10.1016/j.dam.2005.06.003)

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

Middendorf, M. and Manlove, D.F. (2004) Combined super-/substring and super-/subsequence problems. Theoretical Computer Science, 320(2-3), pp. 247-267. (doi:10.1016/j.tcs.2004.02.001)

Halldorsson, M., Irving, R.W., Iwama, K., Manlove, D. F., Miyazaki, S., Morita, Y. and Scott, S. (2003) Approximability results for stable marriage problems with ties. Theoretical Computer Science, 306(1-3), pp. 431-447. (doi:10.1016/S0304-3975(03)00321-9)

Irving, R. W. and Manlove, D.F. (2002) The stable roommates problem with ties. Journal of Algorithms, 43(1), pp. 85-105. (doi:10.1006/jagm.2002.1219)

Manlove, D.F. (2002) The structure of stable marriage with indifference. Discrete Applied Mathematics, 122(1-3), pp. 167-181. (doi:10.1016/S0166-218X(01)00322-5)

Manlove, D.F., Irving, R. W., Iwama, K., Miyazaki, S. and Morita, Y. (2002) Hard variants of stable marriage. Theoretical Computer Science, 276(1-2), pp. 261-279. (doi:10.1016/S0304-3975(01)00206-7)

Irving, R.W. and Manlove, D.F. (1999) The b-chromatic number of a graph. Discrete Applied Mathematics, 91(1-3), pp. 127-141. (doi:10.1016/S0166-218X(98)00146-2)

Manlove, D.F. (1999) On the algorithmic complexity of twelve covering and independence parameters of graphs. Discrete Applied Mathematics, 91(1-3), pp. 155-175. (doi:10.1016/S0166-218X(98)00147-4)

Books

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

Book Sections

Klaus, B., Manlove, D. F. and Rossi, F. (2016) Matching under preferences. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J. and Procaccia, A. D. (eds.) Handbook of Computational Social Choice. Cambridge University Press: Cambridge ; New York, pp. 333-355. ISBN 9781107060432

Manlove, D. F. (2015) The hospitals/residents problem. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms. Springer Berlin Heidelberg, pp. 1-6. ISBN 9783642278488 (doi:10.1007/978-3-642-27848-8_180-2)

Kwanashie, A. and Manlove, D. F. (2014) An integer programming approach to the Hospitals/Residents problem with ties. In: Operations Research Proceedings 2013: Selected Papers of the International Conference on Operations Research, OR2013. Series: Operations Research Proceedings. Springer International Publishing, pp. 263-269. ISBN 9783319070001 (doi:10.1007/978-3-319-07001-8_36)

McBride, I. and Manlove, D. F. (2014) An integer programming Model for the Hospitals/Residents Problem with Couples. In: Operations Research Proceedings 2013: Selected Papers of the International Conference on Operations Research, OR2013. Series: Operations Research Proceedings. Springer International Publishing, pp. 293-299. ISBN 9783319070001 (doi:10.1007/978-3-319-07001-8_40)

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. (2008) Hospitals/residents problem. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms. Springer, pp. 390-394. ISBN 9780387301624 (doi:10.1007/978-0-387-30162-4_180)

Conference Proceedings

Cseh, A., Manlove, D. and Irving, R. W. (2016) The Stable Roommates Problem with Short Lists. In: 9th International Symposium on Algorithmic Game Theory (SAGT), Liverpool, UK, 19-21 Sept 2016, pp. 207-219. ISBN 9783662533536 (doi:10.1007/978-3-662-53354-3_17)

Dickerson, J. P., Manlove, D. F., Plaut, B., Sandholm, T. and Trimble, J. (2016) Position-Indexed Formulations for Kidney Exchange. In: 17th ACM Conference on Economics and Computation, Maastricht, The Netherlands, 24-28 Jul 2016, pp. 25-42. ISBN 9781450339360 (doi:10.1145/2940716.2940759)

Cechlarova, K., Klaus, B. and Manlove, D. (2016) Pareto Optimal Matchings of Students to Courses in the Presence of Prerequisites. In: Sixth International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, 22-24 June 2016,

Rastegari, B., Goldberg, P. and Manlove, D. (2016) Preference Elicitation in Matching Markets Via Interviews: A Study of Offline Benchmarks. In: EXPLORE 2016: 3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice, Singapore, 10 May 2016,

Rastegari, B., Goldberg, P. and Manlove, D. (2016) Preference Elicitation in Matching Markets Via Interviews: A Study of Offline Benchmarks. In: AAMAS 2016, Singapore, 9-13 May 2016, pp. 1393-1394. ISBN 9781450342391

Arulselvan, A., Cseh, A., Groß, M., Manlove, D. F. and Matuschke, J. (2015) Many-to-one matchings with lower quotas: algorithms and complexity. In: ISAAC 2015: the 26th International Symposium on Algorithms, Nagoya, Japan, 9-11 Dec 2015, pp. 176-187. ISBN 9783662489710 (doi:10.1007/978-3-662-48971-0_16)

Kwanashie, A., Irving, R. W., Manlove, D. F. and Sng, C. T.S. (2015) Profile-Based Optimal Matchings in the Student-Project Allocation Problem. In: Combinatorial Algorithms: 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), Duluth, MN, USA, 15-17 Oct 2014, pp. 213-225. ISBN 9783319193151 (doi:10.1007/978-3-319-19315-1_19)

Krysta, P., Manlove, D., Rastegari, B. and Zhang, J. (2014) Size versus truthfulness in the house allocation problem. In: Fifteenth ACM Conference on Economics and Computation (EC'14), Palo Alto, CA USA, 8-12 June 2014, pp. 453-470. (doi:10.1145/2600057.2602868)

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. and Manlove, D.F. (2007) An 8/5 approximation algorithm for a hard variant of stable marriage. In: Proceedings of COCOON 2007, 13th Annual International Computing and Combinatorics Conference, Banff, Canada, 16-19 July 2007, pp. 548-558. (doi:10.1007/978-3-540-73545-8_53)

Manlove, D.F., O'Malley, G., Prosser, P. and Unsworth, C. (2007) A constraint programming approach to the hospitals/residents problem. In: Proceedings of CP-AI-OR '07: the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Brussels, Belgium, 23-26 May, 2007, pp. 155-170. (doi:10.1007/978-3-540-72397-4_12)

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

Manlove, D.F. and Sng, C.T.S. (2006) Popular Matchings in the Capacitated House Allocation Problem. In: Proceedings of ESA 2006: the 14th Annual European Symposium on Algorithms, Zurich, Switzerland, 11-13 September 2006, pp. 492-503. ISBN 978-3-540-38875-3 (doi:10.1007/11841036_45)

Abraham, D.J., Biro, P. and Manlove, D.F. (2006) "Almost stable" matchings in the Roommates problem. In: Proceedings of WAOA 2005: the 3rd International Workshop on Approximation and Online Algorithms, Palma, Mallorca, 6-7 October, 2005, pp. 1-14. ISBN 3-540-32207-8 (doi:10.1007/11671411_1)

Fernau, H. and Manlove, D. F. (2006) Vertex and Edge Covers With Clustering Properties: Complexity and Algorithms. In: Algorithms and Complexity in Durham 2006: Proceedings of the Second ACiD Workshop, Durham, UK, 18-20 Sep 2006, pp. 69-84. ISBN 9781904987383

Irving, R. W., Manlove, D. F. and O'Malley, G. (2006) Stable Marriage with Ties and Bounded Length Preference Lists. In: Algorithms and Complexity in Durham 2006: Proceedings of the Second ACiD Workshop, Durham, UK, 18-20 Sep 2006, pp. 95-106. ISBN 9781904987383

Cechlárová, K., Fleiner, T. and Manlove, D. (2005) The Kidney Exchange Game. In: 8th International Symposium on Operational Research in Slovenia, Nova Gorica, Slovenia, 28-30 Sep 2005, pp. 77-83. ISBN 9789616165204

Manlove, D. F. and O'Malley, G. (2005) Modelling and Solving the Stable Marriage Problem Using Constraint Programming. In: Fifth Workshop on Modelling and Solving Problems with Constraints, Edinburgh, Scotland, 30 Jul - 05 Aug 2005, pp. 10-17.

Manlove, D. F. and O'Malley, G. (2005) Student-Project Allocation with Preferences over Projects. In: Algorithms and Complexity in Durham 2005: Proceedings of the First ACiD Workshop, Durham, UK, 08-10 Jul 2005, pp. 69-80. ISBN 9781904987109

Manlove, D. F. , O'Malley, G., Prosser, P. and Unsworth, C. (2005) A Constraint Programming Approach to the Hospitals / Residents Problem. In: Fourth Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Sitges, Spain, 01-05 Oct 2005, pp. 28-43.

Abraham, D.J., Cechlarova, K., Manlove, D.F. and Mehlhorn, K. (2004) Pareto optimality in house allocation problems. In: Proceedings of ISAAC 2004: the 15th Annual International Symposium on Algorithms and Computation, Hong Kong, 20-22 December, 2004, pp. 3-15. ISBN 3-540-24131-0

Abraham, D.J., Irving, R.W. and Manlove, D.F. (2003) The student-project allocation problem. In: Proceedings of ISAAC 2003: the 14th Annual International Symposium on Algorithms and Computation, Kyoto, Japan, 15-17 December, 2003, pp. 474-484. ISBN 3-540-20695-7

Irving, R.W., Manlove, D.F. and Scott, S. (2003) Strong stability in the Hospitals/Residents problem. In: Proceedings of STACS 2003: the 20th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 27 February - 1 March, 2003, pp. 439-450. ISBN 3-540-00623-0

Gent, I. P., Irving, R.W., Manlove, D.F., Prosser, P. and Smith, B.M. (2001) A constraint programming approach to the stable marriage problem. In: Proceedings of CP '01: the 7th International Conference on Principles and Practice of Constraint Programming, Paphos, Cyprus, 26 November - 1 December, 2001, pp. 225-239. ISBN 3-540-42863-1

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

Iwama, K., Manlove, D.F., Miyazaki, S. and Morita, Y. (1999) Stable marriage with incomplete lists and ties. In: Proceedings of ICALP '99: the 26th International Colloquium on Automata, Languages and Programming, Prague, Czech Republic, 11-15 July, 1999, pp. 443-452. ISBN 3-540-66224-3

This list was generated on Fri Nov 17 14:34:08 2017 GMT.