David F. Manlove

Discret. Appl. Math., December, 2023

Half-cycle: A new formulation for modelling kidney exchange problems.

[BibT_eX]

[DOI]

Maxence Delorme

Tom Smeets

Oper. Res. Lett., May, 2023

Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Super-stability in the student-project allocation problem with ties.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Student-project allocation with preferences over projects: Algorithmic and experimental results.

[BibT_eX]

[DOI]

Duncan Milne

Discret. Appl. Math., 2022

Envy-freeness in 3D Hedonic Games.

[BibT_eX]

[DOI]

Michael McKay

CoRR, 2022

Packing K<sub>r</sub>s in bounded degree graphs.

[BibT_eX]

[DOI]

Michael McKay

CoRR, 2022

Improved instance generation for kidney exchange programmes.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

2021

Algorithmic aspects of upper edge domination.

[BibT_eX]

[DOI]

Jérôme Monnot

Henning Fernau

Theor. Comput. Sci., 2021

Data and optimisation requirements for Kidney Exchange Programs.

[BibT_eX]

[DOI]

Joris van de Klundert

Paolo Ferrari

Health Informatics J., 2021

Modelling and optimisation in European Kidney Exchange Programmes.

[BibT_eX]

[DOI]

Joris van de Klundert

Alessandro Nanni Costa

Eur. J. Oper. Res., 2021

Profile-based optimal stable matchings in the Roommates problem.

[BibT_eX]

[DOI]

Sofia Simola

CoRR, 2021

On absolutely and simply popular rankings.

[BibT_eX]

[DOI]

Sonja Kraiczy

CoRR, 2021

Improving solution times for stable matching problems through preprocessing.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences.

[BibT_eX]

[DOI]

Michael McKay

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

2020

A General Framework for Stable Roommates Problems using Answer Set Programming.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2020

Algorithms for New Types of Fair Stable Matchings.

[BibT_eX]

[DOI]

Frances Cooper

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

The Stable Roommates Problem with Short Lists.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Mathematical models for stable matching problems with ties and incomplete lists.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Selected open problems in Matching Under Preferences.

[BibT_eX]

[DOI]

Katarína Cechlárová

Bull. EATCS, 2019

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

[BibT_eX]

[DOI]

Frances Cooper

CoRR, 2019

Size Versus Truthfulness in the House Allocation Problem.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Pareto optimal matchings of students to courses in the presence of prerequisites.

[BibT_eX]

[DOI]

Katarína Cechlárová

Bettina Klaus

Discret. Optim., 2018

Matchings with Lower Quotas: Algorithms and Complexity.

[BibT_eX]

[DOI]

Algorithmica, 2018

A 3/2-Approximation Algorithm for the Student-Project Allocation Problem.

[BibT_eX]

[DOI]

Frances Cooper

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects.

[BibT_eX]

[DOI]

Duncan Milne

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

"Almost-stable" matchings in the Hospitals / Residents problem with Couples.

[BibT_eX]

[DOI]

James Trimble

Constraints An Int. J., 2017

Preface.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2017

2016

Matching under Preferences.

[BibT_eX]

[DOI]

Bettina Klaus

Francesca Rossi

Proceedings of the Handbook of Computational Social Choice, 2016

Hospitals/Residents Problem.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Stable matchings of teachers to schools.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Pareto Optimal Matchings in Many-to-Many Markets with Ties.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Stable Marriage and Roommates problems with restricted edges: Complexity and approximability.

[BibT_eX]

[DOI]

Discret. Optim., 2016

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

[BibT_eX]

[DOI]

Baharak Rastegari

Paul Goldberg

CoRR, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Position-Indexed Formulations for Kidney Exchange.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

Baharak Rastegari

Paul Goldberg

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Modelling practical placement of trainee teachers to schools.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2015

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation.

[BibT_eX]

[DOI]

Gregg O'Malley

ACM J. Exp. Algorithmics, 2014

Algorithmics of Matching Under Preferences.

[BibT_eX]

[DOI]

Bull. EATCS, 2014

Editorial: Special Issue on Matching under Preferences.

[BibT_eX]

[DOI]

Algorithms, 2014

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

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Profile-Based Optimal Matchings in the Student/Project Allocation Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

The Joy of Matching.

[BibT_eX]

[DOI]

Paul Harrenstein

Michael J. Wooldridge

IEEE Intell. Syst., 2013

The Hospitals / Residents problem with Free Pairs

[BibT_eX]

[DOI]

Augustine Kwanashie

