2026 Kazuo Iwama: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	36	11277	10956	169	161	253	5406

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

11277

10956

169

161

253

5406

Research.com Recognitions

2012 - Member of Academia Europaea

Overview

Kazuo Iwama is affiliated with Kyoto University in Japan and has contributed to various fields primarily within computer science and engineering. Their research encompasses topics related to optimization, transportation innovations, and game theory, among others.

The main fields of study for Iwama include:

Computer Science
Engineering

More specifically, their work involves subfields such as:

Computer Networks and Communications
Automotive Engineering
Computational Theory and Mathematics
Economics and Econometrics
Industrial and Manufacturing Engineering

The core research topics addressed in Iwama's publications cover:

Optimization and Search Problems
Transportation and Mobility Innovations
Game Theory and Voting Systems
Smart Parking Systems Research
Advanced Bandit Algorithms Research
Blockchain Technology Applications and Security
Sharing Economy and Platforms

Recent publications from Kazuo Iwama include:

"Bounded Hanoi," 2022, published in American Mathematical Monthly
"Marriage and Roommate," 2023, published in arXiv (Cornell University)

Frequent co-authors collaborating with Iwama are:

Ya-Chun Liang
Chung-Shou Liao
Kuan-Yun Lai
Ho-Lin Chen
Mike Paterson

Publications have appeared in a range of venues, including:

arXiv (Cornell University)
Theoretical Computer Science
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
American Mathematical Monthly
International Journal of Foundations of Computer Science

Kazuo Iwama has been recognized as a Member of Academia Europaea since 2012, reflecting an established role in the academic community.

Best Publications

Hard variants of stable marriage

David F. Manlove;Robert W. Irving;Kazuo Iwama;Shuichi Miyazaki

402
Citations
Greedily Finding a Dense Subgraph

Yuichi Asahiro;Kazuo Iwama;Hisao Tamaki;Takeshi Tokuyama

337
Citations
Transformation rules for designing CNOT-based quantum circuits

Kazuo Iwama;Yahiko Kambayashi;Shigeru Yamashita

251
Citations
Stable Marriage with Incomplete Lists and Ties

Kazuo Iwama;Shuichi Miyazaki;David Manlove;Yasufumi Morita

244
Citations
A Survey of the Stable Marriage Problem and Its Variants

K. Iwama;S. Miyazaki

219
Citations
Quantum network coding

Masahito Hayashi;Kazuo Iwama;Harumichi Nishimura;Rudy Raymond

180
Citations
Complexity of finding dense subgraphs

Yuichi Asahiro;Refael Hassin;Kazuo Iwama

171
Citations
Improved upper bounds for 3-SAT

Kazuo Iwama;Suguru Tamaki

170
Citations
CNF satisfiability test by counting and polynomial average time

Kazuo Iwama

152
Citations
Random generation of test instances with controlled attributes.

Yuichi Asahiro;Kazuo Iwama;Eiji Miyano

110
Citations
Editor's Foreword

Unknown

107
Citations
Removable Online Knapsack Problems

Kazuo Iwama;Shiro Taketomi

106
Citations
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits

Kazuo Iwama;Hiroki Morizumi

102
Citations
Local search algorithms for partial MAXSAT

Byungki Cha;Kazuo Iwama;Yahiko Kambayashi;Shuichi Miyazaki

100
Citations
Approximability results for stable marriage problems with ties

Magnús M. Halldórsson;Robert W. Irving;Kazuo Iwama;David F. Manlove

96
Citations
Adding new clauses for faster local search

Byungki Cha;Kazuo Iwama

90
Citations
An improved exact algorithm for cubic graph TSP

Kazuo Iwama;Takuya Nakashima

83
Citations
Performance test of local search algorithms using new types of random CNF formulas

Byungki Cha;Kazuo Iwama

79
Citations
Tight bounds on the number of states of DFAs that are equivalent to n -state NFAs

Kazuo Iwama;Yahiko Kambayashi;Kazuya Takaki

78
Citations
Intractability of read-once resolution

K. Iwama;E. Miyano

78
Citations
Average-Case Competitive Analyses for Ski-Rental Problems

Hiroshi Fujiwara;Kazuo Iwama

77
Citations
SAT-Varible Complexity of Hard Combinatorial Problems.

Kazuo Iwama;Shuichi Miyazaki

68
Citations

Frequent Co-Authors

Shuichi Miyazaki University of Tsukuba

Magnús M. Halldórsson Reykjavík University

Andris Ambainis University of Latvia

David F. Manlove University of Glasgow

Masahito Hayashi Chinese University of Hong Kong, Shenzhen

Richard Cleve University of Waterloo

David Avis McGill University

Robert W. Irving University of Glasgow

Mike Paterson University of Warwick

Takao Nishizeki Tohoku University

External Links

Personal website of Kazuo Iwama

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees related to Computer Science opens up a range of career opportunities in technical fields. Many students compare the mechanical engineering cost of education to ensure they find a program that fits their budget, while still meeting industry standards.

An online bachelor's degree in physics is another popular choice for those interested in understanding complex systems and problem solving. This degree can be a pathway to careers in research, education, or technology.

With the tech industry's rapid growth, data-driven roles are in demand. Selecting an affordable data science degree can lead to high-paying jobs in analytics, finance, and artificial intelligence.

For those targeting careers in design and electronics, researching electrical engineering degree online admissions can connect you to flexible, accredited programs that suit varied career goals.