dblp.uni-trier.dewww.uni-trier.de

Takeaki Uno Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
65EEHideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura: Efficient serial episode mining with minimal occurrences. ICUIMC 2009: 457-464
64EEHiroki Arimura, Takeaki Uno: Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. SDM 2009: 1087-1098
63EEElisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda: Enumeration of condition-dependent dense modules in protein interaction networks. Bioinformatics 25(7): 933-940 (2009)
62EETakeaki Uno, Masashi Sugiyama, Koji Tsuda: Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method CoRR abs/0904.3151: (2009)
61EEShin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. 24(3): 517-533 (2009)
2008
60 Abdul Rehman Abbasi, Matthew N. Dailey, Nitin V. Afzulpurkar, Takeaki Uno: Probabilistic Prediction of Student Affect from Hand Gestures. ARCS 2008: 58-63
59EEShuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467
58EETakehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki: Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC 2008: 196-207
57EEYasuko Matsui, Ryuhei Uehara, Takeaki Uno: Enumeration of Perfect Sequences of Chordal Graph. ISAAC 2008: 859-870
56EEShin-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
55EETakeaki Uno: An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data. PAKDD 2008: 345-356
54EETakeaki Uno, Hiroki Arimura: Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD 2008: 357-368
53EETobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. SWAT 2008: 77-89
52EEToshihide 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)
51EEYoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2): 229-242 (2008)
50EEBoris 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
49EEAbdul Rehman Abbasi, Takeaki Uno, Matthew N. Dailey, Nitin V. Afzulpurkar: Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect. ACII 2007: 452-463
48EESebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir: Weighted Substructure Mining for Image Analysis. CVPR 2007
47EETakeaki Uno, Hiroki Arimura: An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science 2007: 219-230
46EEHiroki Arimura, Takeaki Uno, Shinichi Shimozono: Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science 2007: 42-55
45EETakeaki Uno: An Efficient Algorithm for Enumerating Pseudo Cliques. ISAAC 2007: 402-414
44EEYoshio Okamoto, Takeaki Uno: A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ISAAC 2007: 609-620
43EEHiroki Arimura, Takeaki Uno: Mining Maximal Flexible Patterns in a Sequence. JSAI 2007: 307-317
42EESebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir: Weighted Substructure Mining for Image Analysis. MLG 2007
41EEShin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC 2007: 115-127
40EEShin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: Efficient Algorithms for Airline Problem. TAMC 2007: 428-439
39EEElisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda: Mining expression-dependent modules in the human interaction network. BMC Bioinformatics 8(S-8): (2007)
38EEHiroto Saigo, Takeaki Uno, Koji Tsuda: Mining complex genotypic features for predicting HIV-1 drug resistance. Bioinformatics 23(18): 2455-2462 (2007)
37EEKenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid representation of clique complexes. Discrete Applied Mathematics 155(15): 1910-1929 (2007)
36EEHiroki 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
35EEKen Satoh, Ken Kaneiwa, Takeaki Uno: Contradiction Finding and Minimal Recovery for UML Class Diagrams. ASE 2006: 277-280
34EEMarc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff: Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. Graph Drawing 2006: 270-281
33EEKen Satoh, Takeaki Uno: Enumerating Minimal Explanations by Minimal Hitting Set Computation. KSEM 2006: 354-365
32EEMasashi Kiyomi, Shuji Kijima, Takeaki Uno: Listing Chordal Graphs and Interval Graphs. WG 2006: 68-77
31EESatoko 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)
30EEMasashi Kiyomi, Takeaki Uno: Generating Chordal Graphs Included in Given Graphs. IEICE Transactions 89-D(2): 763-770 (2006)
2005
29EETimothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro: Generalized Amazons is PSPACE-Complete. IJCAI 2005: 132-137
28EEHiroki Arimura, Takeaki Uno: An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP 2005: 1-19
27EEHiroki Arimura, Takeaki Uno: A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC 2005: 724-737
26EEKen Satoh, Takeaki Uno: Enumerating Minimally Revised Specifications Using Dualization. JSAI Workshops 2005: 182-189
25EEShin-Ichi Nakano, Takeaki Uno: Generating Colored Trees. WG 2005: 249-260
24EEYoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444
23EEMasashi Kiyomi, Takeaki Uno, Tomomi Matsui: Efficient Algorithms for the Electric Power Transaction Problem. WINE 2005: 602-611
22EEToshihide Ibaraki, Shinji Imahori, M. Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura: Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Transportation Science 39(2): 206-232 (2005)
2004
21EETakeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura: An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Discovery Science 2004: 16-31
20EETakeaki 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
18EEBoris 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
17EEKazuhisa Makino, Takeaki Uno: New Algorithms for Enumerating All Maximal Cliques. SWAT 2004: 260-272
16EEShin-Ichi Nakano, Takeaki Uno: Constant Time Generation of Trees with Specified Diameter. WG 2004: 33-45
2003
15EEKenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid Representation of Clique Complexes. COCOON 2003: 192-201
14EEKen Satoh, Takeaki Uno: Enumerating Maximal Frequent Sets Using Irredundant Dualization. Discovery Science 2003: 256-268
13EETatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano: Discovering Frequent Substructures in Large Unordered Trees. Discovery Science 2003: 47-61
12EETakeaki Uno, Ken Satoh: Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. FIMI 2003
11EETakeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura: LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI 2003
10EEShin-Ichi Nakano, Takeaki Uno: More Efficient Generation of Plane Triangulations. Graph Drawing 2003: 273-282
9EESheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff: Labeling Points with Weights. Algorithmica 38(2): 341-362 (2003)
2001
8EETakeaki Uno: A Fast Algorithm for Enumerating Bipartite Perfect Matchings. ISAAC 2001: 367-379
2000
7EETakeaki Uno, Mutsunori Yagiura: Fast Algorithms to Enumerate All Common Intervals of Two Permutations. Algorithmica 26(2): 290-309 (2000)
1999
6EETakeaki Uno: A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. COCOON 1999: 349-359
1998
5EETakeaki Uno: A New Approach for Speeding Up Enumeration Algorithms. ISAAC 1998: 287-296
1997
4EETakeaki 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
1EETakeaki Uno: An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. ISAAC 1996: 166-173

