210 results on '"David F. Manlove"'
Search Results
2. Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.
3. Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem.
4. New Algorithms for Hierarchical Optimization in Kidney Exchange Programs.
5. Packing Krs in bounded degree graphs.
6. MATWA: A Web Toolkit for Matching under Preferences.
7. On weakly and strongly popular rankings.
8. Half-cycle: A new formulation for modelling kidney exchange problems.
9. Envy-freeness in 3D hedonic games.
10. Student-project allocation with preferences over projects: Algorithmic and experimental results.
11. Super-stability in the student-project allocation problem with ties.
12. Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples.
13. The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences.
14. On Weakly and Strongly Popular Rankings.
15. An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties.
16. Algorithms for New Types of Fair Stable Matchings.
17. Modelling and optimisation in European Kidney Exchange Programmes.
18. Algorithmic aspects of upper edge domination.
19. Envy-freeness in 3D Hedonic Games.
20. Packing Krs in bounded degree graphs.
21. A General Framework for Stable Roommates Problems using Answer Set Programming.
22. Super-Stability in the Student-Project Allocation Problem with Ties.
23. An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects.
24. A 3/2-Approximation Algorithm for the Student-Project Allocation Problem.
25. On absolutely and simply popular rankings.
26. Profile-based optimal stable matchings in the Roommates problem.
27. Mathematical models for stable matching problems with ties and incomplete lists.
28. Size Versus Truthfulness in the House Allocation Problem.
29. The Stable Roommates Problem with Short Lists.
30. Improved instance generation for kidney exchange programmes.
31. Pareto optimal matchings of students to courses in the presence of prerequisites.
32. Matchings with Lower Quotas: Algorithms and Complexity.
33. Position-Indexed Formulations for Kidney Exchange.
34. The Stable Roommates Problem with Short Lists.
35. 'Almost-stable' matchings in the Hospitals / Residents problem with Couples.
36. Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.
37. Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability.
38. Pareto Optimal Matchings in Many-to-Many Markets with Ties.
39. Data and optimisation requirements for Kidney Exchange Programs.
40. Improving solution times for stable matching problems through preprocessing.
41. Two-sided profile-based optimality in the stable marriage problem.
42. An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties.
43. Selected open problems in Matching Under Preferences.
44. Stable Marriage and Roommates problems with restricted edges: Complexity and approximability.
45. Stable matchings of teachers to schools.
46. Pareto Optimal Matchings in Many-to-Many Markets with Ties.
47. Size versus truthfulness in the house allocation problem.
48. The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models.
49. Profile-Based Optimal Matchings in the Student/Project Allocation Problem.
50. Socially Stable Matchings in the Hospitals/Residents Problem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.