Robert W. Irving focuses on Combinatorics, Stable roommates problem, Stable marriage problem, Time complexity and Stability. His Combinatorics course of study focuses on Discrete mathematics and Partition. Many of his studies on Stable roommates problem apply to Mathematical economics as well.
His Mathematical economics study combines topics in areas such as Context, Analysis of algorithms and Artificial intelligence. His Stable marriage problem research is included under the broader classification of Matching. His Matching research incorporates elements of Computational complexity theory, P-complete and Partially ordered set, Antichain.
Robert W. Irving spends much of his time researching Combinatorics, Stable marriage problem, Stable roommates problem, Matching and Time complexity. As a part of the same scientific study, Robert W. Irving usually deals with the Combinatorics, concentrating on Discrete mathematics and frequently concerns with Partition. The various areas that he examines in his Stable marriage problem study include Efficient algorithm, Context and Mathematical economics.
He combines topics linked to Mathematical optimization with his work on Stable roommates problem. His Matching research is within the category of Algorithm. His Time complexity research is multidisciplinary, incorporating elements of Partially ordered set, Dynamic programming and Longest common subsequence problem.
Robert W. Irving mainly focuses on Matching, Stable marriage problem, Stable roommates problem, Combinatorics and Time complexity. The Matching study combines topics in areas such as Efficient algorithm and Preference list. His work carried out in the field of Stable marriage problem brings together such families of science as Context, Mathematical economics and Mathematical optimization, Combinatorial optimization.
His Mathematical economics research includes elements of Theory of computation and Bipartite graph. Robert W. Irving conducts interdisciplinary study in the fields of Stable roommates problem and Stability through his works. In his study, which falls under the umbrella issue of Combinatorics, Optimal matching is strongly linked to Discrete mathematics.
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.
The Stable Marriage Problem: Structure and Algorithms
Dan Gusfield;Robert W. Irving.
An efficient algorithm for the “stable roommates” problem
Robert W Irving.
Journal of Algorithms (1985)
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)
An efficient algorithm for the “optimal” stable marriage
Robert W. Irving;Paul Leather;Dan Gusfield.
Journal of the ACM (1987)
Stable marriage and indifference
Robert W. Irving.
Discrete Applied Mathematics (1994)
David J. Abraham;Robert W. Irving;Telikepalli Kavitha;Kurt Mehlhorn.
symposium on discrete algorithms (2005)
The complexity of counting stable marriages
Robert W Irving;Paul Leather.
SIAM Journal on Computing (1986)
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)
A Database Index to Large Biological Sequences
Ela Hunt;Malcolm P. Atkinson;Robert W. Irving.
very large data bases (2001)
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: