Kiyoshi Ando

588 total citations
70 papers, 390 citations indexed

About

Kiyoshi Ando is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology. According to data from OpenAlex, Kiyoshi Ando has authored 70 papers receiving a total of 390 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 25 papers in Computer Networks and Communications and 17 papers in Geometry and Topology. Recurrent topics in Kiyoshi Ando's work include Advanced Graph Theory Research (40 papers), Interconnection Networks and Systems (25 papers) and Graph theory and applications (15 papers). Kiyoshi Ando is often cited by papers focused on Advanced Graph Theory Research (40 papers), Interconnection Networks and Systems (25 papers) and Graph theory and applications (15 papers). Kiyoshi Ando collaborates with scholars based in Japan, Germany and Philippines. Kiyoshi Ando's co-authors include Akira Saito, Hikoe Enomoto, Ken‐ichi Kawarabayashi, Yoshimi Egawa, Atsushi Kaneko, Kazumi Yamaguchi, Kunihiro Iida, Jin Akiyama, K Matsuyama and Miho Hatanaka and has published in prestigious journals such as Diabetes, Biochemical Journal and International Journal of Hospitality Management.

In The Last Decade

Kiyoshi Ando

57 papers receiving 372 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Kiyoshi Ando Japan	11	194	111	59	57	49	70	390
Yaojun Chen China	12	331 1.7×	89 0.8×	224 3.8×	135 2.4×	4 0.1×	104	536
Ronald D. Baker United States	10	57 0.3×	18 0.2×	26 0.4×	149 2.6×	20 0.4×	18	363
Wenlong Su China	9	40 0.2×	4 0.0×	24 0.4×	31 0.5×	61 1.2×	36	252
William H. Gates United States	4	55 0.3×	84 0.8×	3 0.1×	24 0.4×	62 1.3×	9	233
Keijo Ruohonen Finland	10	112 0.6×	11 0.1×	4 0.1×	14 0.2×	86 1.8×	48	331
Michal Růžička Czechia	12	58 0.3×	22 0.2×		18 0.3×	135 2.8×	44	362
Jae-Won Kim South Korea	8	15 0.1×	55 0.5×	2 0.0×	38 0.7×	91 1.9×	40	239
Shujun Jiang China	9	20 0.1×	6 0.1×	67 1.1×	32 0.6×	17 0.3×	28	217

Countries citing papers authored by Kiyoshi Ando

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Kiyoshi Ando

This figure shows the co-authorship network connecting the top 25 collaborators of Kiyoshi Ando. A scholar is included among the top collaborators of Kiyoshi Ando 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 Kiyoshi Ando. Kiyoshi Ando is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ando, Kiyoshi & Yoshimi Egawa. (2023). Properly 3-contractible edges in a minimally 3-connected graph. Discrete Mathematics. 346(5). 113321–113321. 1 indexed citations

Ando, Kiyoshi, Shinya Fujita, & Ken‐ichi Kawarabayashi. (2011). Minimally contraction-critically 6-connected graphs. Discrete Mathematics. 312(3). 671–679.

Ando, Kiyoshi & Takashi Iwase. (2011). The number of vertices of degree 5 in a contraction-critically 5-connected graph. Discrete Mathematics. 311(17). 1925–1939. 5 indexed citations

Hatanaka, Miho, et al.. (2010). Traumatic stress in Japanese broadcast journalists. Journal of Traumatic Stress. 23(1). 173–177. 25 indexed citations

Ando, Kiyoshi & Yoshimi Egawa. (2008). Edges not contained in triangles and the number of contractible edges in a 4-connected graph. Discrete Mathematics. 308(23). 5463–5472. 2 indexed citations

Ando, Kiyoshi, Yoshimi Egawa, Ken‐ichi Kawarabayashi, & Matthias Kriesell. (2008). On the number of 4-contractible edges in 4-connected graphs. Journal of Combinatorial Theory Series B. 99(1). 97–109. 1 indexed citations

Ando, Kiyoshi, Atsushi Kaneko, & Ken‐ichi Kawarabayashi. (2007). Contractible edges in minimally k-connected graphs. Discrete Mathematics. 308(4). 597–602. 2 indexed citations

Ando, Kiyoshi, et al.. (2003). Cycles having the same modularity and removable edges in 2-connected graphs. Discrete Mathematics. 265(1-3). 23–30.

Ando, Kiyoshi & Ken‐ichi Kawarabayashi. (2003). Some forbidden subgraph conditions for a graph to have a k-contractible edge. Discrete Mathematics. 267(1-3). 3–11. 5 indexed citations

10.

Ando, Kiyoshi & Atsuhiro Nakamoto. (2002). On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3. Ars Combinatoria. 62. 121–127.

11.

Ando, Kiyoshi, et al.. (2002). Contractible Edges and Bowties in a k-Connected Graph.. Ars Combinatoria. 64. 239. 2 indexed citations

12.

Ando, Kiyoshi, et al.. (2002). Path factors in claw-free graphs. Discrete Mathematics. 243(1-3). 195–200. 25 indexed citations

13.

Ando, Kiyoshi, et al.. (2002). Bandwidth of the cartesian product of two connected graphs. Discrete Mathematics. 252(1-3). 227–235. 4 indexed citations

14.

Ando, Kiyoshi, et al.. (2001). Diagonal flips of pseudo triangulations on the sphere.. Ars Combinatoria. 59. 2 indexed citations

15.

Ando, Kiyoshi, et al.. (2001). Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.. Ars Combinatoria. 58. 2 indexed citations

16.

Ando, Kiyoshi, Atsushi Kaneko, & Tsuyoshi Nishimura. (1999). A degree condition for the existence of 1-factors in graphs or their complements. Discrete Mathematics. 203(1-3). 1–8. 3 indexed citations

17.

Ando, Kiyoshi & Yoshimi Egawa. (1997). The minimum number of edges in a vertex diameter-2-critical graph. Discrete Mathematics. 167-168. 35–63. 2 indexed citations

18.

Ando, Kiyoshi, et al.. (1996). A remark on the connectivity of the complement of a 3-connected graph. Discrete Mathematics. 151(1-3). 39–47. 1 indexed citations

19.

Ando, Kiyoshi. (1994). An upper bound for orders of certain (k, k))-connected graphs. Discrete Mathematics. 135(1-3). 371–375.

20.

Ando, Kiyoshi. (1970). MULTIDIMENSIONAL ANALYSIS OF THE PREFERENCE STRUCTURE FOR MUSIC PERFORMANCES. The Japanese journal of psychology. 40(6). 330–336. 1 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Yaojun Chen Breakdown of academic impact, for papers by Ronald D. Baker Breakdown of academic impact, for papers by Wenlong Su Breakdown of academic impact, for papers by William H. Gates Breakdown of academic impact, for papers by Keijo Ruohonen Breakdown of academic impact, for papers by Michal Růžička Breakdown of academic impact, for papers by Jae-Won Kim Breakdown of academic impact, for papers by Shujun Jiang