Professor David Manlove

Professor of Algorithms and Complexity (Computing Science)

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

Room S151, School of Computing Science, Sir Alywn Williams Building, University of Glasgow, Glasgow, G12 8QQ

Biography

I am Professor of Algorithms and Complexity at the School of Computing Science, University of Glasgow. I joined the academic staff as a lecturer in October 2000, moving to senior lecturer in August 2009 and then to professor in August 2018. I held a Royal Society of Edinburgh / Scottish Government Personal Research Fellowship from October 2003 to September 2006.

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

I am a Fellow of the Higher Education Academy and served as Chair of COST Action CA15210 (ENCKEP: European Network for Collaboration on Kidney Exchange Programmes). Within the School, I am leader 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

Publications

List by: Type | Date

Jump to: 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999

Number of items: 106.

2024

McKay, M. , Cseh, A. and Manlove, D. (2024) Envy-freeness in 3D hedonic games. Autonomous Agents and Multi-Agent Systems, 38(2), 37. (doi: 10.1007/s10458-024-09657-6)

Glitzner, F. and Manlove, D. (2024) MATWA: A Web Toolkit for Matching under Preference. In: 39th Annual AAAI Conference on Artificial Intelligence (AAAI’25), Philadelphia, Pennsylvania, USA, 25 February – 4 March 2025, (Accepted for Publication)

Ashlagi, I., Cseh, Á., Manlove, D. , Ockenfels, A. and Pettersson, W. (2024) Designing a kidney exchange program in Germany: simulations and recommendations. Central European Journal of Operations Research, (doi: 10.1007/s10100-024-00933-0) (Early Online Publication)

McKay, M. and Manlove, D. (2024) Packing Krs in bounded degree graphs. Discrete Applied Mathematics, 352, pp. 20-32. (doi: 10.1016/j.dam.2024.03.010)

Glitzner, F. and Manlove, D. (2024) Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem. In: 17th International Symposium on Algorithmic Game Theory (SAGT), Amsterdam, The Netherlands, 03-06 Sep 2024, (Accepted for Publication)

Delorme, M., García, S., Gondzio, J., Kalcsics, J., Manlove, D. and Pettersson, W. (2024) New algorithms for hierarchical optimization in kidney exchange programs. Operations Research, 72(4), pp. 1654-1673. (doi: 10.1287/opre.2022.2374)

Csáji, G., Manlove, D. , McBride, I. and Trimble, J. (2024) Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples. In: IJCAI 2024, the 33rd International Joint Conference on Artificial Intelligence, Jeju, South Korea, 3-9 August 2024, pp. 2731-2739. ISBN 9781956792041 (doi: 10.24963/ijcai.2024/302)

2023

Kraiczy, S., Cseh, Á. and Manlove, D. (2023) On weakly and strongly popular rankings. Discrete Applied Mathematics, 340, pp. 134-152. (doi: 10.1016/j.dam.2023.06.041)

Chen, J. and Manlove, D. (2023) Algorithmics of matching markets. In: Echenique, F., Immorlica, N. and Vazirani, V. V. (eds.) Online and Matching-Based Market Design. Cambridge University Press: Cambridge, pp. 283-302. ISBN 9781108831994 (doi: 10.1017/9781108937535.013)

Delorme, M., Manlove, D. and Smeets, T. (2023) Half-cycle: a new formulation for modelling kidney exchange problems. Operations Research Letters, 51(3), pp. 234-241. (doi: 10.1016/j.orl.2023.02.009)

2022

Olaosebikan, S. and Manlove, D. (2022) Super-stability in the student-project allocation problem with ties. Journal of Combinatorial Optimization, 43(5), pp. 1203-1239. (doi: 10.1007/s10878-020-00632-x)

Delorme, M., García, S., Gondzio, J., Kalcsics, J., Manlove, D. , Pettersson, W. and Trimble, J. (2022) Improved instance generation for kidney exchange programmes. Computers and Operations Research, 141, 105707. (doi: 10.1016/j.cor.2022.105707)

Manlove, D. , Milne, D. and Olaosebikan, S. (2022) Student-project allocation with preferences over projects: algorithmic and experimental results. Discrete Applied Mathematics, 308, pp. 220-234. (doi: 10.1016/j.dam.2020.08.015)

2021

McKay, M. and Manlove, D. (2021) The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences. In: 14th International Symposium on Algorithmic Game Theory (SAGT 2021), Aarhus, Denmark, 21-24 Sep 2021, pp. 266-280. ISBN 9783030859466 (doi: 10.1007/978-3-030-85947-3_18)

Delorme, M., García, S., Gondzio, J., Kalcsics, J., Manlove, D. and Pettersson, W. (2021) Stability in the hospitals/residents problem with couples and ties: mathematical models and computational studies. Omega, 103, 102386. (doi: 10.1016/j.omega.2020.102386)

