| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou |
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano |
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno |
A Doubly Exponentially Crumbled Cake. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshio Okamoto, Takeaki Uno |
A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. |
European Journal of Operational Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno |
Algorithmic Folding Complexity. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno |
A Doubly Exponentially Crumbled Cake |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Keisuke Murakami, Takeaki Uno |
Efficient Algorithms for Dualizing Large-Scale Hypergraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno |
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Hellouin de Menibus, Takeaki Uno |
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuji Kijima, Yoshio Okamoto, Takeaki Uno |
Dominating Set Counting in Graph Classes. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno |
On listing, sampling, and counting the chordal graphs with edge constraints. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasuko Matsui, Ryuhei Uehara, Takeaki Uno |
Enumeration of the perfect sequences of a chordal graph. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno |
Improved Bounds for Wireless Localization. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data. |
Knowl. Inf. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji Tsuda |
Single versus Multiple Sorting in All Pairs Similarity Search. |
Journal of Machine Learning Research - Proceedings Track |
2010 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
The complexity of UNO |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Négrevergne, Alexandre Termier, Jean-François Méhaut, Takeaki Uno |
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses. |
HPCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Négrevergne, Jean-François Méhaut, Alexandre Termier, Takeaki Uno |
Découverte d'itemsets fréquents fermés sur architecture multicoeurs. |
EGC |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shin-ichi Minato, Takeaki Uno |
Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases. |
SDM |
2010 |
DBLP BibTeX RDF |
|
| 1 | Takanobu Nakahara, Takeaki Uno, Katsutoshi Yada |
Extracting Promising Sequential Patterns from RFID Data Using the LCM Sequence. |
KES |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
UNO Is Hard, Even for a Single Player. |
FUN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh |
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo |
Levelwise Mesh Sparsification for Shortest Path Queries. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda |
Enumeration of condition-dependent dense modules in protein interaction networks. |
Bioinformatics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno, Masashi Sugiyama, Koji Tsuda |
Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kevin Buchin, Andreas Razen, Takeaki Uno, Uli Wagner |
Transforming spanning trees: A lower bound. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. |
J. Comput. Sci. Technol. |
2009 |
DBLP DOI BibTeX RDF |
algorithmic graph theory, cograph, prefix tree, distance-hereditary graph, tree representation |
| 1 | Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno |
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroki Arimura, Takeaki Uno |
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. |
SDM |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura |
Efficient serial episode mining with minimal occurrences. |
ICUIMC |
2009 |
DBLP DOI BibTeX RDF |
closed sequences, depth-first algorithm, frequent episode mining |
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
Magic square, Matrix, Discrepancy, Digital halftoning, Latin square |
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara |
Counting the number of independent sets in chordal graphs. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data. |
PAKDD |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno, Hiroki Arimura |
Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. |
PAKDD |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno |
Improved Bounds for Wireless Localization. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno |
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasuko Matsui, Ryuhei Uehara, Takeaki Uno |
Enumeration of Perfect Sequences of Chordal Graph. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
clique tree, perfect sequence, enumeration, Chordal graph |
| 1 | Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki |
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdul Rehman Abbasi, Matthew N. Dailey, Nitin V. Afzulpurkar, Takeaki Uno |
Probabilistic Prediction of Student Affect from Hand Gestures. |
ARCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hiroki Arimura, Takeaki Uno |
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Maximal motif, Data mining, Algorithm, Delay, Polynomial time, Pattern discovery, Enumeration, Motif, Sequence mining, Closed pattern, Closed itemset |
| 1 | Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda |
Mining expression-dependent modules in the human interaction network. |
BMC Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroto Saigo, Takeaki Uno, Koji Tsuda |
Mining complex genotypic features for predicting HIV-1 drug resistance. |
Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno |
Matroid representation of clique complexes. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
algorithmic graph theory, cograph, prefix tree, distance-hereditary graph, tree representation |
| 1 | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
Efficient Algorithms for Airline Problem. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
Airline problem, approximation algorithm, completeness, efficient algorithm |
| 1 | Hiroki Arimura, Takeaki Uno |
Mining Maximal Flexible Patterns in a Sequence. |
JSAI |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir |
Weighted Substructure Mining for Image Analysis. |
CVPR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
An Efficient Algorithm for Enumerating Pseudo Cliques. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshio Okamoto, Takeaki Uno |
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroki Arimura, Takeaki Uno, Shinichi Shimozono |
Time and Space Efficient Discovery of Maximal Geometric Graphs. |
Discovery Science |
2007 |
DBLP DOI BibTeX RDF |
closed graph mining, rightmost expansion, polynomial delay polynomial space enumeration algorithms, depth-first search, geometric graphs |
| 1 | Takeaki Uno, Hiroki Arimura |
An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. |
Discovery Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdul Rehman Abbasi, Takeaki Uno, Matthew N. Dailey, Nitin V. Afzulpurkar |
Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect. |
ACII |
2007 |
DBLP DOI BibTeX RDF |
Affective tutoring, affective entertainer, situation-specific affect interpretation, facial expression analysis, gesture analysis |
| 1 | Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir |
Weighted Substructure Mining for Image Analysis. |
MLG |
2007 |
DBLP BibTeX RDF |
|
| 1 | Masashi Kiyomi, Takeaki Uno |
Generating Chordal Graphs Included in Given Graphs. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Masashi Kiyomi, Shuji Kijima, Takeaki Uno |
Listing Chordal Graphs and Interval Graphs. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken Satoh, Ken Kaneiwa, Takeaki Uno |
Contradiction Finding and Minimal Recovery for UML Class Diagrams. |
ASE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken Satoh, Takeaki Uno |
Enumerating Minimal Explanations by Minimal Hitting Set Computation. |
KSEM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff |
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. |
Graph Drawing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura |
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. |
Transportation Science |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin-Ichi Nakano, Takeaki Uno |
Generating Colored Trees. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara |
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. |
WG |
2005 |
DBLP DOI BibTeX RDF |
# P-completeness, NP-completeness, polynomial time algorithm, enumeration, independent set, Chordal graph, counting |
| 1 | Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro |
Generalized Amazons is PSPACE-Complete. |
IJCAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Masashi Kiyomi, Takeaki Uno, Tomomi Matsui |
Efficient Algorithms for the Electric Power Transaction Problem. |
WINE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken Satoh, Takeaki Uno |
Enumerating Minimally Revised Specifications Using Dualization. |
JSAI Workshops |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroki Arimura, Takeaki Uno |
An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. |
ILP |
2005 |
DBLP DOI BibTeX RDF |
frequent closed pattern mining, attribute tree, the least general generalization, description logic, semi-structured data, closure operation, tree mining, output-sensitive algorithm |
| 1 | Hiroki Arimura, Takeaki Uno |
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin-Ichi Nakano, Takeaki Uno |
Constant Time Generation of Trees with Specified Diameter. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno, Masashi Kiyomi, Hiroki Arimura |
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets |
FIMI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Kazuhisa Makino, Takeaki Uno |
New Algorithms for Enumerating All Maximal Cliques. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura |
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. |
Discovery Science |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff |
Labeling Points with Weights. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Sliding labels, GIS, Computational geometry, Combinatorial optimization, Job scheduling, Maximum weight independent set, Label placement, Throughput maximization |
| 1 | Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura |
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. |
FIMI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Takeaki Uno, Ken Satoh |
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. |
FIMI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno |
Matroid Representation of Clique Complexes. |
COCOON |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin-Ichi Nakano, Takeaki Uno |
More Efficient Generation of Plane Triangulations. |
Graph Drawing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano |
Discovering Frequent Substructures in Large Unordered Trees. |
Discovery Science |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken Satoh, Takeaki Uno |
Enumerating Maximal Frequent Sets Using Irredundant Dualization. |
Discovery Science |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
A Fast Algorithm for Enumerating Bipartite Perfect Matchings. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
enumeration, perfect matching, enumerating algorithm |
| 1 | Takeaki Uno, Mutsunori Yagiura |
Fast Algorithms to Enumerate All Common Intervals of Two Permutations. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
A New Approach for Speeding Up Enumeration Algorithms. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Akiyoshi Shioura, Takeaki Uno |
A Linear Time Algorithm for Finding a k-Tree Core. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno |
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. |
ISAAC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno |
An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. |
ISAAC |
1996 |
DBLP DOI BibTeX RDF |
directed spanning tree, listing, enumerating algorithm |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")