Takehiro Ito

1.5k total citations
73 papers, 457 citations indexed

About

Takehiro Ito is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Molecular Biology. According to data from OpenAlex, Takehiro Ito has authored 73 papers receiving a total of 457 indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Computational Theory and Mathematics, 26 papers in Computer Networks and Communications and 8 papers in Molecular Biology. Recurrent topics in Takehiro Ito's work include Advanced Graph Theory Research (46 papers), Complexity and Algorithms in Graphs (25 papers) and Optimization and Search Problems (14 papers). Takehiro Ito is often cited by papers focused on Advanced Graph Theory Research (46 papers), Complexity and Algorithms in Graphs (25 papers) and Optimization and Search Problems (14 papers). Takehiro Ito collaborates with scholars based in Japan, United States and Canada. Takehiro Ito's co-authors include Xiao Zhou, Erik D. Demaine, Takao Nishizeki, Ryuhei Uehara, Yushi Uno, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Akira Suzuki and Marcin Kamiński and has published in prestigious journals such as Journal of Molecular and Cellular Cardiology, Gene Therapy and Theoretical Computer Science.

In The Last Decade

Takehiro Ito

62 papers receiving 430 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Takehiro Ito Japan 11 292 145 87 66 56 73 457
Joan P. Hutchinson United States 13 426 1.5× 99 0.7× 60 0.7× 43 0.7× 129 2.3× 45 572
Dorit Dor Israel 6 128 0.4× 45 0.3× 72 0.8× 95 1.4× 66 1.2× 10 250
David E. Hudak United States 11 97 0.3× 155 1.1× 34 0.4× 32 0.5× 29 0.5× 35 337
Chris Umans United States 10 165 0.6× 70 0.5× 38 0.4× 138 2.1× 23 0.4× 16 337
Lhouari Nourine France 9 245 0.8× 42 0.3× 15 0.2× 111 1.7× 23 0.4× 17 362
H. Ramesh India 9 137 0.5× 61 0.4× 29 0.3× 122 1.8× 9 0.2× 14 294
Oliver Kullmann United Kingdom 10 267 0.9× 137 0.9× 25 0.3× 185 2.8× 5 0.1× 23 357
Ronald I. Becker South Africa 12 150 0.5× 88 0.6× 52 0.6× 33 0.5× 4 0.1× 34 347
Nils Hebbinghaus Germany 10 214 0.7× 24 0.2× 24 0.3× 225 3.4× 22 0.4× 20 306
Sam Buss United States 13 392 1.3× 51 0.4× 15 0.2× 295 4.5× 13 0.2× 35 483

Countries citing papers authored by Takehiro Ito

Since Specialization
Citations

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

Fields of papers citing papers by Takehiro Ito

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Takehiro Ito

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

All Works

20 of 20 papers shown
1.
Ito, Takehiro, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, & Yoshio Okamoto. (2025). Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures. 6(3). 1–17.
2.
Bousquet, Nicolás, et al.. (2022). Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
3.
Ito, Takehiro, Naoyuki Kamiyama, Yusuke Kobayashi, & Yoshio Okamoto. (2019). Algorithms for Gerrymandering over Graphs. Theoretical Computer Science. 868. 1413–1421. 1 indexed citations
4.
Ito, Takehiro & Yota Otachi. (2018). Reconfiguration of colorable sets in classes of perfect graphs. Theoretical Computer Science. 772. 111–122. 2 indexed citations
5.
Ito, Takehiro, et al.. (2016). The complexity of dominating set reconfiguration. Theoretical Computer Science. 651. 37–49. 11 indexed citations
6.
Ito, Takehiro, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, & Yoshio Okamoto. (2016). Efficient Stabilization of Cooperative Matching Games. Adaptive Agents and Multi-Agents Systems. 41–49. 3 indexed citations
7.
Demaine, Erik D., Takehiro Ito, Jun Kawahara, et al.. (2015). Swapping labeled tokens on graphs. Theoretical Computer Science. 586. 81–94. 29 indexed citations
8.
Ito, Takehiro, Shin-ichi Nakano, Yoshio Okamoto, et al.. (2015). A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Computational Geometry. 51. 25–39. 3 indexed citations
9.
Demaine, Erik D., Martin L. Demaine, Takehiro Ito, et al.. (2015). Linear-time algorithm for sliding tokens on trees. Theoretical Computer Science. 600. 132–142. 17 indexed citations
10.
Ito, Takehiro, et al.. (2014). Reconfiguration of listL(2,1)-labelings in a graph. Theoretical Computer Science. 544. 84–97. 8 indexed citations
11.
Ito, Takehiro, Shin-ichi Nakano, Yoshio Okamoto, et al.. (2014). A 4.31-approximation for the geometric unique coverage problem on unit disks. Theoretical Computer Science. 544. 14–31. 5 indexed citations
12.
Ito, Takehiro, et al.. (2012). Reconfiguration of List L(2,1)-Labelings in a Graph. Lecture notes in computer science. 112(340). 33–40. 7 indexed citations
13.
Ito, Takehiro, Marcin Kamiński, & Erik D. Demaine. (2012). Reconfiguration of list edge-colorings in a graph. Discrete Applied Mathematics. 160(15). 2199–2207. 22 indexed citations
14.
Ito, Takehiro, Marcin Kamiński, Daniël Paulusma, & Dimitrios M. Thilikos. (2011). Parameterizing cut sets in a graph by the number of their components. Theoretical Computer Science. 412(45). 6340–6350. 3 indexed citations
15.
Ito, Takehiro, Erik D. Demaine, Nicholas J. A. Harvey, et al.. (2010). On the complexity of reconfiguration problems. Theoretical Computer Science. 412(12-14). 1054–1065. 87 indexed citations
16.
Nomoto, Tomonori, Takashi Okada, Kuniko Shimazaki, et al.. (2008). Systemic delivery of IL-10 by an AAV vector prevents vascular remodeling and end-organ damage in stroke-prone spontaneously hypertensive rat. Gene Therapy. 16(3). 383–391. 24 indexed citations
17.
Ito, Takehiro, et al.. (2006). Approximability of Partitioning Graphs with Supply and Demand. IEICE Technical Report; IEICE Tech. Rep.. 106(289). 17–23.
18.
Ito, Takehiro, Xiao Zhou, & Takao Nishizeki. (2005). Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. Journal of Discrete Algorithms. 4(1). 142–154. 11 indexed citations
19.
Ito, Takehiro, Akihiro Munemasa, & Mieko Yamada. (1991). 特性4のGalois環上の非晶質関連構想 | 文献情報 | J-GLOBAL 科学技術総合リンクセンター. European Journal of Combinatorics. 12(6). 513–526. 18 indexed citations
20.
Ito, Takehiro, Shirabe Matsumoto, & Yasuaki Ito. (1978). [Chronic heart failure and vasodilator therapy].. PubMed. 36(11). 3565–72. 2 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

Rankless by CCL
2026