Robert W. Irving

According to our database1, Robert W. Irving authored at least 60 papers between 1974 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2016
Stable Marriage.
Encyclopedia of Algorithms, 2016

Optimal Stable Marriage.
Encyclopedia of Algorithms, 2016

Matching couples with Scarf's algorithm.
Ann. Math. Artif. Intell., 2016

2014
Sex-Equal Stable Matchings: Complexity and Exact Algorithms.
Algorithmica, 2014

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

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

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

Stable matching with couples: An empirical study.
ACM Journal of Experimental Algorithmics, 2011

Popular matchings: structure and algorithms.
J. Comb. Optim., 2011

2010
The College Admissions problem with lower and common quotas.
Theor. Comput. Sci., 2010

Mapping Affymetrix Microarray Probes to the Rat Genome via a Persistent Index.
IJKDB, 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

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

2008
Stable Marriage.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Optimal Stable Marriage.
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

Stable matching problems with exchange restrictions.
J. Comb. Optim., 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

Popular Matchings.
SIAM J. Comput., 2007

Two algorithms for the Student-Project Allocation problem.
J. Discrete Algorithms, 2007

The cycle roommates problem: a hard case of kidney exchange.
Inf. Process. Lett., 2007

The stable fixtures problem - A many-to-many extension of stable roommates.
Discret. Appl. Math., 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
Rank-maximal matchings.
ACM Trans. Algorithms, 2006

2003
Approximability results for stable marriage problems with ties.
Theor. Comput. Sci., 2003

The suffix binary search tree and suffix AVL tree.
J. Discrete Algorithms, 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
Database indexing for large DNA and protein sequence collections.
VLDB J., 2002

Hard variants of stable marriage.
Theor. Comput. Sci., 2002

The Stable Roommates Problem with Ties.
J. Algorithms, 2002

2001
Sorting Strings by Reversals and by Transpositions.
SIAM J. Discrete Math., 2001

A Database Index to Large Biological Sequences.
Proceedings of the VLDB 2001, 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
The b-chromatic Number of a Graph.
Discret. Appl. Math., 1999

1998
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme.
Proceedings of the Algorithms, 1998

1996
Maximal Common Subsequences and Minimal Common Supersequences.
Inf. Comput., 1996

1995
Approximation Algorithms for the Shortest Common Supersequence.
Nord. J. Comput., 1995

1994
Three-Dimensional Statistical Data Security Problems.
SIAM J. Comput., 1994

An Upper Bound for the Solvability of a Random Stable Roommates Instance.
Random Struct. Algorithms, 1994

Stable Marriage and Indifference.
Discret. Appl. Math., 1994

Maximal Common Subsequences and Minimal Common Supersequences.
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.
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings.
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991
On Approximating the Minimum Independent Dominating Set.
Inf. Process. Lett., 1991

1989
Parametric Stable Marriage and Minimum Cuts.
Inf. Process. Lett., 1989

The Stable marriage problem - structure and algorithms.
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.
J. Comb. Theory, Ser. A, 1987

An efficient algorithm for the "optimal" stable marriage.
J. ACM, 1987

1986
The Complexity of Counting Stable Marriages.
SIAM J. Comput., 1986

1985
An Efficient Algorithm for the "Stable Roommates" Problem.
J. Algorithms, 1985

1984
Permutation Backtracking in Lexicographic Order.
Comput. J., 1984

1983
NP-completeness of a family of graph-colouring problems.
Discret. Appl. Math., 1983

1982
On Group Partitions Associated with Lower Bounds for Symmetric Ramsey Numbers.
Eur. J. Comb., 1982

1974
Generalised Ramsey numbers for small graphs.
Discrete Mathematics, 1974


  Loading...