Kazuo Iwama
About
In The Last Decade
Kazuo Iwama
98 papers receiving 1.4k citations
Peers
Comparison fields: 5 of 84
- Computational Theory and Mathematics 748
- Artificial Intelligence 600
- Computer Networks and Communications 452
- Economics and Econometrics 331
- Management Science and Operations Research 317
Countries citing papers authored by Kazuo Iwama
This map shows the geographic impact of Kazuo Iwama's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kazuo Iwama with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kazuo Iwama more than expected).
Fields of papers citing papers by Kazuo Iwama
This network shows the impact of papers produced by Kazuo Iwama. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kazuo Iwama. The network helps show where Kazuo Iwama may publish in the future.
Co-authorship network of co-authors of Kazuo Iwama
This figure shows the co-authorship network connecting the top 25 collaborators of Kazuo Iwama. A scholar is included among the top collaborators of Kazuo Iwama based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kazuo Iwama. Kazuo Iwama is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 7 | |
| 2 | Automata, languages, and programming: 42nd International colloquium, ICALP 2015 Kyoto, Japan, july 6-10, 2015 proceedings, part I | 3 |
| 3 | 2 | |
| 4 | A -Approximation Algorithm for the Stable Marriage Problem | 3 |
| 5 | 8 | |
| 6 | 10 | |
| 7 | Worst-Case Upper Bounds for kSAT (Column: Algorithmics). | 19 |
| 8 | 25 | |
| 9 | 4 | |
| 10 | Polynomial-Time Computable Backup Tables for Shortest-Path Routing. | 8 |
| 11 | 44 | |
| 12 | Exploiting Partial Knowledge of Satisfying Assignments | 1 |
| 13 | An O(N) oblivious routing algorithm for 2-D meshes of constant queue-size | 4 |
| 14 | 0 | |
| 15 | Local search algorithms for partial MAXSAT | 34 |
| 16 | Database Queries as Combinatorial Optimization Problems. | 14 |
| 17 | Performance test of local search algorithms using new types of random CNF formulas | 29 |
| 18 | SAT-Varible Complexity of Hard Combinatorial Problems. | 23 |
| 19 | Random Generation of Satisfiable and Unsatisfiable CNF Predicates | 7 |
| 20 | An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses. | 5 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.