Follow
Takeaki Uno
Takeaki Uno
National Institute of Informatics, Japan
Verified email at nii.jp
Title
Cited by
Cited by
Year
LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets
T Uno, M Kiyomi, H Arimura
Fimi 126, 2004
5942004
New algorithms for enumerating all maximal cliques
K Makino, T Uno
Scandinavian workshop on algorithm theory, 260-272, 2004
5092004
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
3432004
Lcm: An efficient algorithm for enumerating frequent closed item sets.
T Uno, T Asai, Y Uchida, H Arimura
Fimi 90, 2003
2572003
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
2332005
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
2302005
Discovering frequent substructures in large unordered trees
T Asai, H Arimura, T Uno, SI Nakano
International Conference on Discovery Science, 47-61, 2003
2232003
Fast algorithms to enumerate all common intervals of two permutations
T Uno, M Yagiura
Algorithmica 26 (2), 290-309, 2000
2172000
Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs
T Uno
International Symposium on Algorithms and Computation, 92-101, 1997
1541997
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
1501997
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
1382008
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
1312007
Efficient algorithms for dualizing large-scale hypergraphs
K Murakami, T Uno
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013
1242013
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
1092009
An efficient algorithm for solving pseudo clique enumeration problem
T Uno
Algorithmica 56 (1), 3-16, 2010
972010
Efficient generation of rooted trees
S Nakano, T Uno
National Institute for Informatics (Japan), Tech. Rep. NII-2003-005E 8, 2003
902003
Swapping labeled tokens on graphs
K Yamanaka, ED Demaine, T Ito, J Kawahara, M Kiyomi, Y Okamoto, ...
Theoretical Computer Science 586, 81-94, 2015
812015
Constant time generation of trees with specified diameter
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004
802004
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
682019
Mining complex genotypic features for predicting HIV-1 drug resistance
H Saigo, T Uno, K Tsuda
Bioinformatics 23 (18), 2455-2462, 2007
662007
The system can't perform the operation now. Try again later.
Articles 1–20