His main research concerns Stable marriage problem, Combinatorics, Time complexity, Stability and Approximation algorithm. David F. Manlove works in the field of Stable marriage problem, focusing on Stable roommates problem in particular. As a part of the same scientific study, David F. Manlove usually deals with the Combinatorics, concentrating on Matching and frequently concerns with Simple.
Within one scientific family, David F. Manlove focuses on topics pertaining to Mathematical economics under Time complexity, and may sometimes address concerns connected to Matroid, Extension, Ranking and Decision problem. The concepts of his Stability study are interwoven with issues in Cardinality, Graph theory and Regret. As part of one scientific family, David F. Manlove deals mainly with the area of Approximation algorithm, narrowing it down to issues related to the Discrete mathematics, and often Combinatorial optimization and Calculus.
David F. Manlove focuses on Matching, Combinatorics, Stable marriage problem, Time complexity and Stable roommates problem. His Matching research includes themes of Degree, Cardinality, Approximation algorithm and Bipartite graph. His work focuses on many connections between Cardinality and other disciplines, such as Mathematical optimization, that overlap with his field of interest in Pareto optimal.
His Combinatorics study incorporates themes from Discrete mathematics and Preference list. His Stable marriage problem study also includes fields such as
His scientific interests lie mostly in Stable marriage problem, Matching, Stability, Context and Algorithm. His primary area of study in Stable marriage problem is in the field of Stable roommates problem. His Matching study integrates concerns from other disciplines, such as Degree and Combinatorics.
His study looks at the relationship between Stability and fields such as Dummy variable, as well as how they intersect with chemical problems. His work carried out in the field of Algorithm brings together such families of science as Graph, Preprocessor and Absolute difference. His studies in Approximation algorithm integrate themes in fields like Discrete mathematics and Time complexity.
Stable marriage problem, Stable roommates problem, Context, Stability and Theoretical computer science are his primary areas of study. His studies deal with areas such as Range and Mathematical optimization as well as Stable marriage problem. His Stable roommates problem study introduces a deeper knowledge of Matching.
His Context research includes a combination of various areas of study, such as Algorithm, Theory of computation, Image and Window. His Theoretical computer science study frequently links to related topics such as Partition.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Algorithmics of Matching Under Preferences
David F Manlove.
(2013)
Algorithmics of Matching Under Preferences
David F Manlove.
(2013)
Hard variants of stable marriage
David F. Manlove;Robert W. Irving;Kazuo Iwama;Shuichi Miyazaki.
Theoretical Computer Science (2002)
Hard variants of stable marriage
David F. Manlove;Robert W. Irving;Kazuo Iwama;Shuichi Miyazaki.
Theoretical Computer Science (2002)
The b-chromatic number of a graph
Robert W. Irving;David F. Manlove.
Discrete Applied Mathematics (1999)
The b-chromatic number of a graph
Robert W. Irving;David F. Manlove.
Discrete Applied Mathematics (1999)
Stable Marriage with Incomplete Lists and Ties
Kazuo Iwama;Shuichi Miyazaki;David Manlove;Yasufumi Morita.
international colloquium on automata languages and programming (1999)
Stable Marriage with Incomplete Lists and Ties
Kazuo Iwama;Shuichi Miyazaki;David Manlove;Yasufumi Morita.
international colloquium on automata languages and programming (1999)
The College Admissions problem with lower and common quotas
Péter Biró;Tamás Fleiner;Robert W. Irving;David F. Manlove.
Theoretical Computer Science (2010)
The College Admissions problem with lower and common quotas
Péter Biró;Tamás Fleiner;Robert W. Irving;David F. Manlove.
Theoretical Computer Science (2010)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Glasgow
Kyoto University
University of Edinburgh
Kyoto University
Microsoft (United States)
Carnegie Mellon University
Reykjavík University
University of St Andrews
Leipzig University
Freie Universität Berlin
Peking University
Institut Català d'Investigació Química
University of Maryland, College Park
Victor Chang Cardiac Research Institute
Stanford University
University of Edinburgh
Czech University of Life Sciences Prague
Seoul National University
Southern Cross University
Alfred Wegener Institute for Polar and Marine Research
Heidelberg University
Bangor University
University of Western Ontario
Rockefeller University
University of Colorado Boulder
University of California, Berkeley