2026 Takeaki Uno: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	36	11162	10845	166	158	232	6285

Takeaki Uno publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Takeaki Uno sits on this spectrum.

32 publications 991+

This scientist: 232 publications — 57th percentile

57% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Takeaki Uno D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Takeaki Uno sits on this spectrum.

30 D-Index 131+

This scientist: 36 D-Index — 23rd percentile

23% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Takeaki Uno is affiliated with the National Institute of Informatics in Japan. Their primary area of research is in computer science, with a particular focus on computational theory and mathematics. Their work spans multiple subfields including artificial intelligence, statistical and nonlinear physics, computer networks and communications, and sociology and political science.

The research topics Takeaki Uno has contributed to include:

Advanced Graph Theory Research
Complex Network Analysis Techniques
Complexity and Algorithms in Graphs
Misinformation and Its Impacts
Algorithms and Data Compression
Vaccine Coverage and Hesitancy
Constraint Satisfaction and Optimization

Takeaki Uno has published extensively in several scientific venues. They have contributed notably to:

arXiv (Cornell University)
Discrete Applied Mathematics
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Algorithmica
Theoretical Computer Science

Frequent collaborators in their work include:

K. Wasa
Ryota Kobayashi
Alessio Conte
Kazuhiro Kurita
Roberto Grossi

Some of the recent papers associated with Takeaki Uno are:

"Catalysts informatics: paradigm shift towards data-driven catalyst design", 2023, Chemical Communications
"Evolution of Public Opinion on COVID-19 Vaccination in Japan: Large-Scale Twitter Data Analysis", 2022, Journal of Medical Internet Research
"Direct design of active catalysts for low temperature oxidative coupling of methane via machine learning and data mining", 2020, Catalysis Science & Technology
"Analyzing temporal patterns of topic diversity using graph clustering", 2020, The Journal of Supercomputing
"Proximity Search for Maximal Subgraph Enumeration", 2022, SIAM Journal on Computing

Best Publications

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets

Takeaki Uno;Masashi Kiyomi;Hiroki Arimura

581
Citations
New Algorithms for Enumerating All Maximal Cliques

Kazuhisa Makino;Takeaki Uno

540
Citations
An efficient algorithm for enumerating closed patterns in transaction databases

Takeaki Uno;Tatsuya Asai;Yuzo Uchida;Hiroki Arimura

349
Citations
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.

Takeaki Uno;Tatsuya Asai;Yuzo Uchida;Hiroki Arimura

271
Citations
LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining

Takeaki Uno;Masashi Kiyomi;Hiroki Arimura

251
Citations
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

T. Ibaraki;S. Imahori;M. Kubo;T. Masuda

246
Citations
Discovering frequent substructures in large unordered trees

Tatsuya Asai;Hiroki Arimura;Takeaki Uno;Shin Ichi Nakano

234
Citations
Fast algorithms to enumerate all common intervals of two permutations

Takeaki Uno;Mutsunori Yagiura

213
Citations
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs

Takeaki Uno

165
Citations
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions

Toshihide Ibaraki;Shinji Imahori;Koji Nonobe;Kensuke Sobue

156
Citations
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs

Akiyoshi Shioura;Akihisa Tamura;Takeaki Uno

154
Citations
Weighted Substructure Mining for Image Analysis

S. Nowozin;K. Tsuda;T. Uno;T. Kudo

141
Citations
Efficient algorithms for dualizing large-scale hypergraphs

Keisuke Murakami;Takeaki Uno

128
Citations
Enumeration of condition-dependent dense modules in protein interaction networks

Elisabeth Georgii;Sabine Dietmann;Takeaki Uno;Philipp Pagel

116
Citations
An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem

Takeaki Uno

110
Citations
Swapping labeled tokens on graphs

Katsuhisa Yamanaka;Erik D. Demaine;Takehiro Ito;Jun Kawahara

101
Citations
Efficient Generation of Rooted Trees

Shin-ichi Nakano;Takeaki Uno

91
Citations
Constant time generation of trees with specified diameter

Shin-Ichi Nakano;Takeaki Uno

84
Citations
Mining complex genotypic features for predicting HIV-1 drug resistance

Hiroto Saigo;Takeaki Uno;Koji Tsuda

69
Citations
A Fast Algorithm for Enumerating Bipartite Perfect Matchings

Takeaki Uno

69
Citations
Discovering Frequent Substructures in Large Unordered Trees

Tatsuya Asai;達哉浅井;Hiroki Arimura;博紀有村

1
Citations
Fast Algorithms to Enumerate All Common Intervals of Two Permutations and Their Applications(Optimization Theory in Descrete and Continuous Mathematical Sciences)

Takeaki Uno;Mutsunori Yagiura

1
Citations

Frequent Co-Authors

Koji Tsuda University of Tokyo

Satoru Fujishige Kyoto University

Erik D. Demaine MIT

Hiroyuki Koshino Tokyo University of Agriculture

Koichi Ohno University of Tokyo

Boris Aronov New York University

Günter Rote Freie Universität Berlin

Sebastian Nowozin Microsoft (United States)

Hideki Hashimoto Chuo University

Sabine Dietmann University of Cambridge

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

If you’re considering a future in computer science, there are many flexible online educational options to fit your schedule and goals. For those who want to enter the workforce sooner, associates degrees online provide a solid foundation in computer science and open doors to entry-level positions in IT, programming, or tech support.

Looking to advance your qualifications more quickly? Explore quick masters degrees online which allow you to boost your credentials and skills in as little as one year. Many professionals are also seeking most useful masters degrees that align with employer demand, offering great career prospects in fields like artificial intelligence, cybersecurity, or data analytics.

Shorter, focused learning options are available too. Consider earning certifications that pay well to quickly validate your skills in specific programming languages or technologies. These can significantly boost earning potential and job opportunities—even for those who are still studying.