Monnot, J., Fernau, H. and Manlove, D. (2021) Algorithmic aspects of upper edge domination. Theoretical Computer Science, 877, pp. 46-57. (doi: 10.1016/j.tcs.2021.03.038)

Biró, P. et al. (2021) Modelling and optimisation in European kidney exchange programmes. European Journal of Operational Research, 291(2), pp. 447-456. (doi: 10.1016/j.ejor.2019.09.006)

Kraiczy, S., Cseh, A. and Manlove, D. (2021) On Weakly and Strongly Popular Rankings. In: 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021), London, UK (Virtual), 3-7 May 2021, pp. 1563-1565. ISBN 9781450383073 (doi: 10.5555/3463952.3464160)

Pettersson, W. , Delorme, M., García, S., Gondzio, J., Kalcsics, J. and Manlove, D. (2021) Improving solution times of stable matching problems through preprocessing. Computers and Operations Research, 128, 105128. (doi: 10.1016/j.cor.2020.105128)

Smeulders, B. et al. (2021) Data and optimization requirements for Kidney Exchange Programs. Health Informatics Journal, 27(2), pp. 1-15. (doi: 10.1177/14604582211009918) (PMID:33878984)

2020

Erdem, E., Fidan, M., Manlove, D. and Prosser, P. (2020) A general framework for stable roommates problems using answer set programming. Theory and Practice of Logic Programming, 20(6), pp. 911-925. (doi: 10.1017/S1471068420000277)

Cooper, F. and Manlove, D. (2020) Algorithms for New Types of Fair Stable Matchings. In: 18th International Symposium on Experimental Algorithms (SEA 2020), Catania, Italy, 16-18 Jun 2020, p. 20. ISBN 9783959771481 (doi: 10.4230/LIPIcs.SEA.2020.20)

Olaosebikan, S. and Manlove, D. (2020) An Algorithm for Strong Stability in the Student-Project Allocation Problem With Ties. In: 6th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Sangareddy, India, 13-15 Feb 2020, pp. 384-399. ISBN 9783030392185 (doi: 10.1007/978-3-030-39219-2_31)

2019

Delorme, M., Garcia, S., Gondzio, J., Kalcsics, J., Manlove, D. and Pettersson, W. (2019) Mathematical models for stable matching problems with ties and incomplete lists. European Journal of Operational Research, 277(2), pp. 426-441. (doi: 10.1016/j.ejor.2019.03.017)

Krysta, P., Manlove, D. , Rastegari, B. and Zhang, J. (2019) Size versus truthfulness in the House Allocation problem. Algorithmica, 81(9), pp. 3422-3463. (doi: 10.1007/s00453-019-00584-7)

Biró, P. et al. (2019) Building kidney exchange programmes in Europe - an overview of exchange practice and activities. Transplantation, 103(7), pp. 1514-1522. (doi: 10.1097/TP.0000000000002432) (PMID:30247314) (PMCID:PMC6613834)

Cseh, A., Irving, R. W. and Manlove, D. F. (2019) The Stable Roommates problem with short lists. Theory of Computing Systems, 63(1), pp. 128-149. (doi: 10.1007/s00224-017-9810-9)

2018

Cechlárová, K., Klaus, B. and Manlove, D. F. (2018) Pareto optimal matchings of students to courses in the presence of prerequisites. Discrete Optimization, 29, pp. 174-195. (doi: 10.1016/j.disopt.2018.04.004)

Arulselvan, A., Cseh, Á., Groß, M., Manlove, D. and Matuschke, J. (2018) Matchings with lower quotas: Algorithms and complexity. Algorithmica, 80(1), pp. 185-208. (doi: 10.1007/s00453-016-0252-6)

Cooper, F. and Manlove, D. (2018) A ³/₂-approximation Algorithm for the Student-Project Allocation Problem. In: 17th International Symposium on Experimental Algorithms (SEA 2018), L'Aquila, Italy, 27-29 Jun 2018, 8:1-8:13. ISBN 9783959770705 (doi: 10.4230/LIPIcs.SEA.2018.8)

Manlove, D. (2018) How operational research helps kidney patients in the UK. Impact, 2018(1), pp. 16-19. (doi: 10.1080/2058802X.2018.1435455)

Manlove, D. , Milne, D. and Olaosebikan, S. (2018) An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects. In: International Symposium on Combinatorial Optimization (ISCO 2018), Marrakesh, Morocco, 11-13 Apr 2018, pp. 313-325. ISBN 9783319961507 (doi: 10.1007/978-3-319-96151-4_27)

Olaosebikan, S. and Manlove, D. (2018) Super-stability in the Student-Project Allocation Problem with Ties. In: 12th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2018), Atlanta, GA, USA, 15-17 Dec 2018, pp. 357-371. ISBN 9783030046507 (doi: 10.1007/978-3-030-04651-4_24)

2017

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

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)

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)

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,

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)

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 Tue Jan 14 19:38:08 2025 GMT.

Jump to: Articles | Books | Book Sections | Conference Proceedings