Ryuhei Uehara

1.9k total citations
112 papers, 564 citations indexed

About

Ryuhei Uehara is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Artificial Intelligence. According to data from OpenAlex, Ryuhei Uehara has authored 112 papers receiving a total of 564 indexed citations (citations by other indexed papers that have themselves been cited), including 63 papers in Computational Theory and Mathematics, 32 papers in Computer Graphics and Computer-Aided Design and 28 papers in Artificial Intelligence. Recurrent topics in Ryuhei Uehara's work include Advanced Graph Theory Research (42 papers), Computational Geometry and Mesh Generation (32 papers) and Advanced Materials and Mechanics (23 papers). Ryuhei Uehara is often cited by papers focused on Advanced Graph Theory Research (42 papers), Computational Geometry and Mesh Generation (32 papers) and Advanced Materials and Mechanics (23 papers). Ryuhei Uehara collaborates with scholars based in Japan, United States and Canada. Ryuhei Uehara's co-authors include Yushi Uno, Erik D. Demaine, Yoshio Okamoto, Takehiro Ito, Takeaki Uno, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Gabriel Valiente and Seinosuke Toda and has published in prestigious journals such as BMC Bioinformatics, Information Sciences and Theoretical Computer Science.

In The Last Decade

Ryuhei Uehara

88 papers receiving 523 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ryuhei Uehara Japan 12 350 141 105 92 62 112 564
Mingyu Xiao China 13 255 0.7× 191 1.4× 119 1.1× 17 0.2× 18 0.3× 82 504
F. Frances Yao United States 10 144 0.4× 114 0.8× 155 1.5× 173 1.9× 28 0.5× 16 460
Peter Damaschke Sweden 15 304 0.9× 170 1.2× 133 1.3× 33 0.4× 97 1.6× 64 554
David Lichtenstein United States 7 311 0.9× 171 1.2× 180 1.7× 153 1.7× 17 0.3× 8 591
Yuichi Asahiro Japan 8 137 0.4× 97 0.7× 82 0.8× 25 0.3× 27 0.4× 34 316
Naveen Sivadasan India 10 131 0.4× 63 0.4× 37 0.4× 36 0.4× 67 1.1× 34 293
Matthias Köppe United States 14 198 0.6× 38 0.3× 52 0.5× 54 0.6× 56 0.9× 39 453
Stéphane Pérennès France 12 239 0.7× 409 2.9× 69 0.7× 42 0.5× 14 0.2× 70 573
H. Ramesh India 9 137 0.4× 61 0.4× 122 1.2× 37 0.4× 45 0.7× 14 294
Ralf Klasing France 14 206 0.6× 462 3.3× 41 0.4× 11 0.1× 14 0.2× 73 618

Countries citing papers authored by Ryuhei Uehara

Since Specialization
Citations

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

Fields of papers citing papers by Ryuhei Uehara

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ryuhei Uehara

This figure shows the co-authorship network connecting the top 25 collaborators of Ryuhei Uehara. A scholar is included among the top collaborators of Ryuhei Uehara 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 Ryuhei Uehara. Ryuhei Uehara 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.
Uehara, Ryuhei, et al.. (2025). Constant time enumeration of weighted trees. Discrete Applied Mathematics. 375. 129–138. 1 indexed citations
2.
Uehara, Ryuhei, et al.. (2024). WALCOM: Algorithms and Computation. Lecture notes in computer science.
3.
Uehara, Ryuhei, et al.. (2023). Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs. Discrete Applied Mathematics. 342. 190–199.
4.
Demaine, Erik D., et al.. (2022). Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
5.
Luna, Giuseppe Antonio Di, Ryuhei Uehara, Giovanni Viglietta, & Yukiko Yamauchi. (2020). Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
6.
Demaine, Erik D., et al.. (2019). Impossible Folding Font. 51–58.
7.
Uehara, Ryuhei, et al.. (2019). Implementation of Enumeration Algorithm of Connected Bipartite Permutation Graphs. IEICE Technical Report; IEICE Tech. Rep.. 118(517). 17–23. 1 indexed citations
8.
Saitoh, Toshiki, et al.. (2019). Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. Theoretical Computer Science. 806. 310–322. 5 indexed citations
9.
Horiyama, Takashi, et al.. (2017). Rep-cubes: Unfolding and Dissection of Cubes.. Canadian Conference on Computational Geometry. 62–67. 1 indexed citations
10.
Demaine, Erik D., Yoshio Okamoto, Ryuhei Uehara, & Yushi Uno. (2013). Computational complexity and an integer programming model of Shakashaka. JAIST Repository. 113(14). 43–48. 3 indexed citations
11.
Demaine, Erik D., Martin L. Demaine, & Ryuhei Uehara. (2013). Zipper Unfoldability of Domes and Prismoids.. JAIST Repository. 1 indexed citations
12.
Okamoto, Yoshio, Yota Otachi, & Ryuhei Uehara. (2012). On bipartite powers of bigraphs. Discrete Mathematics & Theoretical Computer Science. Vol. 14 no. 2(Graph Theory). 1 indexed citations
13.
Saitoh, Toshiki, et al.. (2012). The complexity of the stamp folding problem. Theoretical Computer Science. 497. 13–19. 2 indexed citations
14.
Uehara, Ryuhei, et al.. (2011). The Complexity of Free Flood Filling Games. 2011(7). 1–5. 1 indexed citations
15.
Uehara, Ryuhei. (2008). Polygons Folding to Plural Incongruent Orthogonal Boxes.. Canadian Conference on Computational Geometry. 3 indexed citations
16.
Uehara, Ryuhei & Yushi Uno. (2008). Laminar structure of ptolemaic graphs with applications. Discrete Applied Mathematics. 157(7). 1533–1543. 7 indexed citations
17.
Saitoh, Toshiki, Masashi Kiyomi, & Ryuhei Uehara. (2007). Simple efficient algorithm for MPQ-tree of an interval graph. IEICE Technical Report; IEICE Tech. Rep.. 107(127). 49–54. 1 indexed citations
18.
Biedl, Thérèse, Timothy M. Chan, Erik D. Demaine, et al.. (2002). Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.. Canadian Conference on Computational Geometry. 105–108. 1 indexed citations
19.
Uehara, Ryuhei & Zhizhong Chen. (1997). Parallel Algorithms for Maximal Linear Forests. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 627–634.
20.
Uehara, Ryuhei, et al.. (1990). Generalized Hi-Q is NP-complete. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 73(2). 270–273. 14 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