Hiro Ito

867 total citations
64 papers, 271 citations indexed

About

Hiro Ito is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Hiro Ito has authored 64 papers receiving a total of 271 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 29 papers in Computer Networks and Communications and 14 papers in Artificial Intelligence. Recurrent topics in Hiro Ito's work include Optimization and Search Problems (18 papers), Complexity and Algorithms in Graphs (17 papers) and Advanced Graph Theory Research (12 papers). Hiro Ito is often cited by papers focused on Optimization and Search Problems (18 papers), Complexity and Algorithms in Graphs (17 papers) and Advanced Graph Theory Research (12 papers). Hiro Ito collaborates with scholars based in Japan, United States and Belgium. Hiro Ito's co-authors include Yuichi Yoshida, Masaki Yamamoto, Kazuo Iwama, Hiroyoshi Miwa, Hiroshi Nagamochi, Hideyuki Uehara, Yasuo Okabe, Tadashi Dohi, Satoru Fujishige and Kazuhisa Makino and has published in prestigious journals such as IEEE Access, SIAM Journal on Computing and International Journal of Quantum Chemistry.

In The Last Decade

Hiro Ito

50 papers receiving 254 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Hiro Ito Japan	9	162	157	43	41	32	64	271
Kevin Wayne United States	8	83 0.5×	66 0.4×	33 0.8×	7 0.2×	31 1.0×	18	205
Sukumar Ghosh United States	13	74 0.5×	459 2.9×	81 1.9×	5 0.1×	25 0.8×	42	512
C Suffel United States	12	335 2.1×	227 1.4×	7 0.2×	5 0.1×	65 2.0×	29	583
V. Zissimopoulos France	11	25 0.2×	230 1.5×	71 1.7×	5 0.1×	17 0.5×	18	432
Carl Burch United States	7	43 0.3×	124 0.8×	60 1.4×	3 0.1×	30 0.9×	11	235
Phillip G. Bradford United States	9	40 0.2×	106 0.7×	68 1.6×		26 0.8×	43	212
Thanasis Tsantilas United States	8	116 0.7×	384 2.4×	60 1.4×	1 0.0×	68 2.1×	10	443
Pino Persiano Italy	8	48 0.3×	126 0.8×	83 1.9×		41 1.3×	15	223
Loris Marchal France	11	32 0.2×	325 2.1×	18 0.4×		21 0.7×	53	386
Jérôme Galtier France	7	23 0.1×	137 0.9×	7 0.2×	1 0.0×	91 2.8×	34	214

Countries citing papers authored by Hiro Ito

Since Specialization

Citations

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

Fields of papers citing papers by Hiro Ito

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Hiro Ito

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

Kitsuwan, Nattapong, et al.. (2019). Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks. IEEE Access. 7. 25422–25437. 8 indexed citations

Bein, Wolfgang, et al.. (2019). Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems. Information. 10(2). 44–44. 1 indexed citations

Demaine, Erik D., et al.. (2018). Bumpy pyramid folding. Computational Geometry. 75. 22–31.

Demaine, Erik D., David Eppstein, Hiro Ito, et al.. (2015). Folding a paper strip to minimize thickness. Journal of Discrete Algorithms. 36. 18–26. 1 indexed citations

Saitoh, Toshiki, et al.. (2012). The complexity of the stamp folding problem. Theoretical Computer Science. 497. 13–19. 2 indexed citations

Yoshida, Yuichi & Hiro Ito. (2010). Testing k-edge-connectivity of digraphs. Journal of Systems Science and Complexity. 23(1). 91–101. 6 indexed citations

Ito, Hiro, et al.. (2007). Linear Time Enumeration of Isolated Bicliques with Part Size Proportion Bounded by Constants. IEICE Technical Report; IEICE Tech. Rep.. 107(127). 9–16.

Ito, Hiro, et al.. (2005). Single backup table schemes for shortest-path routing. Theoretical Computer Science. 333(3). 347–353. 10 indexed citations

Ito, Hiro, et al.. (2004). C7-Coloring Problem. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 87(5). 1243–1250.

10.

Ito, Hiro, et al.. (2003). Polynomial-Time Computable Backup Tables for Shortest-Path Routing.. 163–177. 8 indexed citations

11.

Ito, Hiro, et al.. (2002). On H-Coloring Problems with H Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(5). 1026–1030.

12.

Uehara, Hideyuki, et al.. (2002). A Packet Relay Control Scheme based on Priority Regions in Multihop Wireless Networks. 101(539). 15–20. 3 indexed citations

13.

Ito, Hiro, et al.. (2001). A Generalization of 2-Dimension Ham Sandwich Theorem. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 84(5). 1144–1151. 3 indexed citations

14.

Ito, Hiro, et al.. (2001). Lengths of tours and permutations on a vertex set of a convex polygon. Discrete Applied Mathematics. 115(1-3). 63–71. 2 indexed citations

15.

Miwa, Hiroyoshi & Hiro Ito. (2000). NP-Competeness of Reallocation Problems with Restricted Block Volume. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(4). 590–597. 1 indexed citations

16.

Miwa, Hiroyoshi & Hiro Ito. (1999). NA -Edge- Connectivity Augmentation Problem - Algorithms and Complexity for 1 - NA -Edge- Connectivity Augmentation and 2 - NA -Edge- Connectivity Augmentation-. IPSJ SIG Notes. 1999(8). 17–24. 3 indexed citations

17.

Miwa, Hiroyoshi & Hiro Ito. (1998). Sparse Spanning Subgraphs Preserving Connectivity and Distance between Vertices and Vertex Subsets(Special Section on Discrete Mathematics and Its Applications). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(5). 832–841. 6 indexed citations

18.

Ito, Hiro, et al.. (1998). Linear time algorithms for graph search and connectivity determination on complement graphs. Information Processing Letters. 66(4). 209–213. 12 indexed citations

19.

Miwa, Hiroyoshi & Hiro Ito. (1997). A Linear-Time Algorithm for Determining the Order of Moving Products in Reallocation Problems (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 80(3). 534–543. 1 indexed citations

20.

Miwa, Hiroyoshi & Hiro Ito. (1996). Complexity and Algorithm for Reallocation Problem (Special Section on Discrete Mathematics and Its Applications). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 79(4). 461–468. 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