CoRR, 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

An Integer Programming Approach to the Hospital/Residents Problem with Ties.

[BibT_eX]

[DOI]

Augustine Kwanashie

CoRR, 2013

Socially Stable Matchings in the Hospitals/Residents Problem.

[BibT_eX]

[DOI]

Emmanouil Pountourakis

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

An Integer Programming Model for the Hospitals/Residents Problem with Couples.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2013, 2013

An Integer Programming Approach to the Hospitals/Residents Problem with Ties.

[BibT_eX]

[DOI]

Augustine Kwanashie

Proceedings of the Operations Research Proceedings 2013, 2013

Algorithmics of Matching Under Preferences

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Eric McDermid

Theor. Comput. Sci., 2012

2011

An algorithm for a super-stable roommates problem.

[BibT_eX]

[DOI]

Tamás Fleiner

Theor. Comput. Sci., 2011

2010

Size versus stability in the marriage problem.

[BibT_eX]

[DOI]

Shubham Mittal

Theor. Comput. Sci., 2010

The College Admissions problem with lower and common quotas.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Popular matchings in the weighted capacitated house allocation problem.

[BibT_eX]

[DOI]

Colin T. S. Sng

J. Discrete Algorithms, 2010

Keeping partners together: algorithmic results for the hospitals/residents problem with couples.

[BibT_eX]

[DOI]

Eric McDermid

J. Comb. Optim., 2010

Guest Editorial: Special Issue on Matching Under Preferences.

[BibT_eX]

[DOI]

Kazuo Iwama

Algorithmica, 2010

Popular Matchings in the Marriage and Roommates Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Finding large stable matchings.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Stable marriage with ties and bounded length preference lists.

[BibT_eX]

[DOI]

Gregg O'Malley

J. Discrete Algorithms, 2009

Vertex and edge covers with clustering properties: Complexity and algorithms.

[BibT_eX]

[DOI]

Henning Fernau

J. Discrete Algorithms, 2009

Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs.

[BibT_eX]

[DOI]

Romeo Rizzi

Discret. Math. Algorithms Appl., 2009

2008

Hospitals/Residents Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Student-Project Allocation with preferences over Projects.

[BibT_eX]

[DOI]

Gregg O'Malley

J. Discrete Algorithms, 2008

Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

The Stable Roommates Problem with Globally Ranked Pairs.

[BibT_eX]

[DOI]

Internet Math., 2008

The stable marriage problem with master preference lists.

[BibT_eX]

[DOI]

Sandy Scott

Discret. Appl. Math., 2008

2007

Efficient algorithms for generalized Stable Marriage and Roommates problems.

[BibT_eX]

[DOI]

Tamás Fleiner

Theor. Comput. Sci., 2007

Two algorithms for the Student-Project Allocation problem.

[BibT_eX]

[DOI]

David J. Abraham

J. Discrete Algorithms, 2007

A Constraint Programming Approach to the Hospitals / Residents Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Popular Matchings in the Capacitated House Allocation Problem.

[BibT_eX]

[DOI]

Colin T. S. Sng

Proceedings of the Algorithms, 2006

2005

On the approximability of the maximum induced matching problem.

[BibT_eX]

[DOI]

William Duckworth

Michele Zito

J. Discrete Algorithms, 2005

The exchange-stable marriage problem.

[BibT_eX]

[DOI]

Katarína Cechlárová

Discret. Appl. Math., 2005

"Almost Stable" Matchings in the Roommates Problem.

[BibT_eX]

[DOI]

David J. Abraham

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Pareto Optimality in House Allocation Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Combined super-/substring and super-/subsequence problems.

[BibT_eX]

[DOI]

Martin Middendorf

Theor. Comput. Sci., 2004

2003

Approximability results for stable marriage problems with ties.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Theor. Comput. Sci., 2003

Strong Stability in the Hospitals/Residents Problem.

[BibT_eX]

[DOI]

Sandy Scott

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

The Student-Project Allocation Problem.

[BibT_eX]

[DOI]

David J. Abraham

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Hard variants of stable marriage.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The Stable Roommates Problem with Ties.

[BibT_eX]

[DOI]

J. Algorithms, 2002

The structure of stable marriage with indifference.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

A Constraint Programming Approach to the Stable Marriage Problem.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

The Hospitals/Residents Problem with Ties.

[BibT_eX]

[DOI]

Sandy Scott

Proceedings of the Algorithm Theory, 2000

1999

On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

The b-chromatic Number of a Graph.

[BibT_eX]

[DOI]