2012 - Member of Academia Europaea
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.
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.
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.
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.
Hard variants of stable marriage
David F. Manlove;Robert W. Irving;Kazuo Iwama;Shuichi Miyazaki.
Theoretical Computer Science (2002)
Transformation rules for designing CNOT-based quantum circuits
Kazuo Iwama;Yahiko Kambayashi;Shigeru Yamashita.
design automation conference (2002)
Greedily Finding a Dense Subgraph
Yuichi Asahiro;Kazuo Iwama;Hisao Tamaki;Takeshi Tokuyama.
Journal of Algorithms (2000)
Stable Marriage with Incomplete Lists and Ties
Kazuo Iwama;Shuichi Miyazaki;David Manlove;Yasufumi Morita.
international colloquium on automata languages and programming (1999)
A Survey of the Stable Marriage Problem and Its Variants
K. Iwama;S. Miyazaki.
International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008) (2008)
Quantum network coding
Masahito Hayashi;Kazuo Iwama;Harumichi Nishimura;Rudy Raymond.
symposium on theoretical aspects of computer science (2007)
Improved upper bounds for 3-SAT
Kazuo Iwama;Suguru Tamaki.
symposium on discrete algorithms (2004)
Complexity of finding dense subgraphs
Yuichi Asahiro;Refael Hassin;Kazuo Iwama.
Discrete Applied Mathematics (2002)
CNF satisfiability test by counting and polynomial average time
SIAM Journal on Computing (1989)
Random generation of test instances with controlled attributes.
Yuichi Asahiro;Kazuo Iwama;Eiji Miyano.
Cliques, Coloring, and Satisfiability (1993)
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: