| 2011 |
|---|
| 25 | Algorithmic Folding Complexity. Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara, Stefan Langerman, Ryuhei Uehara, Takeaki Uno. Graphs and Combinatorics (27): 341-351 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 24 | The complexity of UNO. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno. CoRR (abs/1003.2851) (2010). Web SearchBibTeXDownload |
| 23 | UNO Is Hard, Even for a Single Player. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno. FUN 2010, 133-144. Web SearchBibTeXDownload |
| 22 | Single versus Multiple Sorting in All Pairs Similarity Search. Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji Tsuda. Journal of Machine Learning Research - Proceedings Track (13): 145-160 (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 21 | Enumeration of condition-dependent dense modules in protein interaction networks. Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda. Bioinformatics (25): 933-940 (2009). Web SearchBibTeXDownload |
| 20 | Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method. Takeaki Uno, Masashi Sugiyama, Koji Tsuda. CoRR (abs/0904.3151) (2009). Web SearchBibTeXDownload |
| 19 | Efficient serial episode mining with minimal occurrences. Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura. ICUIMC 2009, 457-464. Web SearchBibTeXDownload |
| 18 | Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. Hiroki Arimura, Takeaki Uno. SDM 2009, 1087-1098. Web SearchBibTeXDownload |
| 2008 |
|---|
| 17 | An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura. Discrete Applied Mathematics (156): 2050-2069 (2008). Web SearchBibTeXDownload |
| 16 | LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. Shin-ichi Minato, Takeaki Uno, Hiroki Arimura. PAKDD 2008, 234-246. Web SearchBibTeXDownload |
| 15 | Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. Takeaki Uno, Hiroki Arimura. PAKDD 2008, 357-368. Web SearchBibTeXDownload |
| 2007 |
|---|
| 14 | Mining complex genotypic features for predicting HIV-1 drug resistance. Hiroto Saigo, Takeaki Uno, Koji Tsuda. Bioinformatics (23): 2455-2462 (2007). Web SearchBibTeXDownload |
| 13 | Mining expression-dependent modules in the human interaction network. Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda. BMC Bioinformatics (8) (2007). Web SearchBibTeXDownload |
| 12 | Weighted Substructure Mining for Image Analysis. Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir. CVPR 2007. Web SearchBibTeXDownload |
| 11 | Time and Space Efficient Discovery of Maximal Geometric Graphs. Hiroki Arimura, Takeaki Uno, Shinichi Shimozono. Discovery Science 2007, 42-55. Web SearchBibTeXDownload |
| 10 | An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Takeaki Uno, Hiroki Arimura. Discovery Science 2007, 219-230. Web SearchBibTeXDownload |
| 9 | An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. Hiroki Arimura, Takeaki Uno. J. Comb. Optim. (13): 243-262 (2007). Web SearchBibTeXDownload |
| 8 | Mining Maximal Flexible Patterns in a Sequence. Hiroki Arimura, Takeaki Uno. JSAI 2007, 307-317. Web SearchBibTeXDownload |
| 2005 |
|---|
| 7 | An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. Hiroki Arimura, Takeaki Uno. ILP 2005, 1-19. Web SearchBibTeXDownload |
| 6 | A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. Hiroki Arimura, Takeaki Uno. ISAAC 2005, 724-737. Web SearchBibTeXDownload |
| 5 | Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Toshihide Ibaraki, Shinji Imahori, M. Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura. Transportation Science (39): 206-232 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 4 | An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura. Discovery Science 2004, 16-31. Web SearchBibTeXDownload |
| 3 | LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets. Takeaki Uno, Masashi Kiyomi, Hiroki Arimura. FIMI 2004. Web SearchBibTeXDownload |
| 2003 |
|---|
| 2 | Discovering Frequent Substructures in Large Unordered Trees. Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano. Discovery Science 2003, 47-61. Web SearchBibTeXDownload |
| 1 | LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura. FIMI 2003. Web SearchBibTeXDownload |
