David Manlove

According to our database1, David Manlove authored at least 75 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Algorithms for New Types of Fair Stable Matchings.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
The Stable Roommates Problem with Short Lists.
Theory Comput. Syst., 2019

Mathematical models for stable matching problems with ties and incomplete lists.
Eur. J. Oper. Res., 2019

Selected open problems in Matching Under Preferences.
Bull. EATCS, 2019

Two-sided profile-based optimality in the stable marriage problem.
CoRR, 2019

Size Versus Truthfulness in the House Allocation Problem.
Algorithmica, 2019

2018
Pareto optimal matchings of students to courses in the presence of prerequisites.
Discret. Optim., 2018

Matchings with Lower Quotas: Algorithms and Complexity.
Algorithmica, 2018

A 3/2-Approximation Algorithm for the Student-Project Allocation Problem.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Super-Stability in the Student-Project Allocation Problem with Ties.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
"Almost-stable" matchings in the Hospitals / Residents problem with Couples.
Constraints An Int. J., 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

Pareto Optimal Matchings in Many-to-Many Markets with Ties.
Theory Comput. Syst., 2016

Stable Marriage and Roommates problems with restricted edges: Complexity and approximability.
Discret. Optim., 2016

Preference Elicitation in Matching Markets via Interviews: A Study of Offline Benchmarks.
CoRR, 2016

"Almost-stable" matchings in the Hospitals / Residents problem with Couples: An Integer Programming approach.
CoRR, 2016

Position-Indexed Formulations for Kidney Exchange.
Proceedings of the 2016 ACM Conference on Economics and Computation, 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.
Central Eur. J. Oper. Res., 2015

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation.
ACM J. Exp. Algorithmics, 2014

Algorithmics of Matching Under Preferences.
Bull. 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

Profile-Based Optimal Matchings in the Student/Project Allocation Problem.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
The Joy of Matching.
IEEE Intell. Syst., 2013

The Hospitals / Residents problem with Free Pairs
CoRR, 2013

The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models.
CoRR, 2013

An Integer Programming Approach to the Hospital/Residents Problem with Ties.
CoRR, 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: 978-981-4425-26-1, 2013

2012
"Almost stable" matchings in the Roommates problem with bounded preference lists.
Theor. Comput. Sci., 2012

2011
An algorithm for a super-stable roommates problem.
Theor. Comput. Sci., 2011

2010
Size versus stability in the marriage problem.
Theor. Comput. Sci., 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 J. Exp. Algorithmics, 2009

Stable marriage with ties and bounded length preference lists.
J. Discrete Algorithms, 2009

Vertex and edge covers with clustering properties: Complexity and algorithms.
J. Discrete Algorithms, 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

Student-Project Allocation with preferences over Projects.
J. Discrete Algorithms, 2008

Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems.
J. Comb. Optim., 2008

The Stable Roommates Problem with Globally Ranked Pairs.
Internet Math., 2008

The stable marriage problem with master preference lists.
Discret. Appl. Math., 2008

2007
Efficient algorithms for generalized Stable Marriage and Roommates problems.
Theor. Comput. Sci., 2007

Two algorithms for the Student-Project Allocation problem.
J. Discrete Algorithms, 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/5-Approximation 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

2005
On the approximability of the maximum induced matching problem.
J. Discrete Algorithms, 2005

The exchange-stable marriage problem.
Discret. Appl. Math., 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

2004
Combined super-/substring and super-/subsequence problems.
Theor. Comput. Sci., 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 Student-Project 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.
Discret. Appl. Math., 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.
Discret. Appl. Math., 1999

The b-chromatic Number of a Graph.
Discret. Appl. Math., 1999

Stable Marriage with Incomplete Lists and Ties.
Proceedings of the Automata, 1999


  Loading...