Mikio Kanō

1.9k total citations
105 papers, 986 citations indexed

About

Mikio Kanō is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Mikio Kanō has authored 105 papers receiving a total of 986 indexed citations (citations by other indexed papers that have themselves been cited), including 81 papers in Computational Theory and Mathematics, 38 papers in Electrical and Electronic Engineering and 35 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Mikio Kanō's work include Advanced Graph Theory Research (75 papers), graph theory and CDMA systems (37 papers) and Graph Labeling and Dimension Problems (35 papers). Mikio Kanō is often cited by papers focused on Advanced Graph Theory Research (75 papers), graph theory and CDMA systems (37 papers) and Graph Labeling and Dimension Problems (35 papers). Mikio Kanō collaborates with scholars based in Japan, China and United States. Mikio Kanō's co-authors include Jin Akiyama, Xueliang Li, Akira Saito, Gyula Y. Katona, Atsushi Kaneko, Yuting Cui, Zoltán Király, Yoshimi Egawa, Norihide Tokushige and Kazuhiro Suzuki and has published in prestigious journals such as SHILAP Revista de lepidopterología, Annals of the New York Academy of Sciences and Lecture notes in mathematics.

In The Last Decade

Mikio Kanō

94 papers receiving 932 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Mikio Kanō Japan	17	800	322	301	271	167	105	986
Ervin Győri Hungary	17	665 0.8×	646 2.0×	390 1.3×	176 0.6×	101 0.6×	94	896
Bjarne Toft Denmark	12	610 0.8×	319 1.0×	129 0.4×	187 0.7×	76 0.5×	33	762
Uri N. Peled United States	14	423 0.5×	130 0.4×	177 0.6×	110 0.4×	32 0.2×	47	707
Pinar Heggernes Norway	16	790 1.0×	122 0.4×	100 0.3×	96 0.4×	22 0.1×	90	940
Tommy R. Jensen Germany	7	481 0.6×	223 0.7×	71 0.2×	148 0.5×	89 0.5×	20	627
Zs. Tuza Hungary	19	868 1.1×	575 1.8×	264 0.9×	169 0.6×	35 0.2×	65	1.1k
Vadim Lozin United Kingdom	23	1.4k 1.7×	526 1.6×	259 0.9×	165 0.6×	41 0.2×	121	1.5k
Carlos Seara Spain	13	670 0.8×	48 0.1×	193 0.6×	181 0.7×	193 1.2×	63	904
Patrice Ossona de Mendez France	16	721 0.9×	403 1.3×	223 0.7×	55 0.2×	141 0.8×	68	874
R. Halin Germany	16	785 1.0×	269 0.8×	383 1.3×	111 0.4×	68 0.4×	48	925

Countries citing papers authored by Mikio Kanō

Since Specialization

Citations

This map shows the geographic impact of Mikio Kanō'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 Mikio Kanō with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mikio Kanō more than expected).

Fields of papers citing papers by Mikio Kanō

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mikio Kanō. 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 Mikio Kanō. The network helps show where Mikio Kanō may publish in the future.

Co-authorship network of co-authors of Mikio Kanō

This figure shows the co-authorship network connecting the top 25 collaborators of Mikio Kanō. A scholar is included among the top collaborators of Mikio Kanō 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 Mikio Kanō. Mikio Kanō 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

Kanō, Mikio, David Orden, Javier Tejel, et al.. (2021). Rainbow polygons for colored point sets in the plane. Zaguan (University of Zaragoza Repository). 1 indexed citations

Katona, Gyula Y., et al.. (2019). Decomposition of a graph into two disjoint odd subgraphs. Repository of the Academy's Library (Library of the Hungarian Academy of Sciences). 5 indexed citations

Ábrego, Bernardo M., Silvia Fernández‐Merchant, Mikio Kanō, et al.. (2019). K1,3-covering red and blue points in the plane. SHILAP Revista de lepidopterología. 2 indexed citations

Lu, Hongliang, Mikio Kanō, & Qinglin Yu. (2019). Characterizations of graphs G having all [1,k]-factors in kG. Discrete Mathematics. 342(12). 111580–111580. 1 indexed citations

Kanō, Mikio & Zheng Yan. (2014). Spanning trees whose stems have at most k leaves.. Ars Combinatoria. 117. 417–424. 3 indexed citations

Bereg, Sergey, Ferrán Hurtado, Mikio Kanō, et al.. (2014). Balanced partitions of 3-colored geometric sets in the plane. Discrete Applied Mathematics. 181. 21–32. 3 indexed citations

Kanō, Mikio, et al.. (2013). Spanningk-ended trees of bipartite graphs. Discrete Mathematics. 313(24). 2903–2907. 1 indexed citations

Kanō, Mikio, et al.. (2012). Spanning trees with a bounded number of leaves in a claw-free graph. Ars Combinatoria. 103. 137–154. 13 indexed citations

Kanō, Mikio & Akira Saito. (2012). Star-factors with large components. Discrete Mathematics. 312(12-13). 2005–2008. 20 indexed citations

10.

Aichholzer, Oswin, Sergey Bereg, Adrian Dumitrescu, et al.. (2009). Compatible geometric matchings. Computational Geometry. 42(6-7). 617–626. 19 indexed citations

11.

Kanō, Mikio & Jin Akiyama. (2004). Discrete and Computational Geometry: Japanese Conference, Jcdcg 2002, Tokyo, Japan, December 6-9, 2002: Revised Papers (Lecture Notes in Computer Science, 2866). Springer eBooks.

12.

Hurtado, Ferrán, Mikio Kanō, David Rappaport, & Csaba D. Tóth. (2004). Encompassing Colored Crossing-Free Geometric Graphs. Canadian Conference on Computational Geometry. 48–52. 9 indexed citations

13.

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

14.

Kaneko, Atsushi, et al.. (2000). ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE. International Journal of Computational Geometry & Applications. 10(1). 73–78. 16 indexed citations

15.

Kaneko, Atsushi, Mikio Kanō, & Shinichi Tokunaga. (1998). Straight-line embeddings of three rooted trees in the plane.. Canadian Conference on Computational Geometry. 2 indexed citations

16.

Kaneko, Atsushi & Mikio Kanō. (1998). Balanced partitions of two sets of points in the plane.. Canadian Conference on Computational Geometry. 3 indexed citations

17.

Egawa, Yoshimi, Mikio Kanō, & Alexander Kelmans. (1997). Star partitions of graphs. Journal of Graph Theory. 25(3). 185–190. 8 indexed citations

18.

Kanō, Mikio. (1996). Edge-removing games of star type. Discrete Mathematics. 151(1-3). 113–119.

19.

Kanō, Mikio, et al.. (1991). A Note on a Generalized Transmission Number and Its Sabidussi Difference. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 74(4). 684–686. 1 indexed citations

20.

Akiyama, Jin, et al.. (1985). Tiling finite figures consisting of regular polygons. John Wiley & Sons, Inc. eBooks. 1–3. 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