What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Programming language
Kazuo Iwama mainly investigates Combinatorics, Discrete mathematics, Stable marriage problem, Approximation algorithm and Algorithm.
His Combinatorics research incorporates themes from Current, Bottleneck traveling salesman problem and Constant.
He combines subjects such as Nondeterministic finite automaton, Quantum finite automata, Automata theory and Deterministic finite automaton with his study of Discrete mathematics.
His Stable marriage problem research incorporates elements of Time complexity and Graph theory.
The Approximation algorithm study combines topics in areas such as Matching, Preference, Regret and Stability.
His Algorithm research is multidisciplinary, incorporating perspectives in Class and Competitive analysis.
His most cited work include:
- Hard variants of stable marriage (239 citations)
- Greedily Finding a Dense Subgraph (165 citations)
- Transformation rules for designing CNOT-based quantum circuits (160 citations)
What are the main themes of his work throughout his whole career to date?
Kazuo Iwama spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Algorithm and Approximation algorithm.
Kazuo Iwama has researched Combinatorics in several fields, including Matching, Stable marriage problem, Competitive analysis and Constant.
His Stable marriage problem research is multidisciplinary, incorporating perspectives in Cardinality and Preference.
Many of his research projects under Discrete mathematics are closely connected to Qubit with Qubit, tying the diverse disciplines of science together.
His Upper and lower bounds research integrates issues from Binary logarithm, Online algorithm and Oracle.
His work in the fields of Algorithm, such as Local search, Randomized algorithm and Computation, intersects with other areas such as Polygon mesh.
He most often published in these fields:
- Combinatorics (46.74%)
- Discrete mathematics (35.74%)
- Upper and lower bounds (24.40%)
What were the highlights of his more recent work (between 2009-2021)?
- Combinatorics (46.74%)
- Discrete mathematics (35.74%)
- Upper and lower bounds (24.40%)
In recent papers he was focusing on the following fields of study:
Kazuo Iwama mostly deals with Combinatorics, Discrete mathematics, Upper and lower bounds, Stable marriage problem and Time complexity.
Particularly relevant to Approximation algorithm is his body of work in Combinatorics.
His study in Discrete mathematics is interdisciplinary in nature, drawing from both Function, Measure and Parameterized complexity.
His biological study spans a wide range of topics, including Sequence, String, Substring and Constant.
The concepts of his Stable marriage problem study are interwoven with issues in Preference and Theory of computation.
The various areas that Kazuo Iwama examines in his Time complexity study include Blocking and Nash equilibrium.
Between 2009 and 2021, his most popular works were:
- The Hospitals/Residents Problem with Lower Quotas (33 citations)
- The hospitals/residents problem with quota lower bounds (29 citations)
- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties (27 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Programming language
His scientific interests lie mostly in Combinatorics, Upper and lower bounds, Discrete mathematics, Approximation algorithm and Matching.
His Combinatorics research includes themes of Stable marriage problem and Bin packing problem.
Kazuo Iwama usually deals with Stable marriage problem and limits it to topics linked to Time complexity and Exact algorithm.
His Upper and lower bounds research is multidisciplinary, relying on both Binary logarithm, Constant, Sequence and String, Substring.
His research is interdisciplinary, bridging the disciplines of Measure and Discrete mathematics.
His work carried out in the field of Approximation algorithm brings together such families of science as Current, Stable roommates problem and Preference.
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.
