Robert W. Irving

Theory Comput. Syst., 2019

2016

Stable Marriage.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Optimal Stable Marriage.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Matching couples with Scarf's algorithm.

[BibT_eX]

[DOI]

Péter Biró

Tamás Fleiner

Ann. Math. Artif. Intell., 2016

2014

Sex-Equal Stable Matchings: Complexity and Exact Algorithms.

[BibT_eX]

[DOI]

Eric McDermid

Algorithmica, 2014

Reasoning about optimal stable matchings under partial information.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

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

[BibT_eX]

[DOI]

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

2013

Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists.

[BibT_eX]

[DOI]

Algorithms, 2013

2011

An algorithm for a super-stable roommates problem.

[BibT_eX]

[DOI]

Tamás Fleiner

Theor. Comput. Sci., 2011

Stable matching with couples: An empirical study.

[BibT_eX]

[DOI]

Péter Biró

Ildikó Schlotter

ACM J. Exp. Algorithmics, 2011

Popular matchings: structure and algorithms.

[BibT_eX]

[DOI]

Eric McDermid

J. Comb. Optim., 2011

2010

The College Admissions problem with lower and common quotas.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Mapping Affymetrix Microarray Probes to the Rat Genome via a Persistent Index.

[BibT_eX]

[DOI]

Int. J. Knowl. Discov. Bioinform., 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]

Péter Biró

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

2008

Stable Marriage.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Optimal Stable Marriage.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

Stable matching problems with exchange restrictions.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

The stable marriage problem with master preference lists.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

Efficient algorithms for generalized Stable Marriage and Roommates problems.

[BibT_eX]

[DOI]

Tamás Fleiner

Theor. Comput. Sci., 2007

Popular Matchings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Two algorithms for the Student-Project Allocation problem.

[BibT_eX]

[DOI]

David J. Abraham

J. Discrete Algorithms, 2007

The cycle roommates problem: a hard case of kidney exchange.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

The stable fixtures problem - A many-to-many extension of stable roommates.

[BibT_eX]

[DOI]

Discret. Appl. Math., 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

Rank-maximal matchings.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

2003

Approximability results for stable marriage problems with ties.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Theor. Comput. Sci., 2003

The suffix binary search tree and suffix AVL tree.

[BibT_eX]

[DOI]

Lorna Love

J. Discrete Algorithms, 2003

Strong Stability in the Hospitals/Residents Problem.

[BibT_eX]

[DOI]

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

Database indexing for large DNA and protein sequence collections.

[BibT_eX]

[DOI]

Ela Hunt

Malcolm P. Atkinson

VLDB J., 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

2001

Sorting Strings by Reversals and by Transpositions.

[BibT_eX]

[DOI]

David A. Christie

SIAM J. Discret. Math., 2001

A Database Index to Large Biological Sequences.

[BibT_eX]

[DOI]

Ela Hunt

Malcolm P. Atkinson

Proceedings of the VLDB 2001, 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]

Proceedings of the Algorithm Theory, 2000

1999

The b-chromatic Number of a Graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1996

Maximal Common Subsequences and Minimal Common Supersequences.

[BibT_eX]

[DOI]

Martin Middendorf

Inf. Comput., 1996

1995

Approximation Algorithms for the Shortest Common Supersequence.

[BibT_eX]

C. B. Fraser

Nord. J. Comput., 1995

1994

Three-Dimensional Statistical Data Security Problems.

[BibT_eX]

[DOI]

Mark Jerrum

SIAM J. Comput., 1994

An Upper Bound for the Solvability of a Random Stable Roommates Instance.

[BibT_eX]

[DOI]

Boris G. Pittel

Random Struct. Algorithms, 1994

Stable Marriage and Indifference.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Maximal Common Subsequences and Minimal Common Supersequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992

Two Algorithms for the Longest Common Subsequence of Three (or More) Strings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991

On Approximating the Minimum Independent Dominating Set.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1989

Parametric Stable Marriage and Minimum Cuts.

[BibT_eX]

[DOI]

Dan Gusfield

Inf. Process. Lett., 1989

The Stable marriage problem - structure and algorithms.

[BibT_eX]

Dan Gusfield

Foundations of computing series, MIT Press, ISBN: 978-0-262-07118-5, 1989

1987

Every finite distributive lattice is a set of stable matchings for a small stable marriage instance.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1987

An efficient algorithm for the "optimal" stable marriage.

[BibT_eX]

[DOI]

Paul Leather

Dan Gusfield

J. ACM, 1987

1986

The Complexity of Counting Stable Marriages.

[BibT_eX]

[DOI]

Paul Leather

SIAM J. Comput., 1986

1985

An Efficient Algorithm for the "Stable Roommates" Problem.

[BibT_eX]

[DOI]

J. Algorithms, 1985

1984

Permutation Backtracking in Lexicographic Order.

[BibT_eX]

[DOI]

Comput. J., 1984

1983

NP-completeness of a family of graph-colouring problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1983

1982

On Group Partitions Associated with Lower Bounds for Symmetric Ramsey Numbers.

[BibT_eX]

[DOI]

Raymond Hill

Eur. J. Comb., 1982

1974

Generalised Ramsey numbers for small graphs.

[BibT_eX]

[DOI]