#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1998

2018

- This year (7)
- Last 5 years (28)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

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

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

- David Manlove
- Series on Theoretical Computer Science
- 2013

When there are many people who don't need to expect something more than the benefits to take, we will suggest you to have willing to reach all benefits. Be sure and surely do to take this… (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)

- Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita
- ICALP
- 1999

The original stable marriage problem requires both man and woman to submit a complete and a strict order of his/her preference, i.e., a totally ordered list of, say, 100 people. This is obviously… (More)

- David J. Abraham, Péter Biró, David Manlove
- WAOA
- 2005

An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, i.e. admits the fewest… (More)

The Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a… (More)

- David J. Abraham, Robert W. Irving, David Manlove
- J. Discrete Algorithms
- 2007

We study the Student-Project Allocation problem (SPA), a generalisation of the classical Hospitals / Residents problem (HR). An instance of SPA involves a set of students, projects and lecturers.… (More)

- Péter Biró, Robert W. Irving, David Manlove
- CIAC
- 2010

Popular matchings have recently been a subject of study in the context of the so-called House Allocation Problem, where the objective is to match applicants to houses over which the applicants have… (More)

- Henning Fernau, David Manlove
- J. Discrete Algorithms
- 2006

We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generalise the notions of a vertex cover and an edge cover, respectively. A ttotal vertex (respectively… (More)