This map shows the geographic impact of Takeaki 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 Takeaki Uno with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Takeaki Uno more than expected).
This network shows the impact of papers produced by Takeaki 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 Takeaki Uno. The network helps show where Takeaki Uno may publish in the future.
Co-authorship network of co-authors of Takeaki Uno
This figure shows the co-authorship network connecting the top 25 collaborators of Takeaki Uno.
A scholar is included among the top collaborators of Takeaki 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 Takeaki Uno. Takeaki Uno is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Demaine, Erik D., Takehiro Ito, Jun Kawahara, et al.. (2015). Swapping labeled tokens on graphs. Theoretical Computer Science. 586. 81–94.29 indexed citations
Uehara, Ryuhei, et al.. (2011). The Complexity of Free Flood Filling Games. 2011(7). 1–5.1 indexed citations
11.
Kijima, Shuji, Yoshio Okamoto, & Takeaki Uno. (2010). Counting the number of dominating sets in graph classes. IEICE Technical Report; IEICE Tech. Rep.. 110(12). 9–15.
12.
Tabei, Yasuo, Takeaki Uno, Masashi Sugiyama, & Koji Tsuda. (2010). Single versus Multiple Sorting in All Pairs Similarity Search. Asian Conference on Machine Learning. 145–160.10 indexed citations
Dailey, Matthew N., et al.. (2008). Probabilistic prediction of student affect from hand gestures. 58–63.4 indexed citations
16.
Uno, Takeaki, et al.. (2006). An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks.
17.
Kiyomi, Masashi, et al.. (2005). Generalized amazons is PSPACE-complete. International Joint Conference on Artificial Intelligence. 132–137.7 indexed citations
18.
Uno, Takeaki. (2003). A Practical Fast Algorithm for Enumerating Cliques in Huge Bipartite Graphs and Its Implementation. IPSJ SIG Notes. 2003(32). 1–8.3 indexed citations
19.
Uno, Takeaki. (2003). An Output Linear Time Algorithm for Enumerating Chordless Cycles. IPSJ SIG Notes. 2003(110). 47–53.2 indexed citations
20.
Uno, Takeaki. (2002). A Practical Fast Algorithm for Enumerating Minimal SetCoverings. IPSJ SIG Notes. 2002(29). 9–16.3 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.