#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1964

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dan Gusfield, Robert W. Irving
- Foundations of computing series
- 1989

Where you can find the the stable marriage problem structure and algorithms easily? Is it in the book store? On-line book store? are you sure? Keep in mind that you will find the book in this site.â€¦ (More)

- Robert W. Irving
- J. Algorithms
- 1985

The stable marriage problem is that of matching n men and n women, each of whom has ranked the members of the opposite sex in order of preference, so that no unmatched couple both prefer each otherâ€¦ (More)

- Robert W. Irving, David Manlove
- Discrete Applied Mathematics
- 1999

The achromatic number Ïˆ(G) of a graph G = (V,E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent. Here we show thatâ€¦ (More)

- Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
- VLDB
- 2001

We present an approach to searching genetic DNA sequences using an adaptation of the sufx tree data structure deployed on the general purpose persistent Java platform, PJama. Our implementationâ€¦ (More)

- David Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
- Theor. Comput. Sci.
- 2002

The Stable Marriage Problem and its many variants have been widely studied in the literature (Gus6eld and Irving, The Stable Marriage Problem: Structure and Algorithms, MIT Press, Cambridge, MA,â€¦ (More)

We consider the problem of matching a set of <i>applicants</i> to a set of <i>posts</i>, where each applicant has a <i>preference list</i>, ranking a non-empty subset of posts in order of preference,â€¦ (More)

- Robert W. Irving, Paul Leather, Dan Gusfield
- J. ACM
- 1987

In an instance of size n of the stable marriage problem, each of n men and n women ranks the members of the opposite sex in order of preference. A stable matching is a complete matching of men andâ€¦ (More)

- Robert W. Irving
- Discrete Applied Mathematics
- 1994

It is well known that every instance of the classical stable marriage problem admits at least one stable matching, and that such a matching can be found in O(nâ€™) time by application of theâ€¦ (More)

- Robert W. Irving, David Manlove
- J. Algorithms
- 2002

We study the variant of the well-known Stable Roommates problem in which participants are permitted to express ties in their preference lists. In this setting, more than one definition of stabilityâ€¦ (More)

- Robert W. Irving, Paul Leather
- SIAM J. Comput.
- 1986