| LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets T Uno, M Kiyomi, H Arimura Fimi 126, 2004 | 645 | 2004 |
| New algorithms for enumerating all maximal cliques K Makino, T Uno Scandinavian workshop on algorithm theory, 260-272, 2004 | 590 | 2004 |
| An efficient algorithm for enumerating closed patterns in transaction databases T Uno, T Asai, Y Uchida, H Arimura International Conference on Discovery Science, 16-31, 2004 | 352 | 2004 |
| LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. T Uno, T Asai, Y Uchida, H Arimura Fimi 90, 2003 | 281 | 2003 |
| Effective local search algorithms for routing and scheduling problems with general time-window constraints T Ibaraki, S Imahori, M Kubo, T Masuda, T Uno, M Yagiura Transportation science 39 (2), 206-232, 2005 | 261 | 2005 |
| Lcm ver. 3: Collaboration of array, bitmap and prefix tree for frequent itemset mining T Uno, M Kiyomi, H Arimura Proceedings of the 1st international workshop on open source data mining …, 2005 | 249 | 2005 |
| Discovering frequent substructures in large unordered trees T Asai, H Arimura, T Uno, SI Nakano International Conference on Discovery Science, 47-61, 2003 | 240 | 2003 |
| Fast algorithms to enumerate all common intervals of two permutations T Uno, M Yagiura Algorithmica 26 (2), 290-309, 2000 | 221 | 2000 |
| Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs T Uno International Symposium on Algorithms and Computation, 92-101, 1997 | 187 | 1997 |
| An optimal algorithm for scanning all spanning trees of undirected graphs A Shioura, A Tamura, T Uno SIAM Journal on Computing 26 (3), 678-692, 1997 | 171 | 1997 |
| Efficient algorithms for dualizing large-scale hypergraphs K Murakami, T Uno 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013 | 163 | 2013 |
| An iterated local search algorithm for the vehicle routing problem with convex time penalty functions T Ibaraki, S Imahori, K Nonobe, K Sobue, T Uno, M Yagiura Discrete Applied Mathematics 156 (11), 2050-2069, 2008 | 158 | 2008 |
| Weighted substructure mining for image analysis S Nowozin, K Tsuda, T Uno, T Kudo, G BakIr 2007 IEEE Conference on Computer Vision and Pattern Recognition, 1-8, 2007 | 136 | 2007 |
| Swapping labeled tokens on graphs K Yamanaka, ED Demaine, T Ito, J Kawahara, M Kiyomi, Y Okamoto, ... Theoretical Computer Science 586, 81-94, 2015 | 118 | 2015 |
| An efficient algorithm for solving pseudo clique enumeration problem T Uno Algorithmica 56 (1), 3-16, 2010 | 118 | 2010 |
| Enumeration of condition-dependent dense modules in protein interaction networks E Georgii, S Dietmann, T Uno, P Pagel, K Tsuda Bioinformatics 25 (7), 933-940, 2009 | 115 | 2009 |
| The rise of catalyst informatics: towards catalyst genomics K Takahashi, L Takahashi, I Miyazato, J Fujima, Y Tanaka, T Uno, ... ChemCatChem 11 (4), 1146-1152, 2019 | 111 | 2019 |
| Efficient generation of rooted trees S Nakano, T Uno National Institute for Informatics (Japan), Tech. Rep. NII-2003-005E 8, 4-63, 2003 | 93 | 2003 |
| Constant time generation of trees with specified diameter S Nakano, T Uno International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004 | 90 | 2004 |
| The incidence and characteristics of silent cerebral infarction in elderly diabetic patients: association with serum-soluble adhesion molecules T Kawamura, T Umemura, A Kanai, T Uno, H Matsumae, T Sano, ... Diabetologia 41 (8), 911-917, 1998 | 90 | 1998 |
