Takeaki Uno
Impact in
-
- Rough Sets and Fuzzy Logic
- Advanced Graph Theory Research
-
- Vehicle Routing Optimization Methods
Papers in
-
- Advanced Graph Theory Research 34
- Complexity and Algorithms in Graphs 19
- Rough Sets and Fuzzy Logic 8
-
- Algorithms and Data Compression 20
- Co-authors
- Hiroki Arimura (15 shared papers)Masashi Kiyomi (6 shared papers)Mutsunori Yagiura (4 shared papers)Koji Tsuda (5 shared papers)Shinji Imahori (4 shared papers)Toshihide Ibaraki (2 shared papers)Akiyoshi Shioura (2 shared papers)Teruo Masuda (1 shared paper)
- Journals
- Theoretical Computer Science (9 papers)Algorithmica (7 papers)Discrete Applied Mathematics (7 papers)Bioinformatics (2 papers)Computational Geometry (2 papers)
- Partner nations
- JapanSwitzerlandGermany
In The Last Decade
Takeaki Uno
96 papers receiving 1.5k citations
Peers
Comparison fields: 5 of 126
- Computational Theory and Mathematics 568
- Industrial and Manufacturing Engineering 225
- Signal Processing 226
- Information Systems 434
- Computer Graphics and Computer-Aided Design 59
Countries citing papers authored by Takeaki Uno
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).
Fields of papers citing papers by Takeaki Uno
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-authors
The 25 scholars most cited alongside Takeaki Uno, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 110 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets | 2004 | 194 |
| 2 | 2005 | 133 | |
| 3 | 2005 | 116 | |
| 4 | 2018 | 87 | |
| 5 | LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. | 2003 | 78 |
| 6 | 2000 | 70 | |
| 7 | 2007 | 69 | |
| 8 | 2009 | 52 | |
| 9 | 2007 | 51 | |
| 10 | 1997 | 48 | |
| 11 | 2023 | 41 | |
| 12 | 2008 | 38 | |
| 13 | 2014 | 34 | |
| 14 | 2007 | 30 | |
| 15 | 2015 | 29 | |
| 16 | 2020 | 24 | |
| 17 | 2007 | 24 | |
| 18 | 2016 | 24 | |
| 19 | 2014 | 23 | |
| 20 | 2003 | 20 |
About Takeaki Uno
Takeaki Uno is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Signal Processing and Computer Vision and Pattern Recognition, having authored 110 papers that have together received 1.6k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (34 papers), Algorithms and Data Compression (20 papers), Complexity and Algorithms in Graphs (19 papers), Data Management and Algorithms (16 papers), Computational Geometry and Mesh Generation (12 papers), Data Mining Algorithms and Applications (12 papers), Rough Sets and Fuzzy Logic (8 papers) and Complex Network Analysis Techniques (7 papers). The work is most often cited by research in Computational Theory and Mathematics (568 citations), Industrial and Manufacturing Engineering (225 citations), Signal Processing (226 citations), Information Systems (434 citations) and Computer Graphics and Computer-Aided Design (59 citations). Takeaki Uno has collaborated with scholars based in Japan, Switzerland and Germany. Frequent co-authors include Hiroki Arimura, Masashi Kiyomi, Mutsunori Yagiura, Koji Tsuda, Shinji Imahori, Toshihide Ibaraki, Akiyoshi Shioura, Teruo Masuda, Mikio Kubo and Tatsuya Asai. Their work appears in journals such as Theoretical Computer Science, Algorithmica, Discrete Applied Mathematics, Bioinformatics and Computational Geometry.
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.