Kiyoshi Ando
Impact in
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 40
- Graph Labeling and Dimension Problems 12
- Complexity and Algorithms in Graphs 7
-
- Interconnection Networks and Systems 25
- Co-authors
- Akira Saito (2 shared papers)Hikoe Enomoto (1 shared paper)Ken‐ichi Kawarabayashi (11 shared papers)Yoshimi Egawa (11 shared papers)Atsushi Kaneko (8 shared papers)Kazumi Yamaguchi (1 shared paper)Jin Akiyama (2 shared papers)Kunihiro Iida (1 shared paper)
- Journals
- Discrete Mathematics (26 papers)Graphs and Combinatorics (6 papers)Journal of Graph Theory (4 papers)Journal of Combinatorial Theory Series B (2 papers)Annals of Combinatorics (1 paper)
- Partner nations
- JapanGermanyPhilippines
In The Last Decade
Kiyoshi Ando
57 papers receiving 371 citations
Peers
Comparison fields: 5 of 103
- Computational Theory and Mathematics 193
- Discrete Mathematics and Combinatorics 34
- Geometry and Topology 59
- Computer Graphics and Computer-Aided Design 20
- Computer Networks and Communications 111
Countries citing papers authored by Kiyoshi Ando
This map shows the geographic impact of Kiyoshi Ando'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 Kiyoshi Ando with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kiyoshi Ando more than expected).
Fields of papers citing papers by Kiyoshi Ando
This network shows the impact of papers produced by Kiyoshi Ando. 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 Kiyoshi Ando. The network helps show where Kiyoshi Ando may publish in the future.
Co-authors
The 25 scholars most cited alongside Kiyoshi Ando, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 70 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1987 | 64 | |
| 2 | 1987 | 27 | |
| 3 | 2010 | 25 | |
| 4 | 2007 | 25 | |
| 5 | 2002 | 23 | |
| 6 | 1999 | 21 | |
| 7 | 2004 | 17 | |
| 8 | 1980 | 15 | |
| 9 | 2005 | 13 | |
| 10 | 1985 | 13 | |
| 11 | 2000 | 11 | |
| 12 | 1990 | 10 | |
| 13 | 1985 | 8 | |
| 14 | 1999 | 7 | |
| 15 | 2005 | 6 | |
| 16 | 2007 | 5 | |
| 17 | 2003 | 5 | |
| 18 | 2011 | 5 | |
| 19 | 1996 | 5 | |
| 20 | 1995 | 5 |
About Kiyoshi Ando
Kiyoshi Ando is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Geometry and Topology, Electrical and Electronic Engineering and Materials Chemistry, having authored 70 papers that have together received 388 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (40 papers), Interconnection Networks and Systems (25 papers), Graph theory and applications (15 papers), Graph Labeling and Dimension Problems (12 papers), Complexity and Algorithms in Graphs (7 papers), graph theory and CDMA systems (6 papers), Graphene research and applications (6 papers) and Limits and Structures in Graph Theory (5 papers). The work is most often cited by research in Computational Theory and Mathematics (193 citations), Discrete Mathematics and Combinatorics (34 citations), Geometry and Topology (59 citations), Computer Graphics and Computer-Aided Design (20 citations) and Computer Networks and Communications (111 citations). Kiyoshi Ando has collaborated with scholars based in Japan, Germany and Philippines. Frequent co-authors include Akira Saito, Hikoe Enomoto, Ken‐ichi Kawarabayashi, Yoshimi Egawa, Atsushi Kaneko, Kazumi Yamaguchi, Jin Akiyama, Kunihiro Iida, Miho Hatanaka and K Matsuyama. Their work appears in journals such as Discrete Mathematics, Graphs and Combinatorics, Journal of Graph Theory, Journal of Combinatorial Theory Series B and Annals of Combinatorics.
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.