Coauthor Index

1Abdul Rehman Abbasi [49] [60]
2Nitin V. Afzulpurkar [49] [60]
3Hiroki Arimura [11] [13] [20] [21] [27] [28] [36] [43] [46] [47] [54] [56] [64] [65]
4Boris Aronov [18] [50]
5Tatsuya Asai [11] [13] [21]
6Tetsuo Asano [18] [50]
7Gökhan H. Bakir [42] [48]
8Marc Benkert [34]
9Michael Buro [29]
10Tobias Christ [53]
11Matthew N. Dailey [49] [60]
12Sabine Dietmann [39] [63]
13Satoru Fujishige [19] [31]
14Timothy Furtak [29]
15Elisabeth Georgii [39] [63]
16Michael Hoffmann [53]
17Toshihide Ibaraki [22] [52]
18Shinji Imahori [22] [52]
19Takehiro Ito [58]
20Ken Kaneiwa [35]
21Kenji Kashiwabara [15] [37]
22Takuya Kida [65]
23Shuji Kijima [32] [59]
24Yosuke Kikuchi [18] [50]
25Masashi Kiyomi [20] [23] [29] [30] [32] [59]
26M. Kubo [22]
27Taku Kudo [42] [48]
28Kazuhisa Makino [17] [19] [31]
29Satoko Mamada [19] [31]
30T. Masuda [22]
31Tomomi Matsui [23]
32Yasuko Matsui [57]
33Shin-ichi Minato [56]
34Shin-Ichi Nakano [10] [13] [16] [25] [40] [41] [61]
35Subhas C. Nandy [18] [50]
36Takao Nishizeki [58]
37Martin Nöllenburg [34]
38Koji Nonobe [52]
39Sebastian Nowozin [42] [48]
40Hideyuki Ohtani [65]
41Yoshio Okamoto [15] [24] [37] [44] [51] [53] [59]
42Philipp Pagel [39] [63]
43Sheung-Hung Poon [9]
44Hiroto Saigo [38]
45Shinji Sasahara [18] [50]
46Ken Satoh [12] [14] [26] [33] [35]
47Shinichi Shimozono [46]
48Chan-Su Shin [9]
49Akiyoshi Shioura [2] [3]
50Kensuke Sobue [52]
51Tycho Strijk [9]
52Masashi Sugiyama [62]
53Akihisa Tamura [2]
54Koji Tsuda [38] [39] [42] [48] [62] [63]
55Yuzo Uchida [11] [21]
56Ryuhei Uehara [24] [40] [41] [51] [57] [61]
57Alexander Wolff [9] [34]
58Mutsunori Yagiura [7] [22] [52]
59Xiao Zhou [58]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)