| 2009 |
|---|
| 60 | EE | Hideyuki Ohtani,
Takuya Kida,
Takeaki Uno,
Hiroki Arimura:
Efficient serial episode mining with minimal occurrences.
ICUIMC 2009: 457-464 |
| 59 | EE | Takeaki Uno,
Masashi Sugiyama,
Koji Tsuda:
Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method
CoRR abs/0904.3151: (2009) |
| 2008 |
|---|
| 58 | | Abdul Rehman Abbasi,
Matthew N. Dailey,
Nitin V. Afzulpurkar,
Takeaki Uno:
Probabilistic Prediction of Student Affect from Hand Gestures.
ARCS 2008: 58-63 |
| 57 | EE | Shuji Kijima,
Masashi Kiyomi,
Yoshio Okamoto,
Takeaki Uno:
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints.
COCOON 2008: 458-467 |
| 56 | EE | Takehiro Ito,
Takeaki Uno,
Xiao Zhou,
Takao Nishizeki:
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.
ISAAC 2008: 196-207 |
| 55 | EE | Yasuko Matsui,
Ryuhei Uehara,
Takeaki Uno:
Enumeration of Perfect Sequences of Chordal Graph.
ISAAC 2008: 859-870 |
| 54 | EE | Shin-ichi Minato,
Takeaki Uno,
Hiroki Arimura:
LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation.
PAKDD 2008: 234-246 |
| 53 | EE | Takeaki Uno:
An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data.
PAKDD 2008: 345-356 |
| 52 | EE | Takeaki Uno,
Hiroki Arimura:
Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration.
PAKDD 2008: 357-368 |
| 51 | EE | Tobias Christ,
Michael Hoffmann,
Yoshio Okamoto,
Takeaki Uno:
Improved Bounds for Wireless Localization.
SWAT 2008: 77-89 |
| 50 | EE | Toshihide Ibaraki,
Shinji Imahori,
Koji Nonobe,
Kensuke Sobue,
Takeaki Uno,
Mutsunori Yagiura:
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.
Discrete Applied Mathematics 156(11): 2050-2069 (2008) |
| 49 | EE | Yoshio Okamoto,
Takeaki Uno,
Ryuhei Uehara:
Counting the number of independent sets in chordal graphs.
J. Discrete Algorithms 6(2): 229-242 (2008) |
| 48 | EE | Boris Aronov,
Tetsuo Asano,
Yosuke Kikuchi,
Subhas C. Nandy,
Shinji Sasahara,
Takeaki Uno:
A Generalization of Magic Squares with Applications to Digital Halftoning.
Theory Comput. Syst. 42(2): 143-156 (2008) |
| 2007 |
|---|
| 47 | EE | Abdul Rehman Abbasi,
Takeaki Uno,
Matthew N. Dailey,
Nitin V. Afzulpurkar:
Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect.
ACII 2007: 452-463 |
| 46 | EE | Sebastian Nowozin,
Koji Tsuda,
Takeaki Uno,
Taku Kudo,
Gökhan H. Bakir:
Weighted Substructure Mining for Image Analysis.
CVPR 2007 |
| 45 | EE | Takeaki Uno,
Hiroki Arimura:
An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining.
Discovery Science 2007: 219-230 |
| 44 | EE | Hiroki Arimura,
Takeaki Uno,
Shinichi Shimozono:
Time and Space Efficient Discovery of Maximal Geometric Graphs.
Discovery Science 2007: 42-55 |
| 43 | EE | Takeaki Uno:
An Efficient Algorithm for Enumerating Pseudo Cliques.
ISAAC 2007: 402-414 |
| 42 | EE | Yoshio Okamoto,
Takeaki Uno:
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization.
ISAAC 2007: 609-620 |
| 41 | EE | Hiroki Arimura,
Takeaki Uno:
Mining Maximal Flexible Patterns in a Sequence.
JSAI 2007: 307-317 |
| 40 | EE | Sebastian Nowozin,
Koji Tsuda,
Takeaki Uno,
Taku Kudo,
Gökhan H. Bakir:
Weighted Substructure Mining for Image Analysis.
MLG 2007 |
| 39 | EE | Shin-Ichi Nakano,
Ryuhei Uehara,
Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.
TAMC 2007: 115-127 |
| 38 | EE | Shin-Ichi Nakano,
Ryuhei Uehara,
Takeaki Uno:
Efficient Algorithms for Airline Problem.
TAMC 2007: 428-439 |
| 37 | EE | Hiroto Saigo,
Takeaki Uno,
Koji Tsuda:
Mining complex genotypic features for predicting HIV-1 drug resistance.
Bioinformatics 23(18): 2455-2462 (2007) |
| 36 | EE | Kenji Kashiwabara,
Yoshio Okamoto,
Takeaki Uno:
Matroid representation of clique complexes.
Discrete Applied Mathematics 155(15): 1910-1929 (2007) |
| 35 | EE | Hiroki Arimura,
Takeaki Uno:
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence.
J. Comb. Optim. 13(3): 243-262 (2007) |
| 2006 |
|---|
| 34 | EE | Ken Satoh,
Ken Kaneiwa,
Takeaki Uno:
Contradiction Finding and Minimal Recovery for UML Class Diagrams.
ASE 2006: 277-280 |
| 33 | EE | Marc Benkert,
Martin Nöllenburg,
Takeaki Uno,
Alexander Wolff:
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps.
Graph Drawing 2006: 270-281 |
| 32 | EE | Ken Satoh,
Takeaki Uno:
Enumerating Minimal Explanations by Minimal Hitting Set Computation.
KSEM 2006: 354-365 |
| 31 | EE | Masashi Kiyomi,
Shuji Kijima,
Takeaki Uno:
Listing Chordal Graphs and Interval Graphs.
WG 2006: 68-77 |
| 30 | EE | Satoko Mamada,
Takeaki Uno,
Kazuhisa Makino,
Satoru Fujishige:
An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks.
Discrete Applied Mathematics 154(16): 2387-2401 (2006) |
| 29 | EE | Masashi Kiyomi,
Takeaki Uno:
Generating Chordal Graphs Included in Given Graphs.
IEICE Transactions 89-D(2): 763-770 (2006) |
| 2005 |
|---|
| 28 | EE | Timothy Furtak,
Masashi Kiyomi,
Takeaki Uno,
Michael Buro:
Generalized Amazons is PSPACE-Complete.
IJCAI 2005: 132-137 |
| 27 | EE | Hiroki Arimura,
Takeaki Uno:
An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.
ILP 2005: 1-19 |
| 26 | EE | Hiroki Arimura,
Takeaki Uno:
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence.
ISAAC 2005: 724-737 |
| 25 | EE | Ken Satoh,
Takeaki Uno:
Enumerating Minimally Revised Specifications Using Dualization.
JSAI Workshops 2005: 182-189 |
| 24 | EE | Shin-Ichi Nakano,
Takeaki Uno:
Generating Colored Trees.
WG 2005: 249-260 |
| 23 | EE | Yoshio Okamoto,
Takeaki Uno,
Ryuhei Uehara:
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.
WG 2005: 433-444 |
| 22 | EE | Masashi Kiyomi,
Takeaki Uno,
Tomomi Matsui:
Efficient Algorithms for the Electric Power Transaction Problem.
WINE 2005: 602-611 |
| 2004 |
|---|
| 21 | EE | Takeaki Uno,
Tatsuya Asai,
Yuzo Uchida,
Hiroki Arimura:
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases.
Discovery Science 2004: 16-31 |
| 20 | EE | Takeaki Uno,
Masashi Kiyomi,
Hiroki Arimura:
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
FIMI 2004 |
| 19 | | Satoko Mamada,
Takeaki Uno,
Kazuhisa Makino,
Satoru Fujishige:
An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks.
IFIP TCS 2004: 251-264 |
| 18 | EE | Boris Aronov,
Tetsuo Asano,
Yosuke Kikuchi,
Subhas C. Nandy,
Shinji Sasahara,
Takeaki Uno:
A Generalization of Magic Squares with Applications to Digital Halftoning.
ISAAC 2004: 89-100 |
| 17 | EE | Kazuhisa Makino,
Takeaki Uno:
New Algorithms for Enumerating All Maximal Cliques.
SWAT 2004: 260-272 |
| 16 | EE | Shin-Ichi Nakano,
Takeaki Uno:
Constant Time Generation of Trees with Specified Diameter.
WG 2004: 33-45 |
| 2003 |
|---|
| 15 | EE | Kenji Kashiwabara,
Yoshio Okamoto,
Takeaki Uno:
Matroid Representation of Clique Complexes.
COCOON 2003: 192-201 |
| 14 | EE | Ken Satoh,
Takeaki Uno:
Enumerating Maximal Frequent Sets Using Irredundant Dualization.
Discovery Science 2003: 256-268 |
| 13 | EE | Tatsuya Asai,
Hiroki Arimura,
Takeaki Uno,
Shin-Ichi Nakano:
Discovering Frequent Substructures in Large Unordered Trees.
Discovery Science 2003: 47-61 |
| 12 | EE | Takeaki Uno,
Ken Satoh:
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization.
FIMI 2003 |
| 11 | EE | Takeaki Uno,
Tatsuya Asai,
Yuzo Uchida,
Hiroki Arimura:
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.
FIMI 2003 |
| 10 | EE | Shin-Ichi Nakano,
Takeaki Uno:
More Efficient Generation of Plane Triangulations.
Graph Drawing 2003: 273-282 |
| 9 | EE | Sheung-Hung Poon,
Chan-Su Shin,
Tycho Strijk,
Takeaki Uno,
Alexander Wolff:
Labeling Points with Weights.
Algorithmica 38(2): 341-362 (2003) |
| 2001 |
|---|
| 8 | EE | Takeaki Uno:
A Fast Algorithm for Enumerating Bipartite Perfect Matchings.
ISAAC 2001: 367-379 |
| 2000 |
|---|
| 7 | EE | Takeaki Uno,
Mutsunori Yagiura:
Fast Algorithms to Enumerate All Common Intervals of Two Permutations.
Algorithmica 26(2): 290-309 (2000) |
| 1999 |
|---|
| 6 | EE | Takeaki Uno:
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases.
COCOON 1999: 349-359 |
| 1998 |
|---|
| 5 | EE | Takeaki Uno:
A New Approach for Speeding Up Enumeration Algorithms.
ISAAC 1998: 287-296 |
| 1997 |
|---|
| 4 | | Takeaki Uno:
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs.
ISAAC 1997: 92-101 |
| 3 | | Akiyoshi Shioura,
Takeaki Uno:
A Linear Time Algorithm for Finding a k-Tree Core.
J. Algorithms 23(2): 281-290 (1997) |
| 2 | | Akiyoshi Shioura,
Akihisa Tamura,
Takeaki Uno:
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.
SIAM J. Comput. 26(3): 678-692 (1997) |
| 1996 |
|---|
| 1 | | Takeaki Uno:
An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph.
ISAAC 1996: 166-173 |
