What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algorithm
- Time complexity
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.
His most cited work include:
- The Stable Marriage Problem: Structure and Algorithms (931 citations)
- An efficient algorithm for the “stable roommates” problem (279 citations)
- Hard variants of stable marriage (239 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (67.11%)
- Stable marriage problem (44.74%)
- Stable roommates problem (38.16%)
What were the highlights of his more recent work (between 2007-2019)?
- Matching (35.53%)
- Stable marriage problem (44.74%)
- Stable roommates problem (38.16%)
In recent papers he was focusing on the following fields of study:
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.
Between 2007 and 2019, his most popular works were:
- The College Admissions problem with lower and common quotas (119 citations)
- The stable marriage problem with master preference lists (57 citations)
- Stable marriage with ties and bounded length preference lists (54 citations)
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.
