Yushi Uno

861 total citations
39 papers, 246 citations indexed

About

Yushi Uno is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Yushi Uno has authored 39 papers receiving a total of 246 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 10 papers in Artificial Intelligence and 8 papers in Computer Networks and Communications. Recurrent topics in Yushi Uno's work include Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (13 papers) and Artificial Intelligence in Games (8 papers). Yushi Uno is often cited by papers focused on Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (13 papers) and Artificial Intelligence in Games (8 papers). Yushi Uno collaborates with scholars based in Japan, United States and Canada. Yushi Uno's co-authors include Ryuhei Uehara, Erik D. Demaine, Nicholas J. A. Harvey, Takehiro Ito, Christos H. Papadimitriou, Martha Sideri, Hirotaka Ono, Toru Hasunuma, Yoshio Okamoto and Toshihide Ibaraki and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Discrete Applied Mathematics.

In The Last Decade

Yushi Uno

35 papers receiving 231 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Yushi Uno Japan	8	188	70	52	38	28	39	246
Janka Chlebı́ková Slovakia	8	241 1.3×	138 2.0×	52 1.0×	32 0.8×	14 0.5×	25	327
Yota Otachi Japan	9	196 1.0×	104 1.5×	26 0.5×	27 0.7×	10 0.4×	66	244
Rossella Petreschi Italy	11	264 1.4×	76 1.1×	106 2.0×	33 0.9×	30 1.1×	40	332
Geir Agnarsson United States	7	154 0.8×	46 0.7×	56 1.1×	21 0.6×	14 0.5×	27	246
Ignasi Sau France	9	222 1.2×	87 1.2×	49 0.9×	31 0.8×	7 0.3×	77	294
Ioan Todinca France	11	325 1.7×	153 2.2×	18 0.3×	43 1.1×	16 0.6×	39	371
Mathieu Liedloff France	11	217 1.2×	110 1.6×	31 0.6×	20 0.5×	10 0.4×	36	276
Igor Razgon Ireland	11	370 2.0×	141 2.0×	43 0.8×	51 1.3×	13 0.5×	24	424
Sundar Vishwanathan India	10	186 1.0×	156 2.2×	43 0.8×	38 1.0×	7 0.3×	30	282
Jesper Nederlof Netherlands	9	337 1.8×	132 1.9×	48 0.9×	71 1.9×	6 0.2×	35	373

Countries citing papers authored by Yushi Uno

Since Specialization

Citations

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

Fields of papers citing papers by Yushi Uno

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Yushi Uno

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

Boros, Endre, Vladimir Gurvich, Martin Milanič, & Yushi Uno. (2025). Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem. Journal of Graph Theory. 109(4). 466–480.

Kobayashi, Yusuke, Yoshio Okamoto, Yota Otachi, & Yushi Uno. (2022). Linear-Time Recognition of Double-Threshold Graphs. Algorithmica. 84(4). 1163–1181. 3 indexed citations

Ono, Hirotaka, et al.. (2019). Settlement fund circulation problem. Discrete Applied Mathematics. 265. 86–103. 1 indexed citations

Horiyama, Takashi, Julian Keil, David Kirkpatrick, et al.. (2018). Swapping colored tokens on graphs. Theoretical Computer Science. 729. 1–10. 3 indexed citations

Lampis, Michael, et al.. (2017). Parameterized Edge Hamiltonicity. Discrete Applied Mathematics. 248. 68–78. 2 indexed citations

Díez, Yago, et al.. (2017). Hanabi is NP-hard, even for cheaters who look at their cards. Theoretical Computer Science. 675. 43–55. 5 indexed citations

Langerman, Stefan & Yushi Uno. (2016). Threes!, Fives, 1024!, and 2048 are Hard. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 1 indexed citations

Ono, Hirotaka, et al.. (2016). Subexponential fixed-parameter algorithms for partial vector domination. Discrete Optimization. 22. 111–121. 1 indexed citations

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

10.

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

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.

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

13.

Otachi, Yota, Toshiki Saitoh, Shuji Kijima, et al.. (2012). Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discrete Applied Mathematics. 168. 69–77. 1 indexed citations

14.

Uehara, Ryuhei, et al.. (2011). The Complexity of Free Flood Filling Games. 2011(7). 1–5. 1 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.

Hasunuma, Toru, et al.. (2009). An O(n1.75) algorithm for L(2,1)-labeling of trees. Theoretical Computer Science. 410(38-40). 3702–3710. 10 indexed citations

17.

Hasunuma, Toru, et al.. (2008). An Algorithm for L(2, 1)-Labeling of Trees.. 185–197. 1 indexed citations

18.

Uehara, Ryuhei & Yushi Uno. (2008). Laminar structure of ptolemaic graphs with applications. Discrete Applied Mathematics. 157(7). 1533–1543. 7 indexed citations

19.

Makino, Kazuhisa, Yushi Uno, & Toshihide Ibaraki. (2006). Minimum edge ranking spanning trees of split graphs. Discrete Applied Mathematics. 154(16). 2373–2386. 1 indexed citations

20.

Uno, Yushi & Toshihide Ibaraki. (1998). Reachability Problems of Random Digraphs. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(12). 2694–2702. 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