Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Manlove, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Socially stable matchings in the hospitals/residents problem
Georgios Askalidis
,
Nicole Immorlica
,
Augustine Kwanashie
,
David F. Manlove
,
Emmanouil Pountourakis
Lecture Notes in Computer Science
8037
, 2013, pp. 85-96
``Almost stable'' matchings in the Roommates problem with bounded preference lists
Péter Biró
,
David F. Manlove
,
Eric J. McDermid
Theoretical Computer Science
432
, 2012, pp. 10-20
An algorithm for a super-stable roommates problem
Tamás Fleiner
,
Robert W. Irving
,
David F. Manlove
Theoretical Computer Science
412
(50), 2011, pp. 7059-7065
The college admissions problem with lower and common quotas
Péter Biró
,
Tamás Fleiner
,
Robert W. Irving
,
David F. Manlove
Theoretical Computer Science
411
(34-36), 2010, pp. 3136-3153
Popular matchings in the Marriage and Roommates Problems
Péter Biró
,
Robert W. Irving
,
David F. Manlove
Lecture Notes in Computer Science
6078
, 2010, pp. 97-108
Size versus stability in the marriage problem
Péter Biró
,
David F. Manlove
,
Shubham Mittal
Theoretical Computer Science
411
(16-18), 2010, pp. 1828-1841
Efficient algorithms for generalized Stable Marriage and Roommates problems
Tamás Fleiner
,
Robert W. Irving
,
David F. Manlove
Theoretical Computer Science
381
(1-3), 2007, pp. 162-176
An
\frac{8}{5}
-approximation algorithm for a hard variant of stable marriage
Robert W. Irving
,
David F. Manlove
Lecture Notes in Computer Science
4598
, 2007, pp. 548-558
Popular matchings in the capacitated house allocation problem
David F. Manlove
,
Colin T.S. Sng
Lecture Notes in Computer Science
4168
, 2006, pp. 492-503
Pareto optimality in house allocation problems
David J. Abraham
,
Katarína Cechlárová
,
David F. Manlove
,
Kurt Mehlhorn
Lecture Notes in Computer Science
3827
, 2005, pp. 1163-1175
Pareto optimality in house allocation problems
David J. Abraham
,
Katarína Cechlárová
,
David F. Manlove
,
Kurt Mehlhorn
Lecture Notes in Computer Science
3341
, 2004, pp. 3-15
Combined super-/substring and super-/subsequence problems
Martin Middendorf
,
David F. Manlove
Theoretical Computer Science
320
(2-3), 2004, pp. 247-267
The student-project allocation problem
David J. Abraham
,
Robert W. Irving
,
David F. Manlove
Lecture Notes in Computer Science
2906
, 2003, pp. 474-484
Approximability results for stable marriage problems with ties
Magnús M. Halldórsson
,
Robert W. Irving
,
Kazuo Iwama
,
David F. Manlove
,
Shuichi Miyazaki
,
Yasufumi Morita
,
Sandy Scott
Theoretical Computer Science
306
(1-3), 2003, pp. 431-447
Strong stability in the hospitals/residents problem
Robert W. Irving
,
David F. Manlove
,
Sandy Scott
Lecture Notes in Computer Science
2607
, 2003, pp. 439-450
The stable roommates problem with ties
Robert W. Irving
,
David F. Manlove
Journal of Algorithms
43
(1), 2002, pp. 85-105
Hard variants of stable marriage
David F. Manlove
,
Robert W. Irving
,
Kazuo Iwama
Theoretical Computer Science
276
(1-2), 2002, pp. 261-279
The hospitals/residents problem with ties
Robert W. Irving
,
David Manlove
,
Sandy Scott
Lecture Notes in Computer Science
1851
, 2000, pp. 259-271
The
b
-chromatic number of a graph
Robert W. Irving
,
David F. Manlove
Discrete Applied Mathematics
91
(1-3), 1999, pp. 127-141
Stable marriage with incomplete lists and ties
Kazuo Iwama
,
David Manlove
,
Shuichi Miyazaki
,
Yasufumi Morita
Lecture Notes in Computer Science
1644
, 1999, pp. 443-452
On the algorithmic complexity of twelve covering and independence parameters of graphs
David F. Manlove
Discrete Applied Mathematics
91
(1-3), 1999, pp. 155-175