David Manlove
According to our database^{1},
David Manlove
authored at least 68 papers
between 1999 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2019
Mathematical models for stable matching problems with ties and incomplete lists.
European Journal of Operational Research, 2019
Selected open problems in Matching Under Preferences.
Bulletin of the EATCS, 2019
2018
Pareto optimal matchings of students to courses in the presence of prerequisites.
Discrete Optimization, 2018
Matchings with Lower Quotas: Algorithms and Complexity.
Algorithmica, 2018
A 3/2Approximation Algorithm for the StudentProject Allocation Problem.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018
An Integer Programming Approach to the StudentProject Allocation Problem with Preferences over Projects.
Proceedings of the Combinatorial Optimization  5th International Symposium, 2018
SuperStability in the StudentProject Allocation Problem with Ties.
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
"Almoststable" matchings in the Hospitals / Residents problem with Couples.
Constraints, 2017
2016
Matching under Preferences.
Proceedings of the Handbook of Computational Social Choice, 2016
Hospitals/Residents Problem.
Encyclopedia of Algorithms, 2016
Stable matchings of teachers to schools.
Theor. Comput. Sci., 2016
PositionIndexed Formulations for Kidney Exchange.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
The Stable Roommates Problem with Short Lists.
Proceedings of the Algorithmic Game Theory  9th International Symposium, 2016
Preference Elicitation in Matching Markets via Interviews: A Study of Offline Benchmarks (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
2015
Modelling practical placement of trainee teachers to schools.
CEJOR, 2015
Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability.
Proceedings of the Algorithmic Game Theory  8th International Symposium, 2015
Pareto Optimal Matchings in ManytoMany Markets with Ties.
Proceedings of the Algorithmic Game Theory  8th International Symposium, 2015
Manytoone Matchings with Lower Quotas: Algorithms and Complexity.
Proceedings of the Algorithms and Computation  26th International Symposium, 2015
2014
Algorithmics of Matching Under Preferences.
Bulletin of the EATCS, 2014
Editorial: Special Issue on Matching under Preferences.
Algorithms, 2014
The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models.
Proceedings of the Experimental Algorithms  13th International Symposium, 2014
Size versus truthfulness in the house allocation problem.
Proceedings of the ACM Conference on Economics and Computation, 2014
ProfileBased Optimal Matchings in the Student/Project Allocation Problem.
Proceedings of the Combinatorial Algorithms  25th International Workshop, 2014
2013
The Joy of Matching.
IEEE Intelligent Systems, 2013
Socially Stable Matchings in the Hospitals/Residents Problem.
Proceedings of the Algorithms and Data Structures  13th International Symposium, 2013
An Integer Programming Model for the Hospitals/Residents Problem with Couples.
Proceedings of the Operations Research Proceedings 2013, 2013
An Integer Programming Approach to the Hospitals/Residents Problem with Ties.
Proceedings of the Operations Research Proceedings 2013, 2013
Algorithmics of Matching Under Preferences
Series on Theoretical Computer Science 2, WorldScientific, ISBN: 9789814425261, 2013
2012
"Almost stable" matchings in the Roommates problem with bounded preference lists.
Theor. Comput. Sci., 2012
Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation.
Proceedings of the Experimental Algorithms  11th International Symposium, 2012
2011
An algorithm for a superstable roommates problem.
Theor. Comput. Sci., 2011
2010
The College Admissions problem with lower and common quotas.
Theor. Comput. Sci., 2010
Popular matchings in the weighted capacitated house allocation problem.
J. Discrete Algorithms, 2010
Keeping partners together: algorithmic results for the hospitals/residents problem with couples.
J. Comb. Optim., 2010
Guest Editorial: Special Issue on Matching Under Preferences.
Algorithmica, 2010
Popular Matchings in the Marriage and Roommates Problems.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
2009
Finding large stable matchings.
ACM Journal of Experimental Algorithmics, 2009
Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs.
Discrete Math., Alg. and Appl., 2009
2008
Hospitals/Residents Problem.
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems.
J. Comb. Optim., 2008
The stable marriage problem with master preference lists.
Discrete Applied Mathematics, 2008
Size Versus Stability in the Marriage Problem.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008
2007
Efficient algorithms for generalized Stable Marriage and Roommates problems.
Theor. Comput. Sci., 2007
Two algorithms for the StudentProject Allocation problem.
J. Discrete Algorithms, 2007
The Stable Roommates Problem with GloballyRanked Pairs.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
A Constraint Programming Approach to the Hospitals / Residents Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007
An 8/5Approximation Algorithm for a Hard Variant of Stable Marriage.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
2006
Popular Matchings in the Capacitated House Allocation Problem.
Proceedings of the Algorithms, 2006
Stable Marriage with Ties and Bounded Length Preference Lists.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006
2005
On the approximability of the maximum induced matching problem.
J. Discrete Algorithms, 2005
The exchangestable marriage problem.
Discrete Applied Mathematics, 2005
"Almost Stable" Matchings in the Roommates Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005
Pareto Optimality in House Allocation Problems.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
StudentProject Allocation with Preferences over Projects.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005
2004
Combined super/substring and super/subsequence problems.
Theor. Comput. Sci., 2004
Pareto Optimality in House Allocation Problems.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Approximability results for stable marriage problems with ties.
Theor. Comput. Sci., 2003
Strong Stability in the Hospitals/Residents Problem.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
The StudentProject Allocation Problem.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
2002
Hard variants of stable marriage.
Theor. Comput. Sci., 2002
The Stable Roommates Problem with Ties.
J. Algorithms, 2002
The structure of stable marriage with indifference.
Discrete Applied Mathematics, 2002
2001
A Constraint Programming Approach to the Stable Marriage Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2001
2000
The Hospitals/Residents Problem with Ties.
Proceedings of the Algorithm Theory, 2000
1999
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs.
Discrete Applied Mathematics, 1999
The bchromatic Number of a Graph.
Discrete Applied Mathematics, 1999
Stable Marriage with Incomplete Lists and Ties.
Proceedings of the Automata, 1999