The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Takeaki Uno: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Takeaki Uno
    A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:349-359 [Conf]
  2. Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
    Matroid Representation of Clique Complexes. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:192-201 [Conf]
  3. Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano
    Discovering Frequent Substructures in Large Unordered Trees. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:47-61 [Conf]
  4. Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura
    An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2004, pp:16-31 [Conf]
  5. Ken Satoh, Takeaki Uno
    Enumerating Maximal Frequent Sets Using Irredundant Dualization. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:256-268 [Conf]
  6. Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura
    LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. [Citation Graph (0, 0)][DBLP]
    FIMI, 2003, pp:- [Conf]
  7. Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
    LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets [Citation Graph (0, 0)][DBLP]
    FIMI, 2004, pp:- [Conf]
  8. Takeaki Uno, Ken Satoh
    Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. [Citation Graph (0, 0)][DBLP]
    FIMI, 2003, pp:- [Conf]
  9. Shin-Ichi Nakano, Takeaki Uno
    More Efficient Generation of Plane Triangulations. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:273-282 [Conf]
  10. Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff
    Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:270-281 [Conf]
  11. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
    An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:251-264 [Conf]
  12. Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro
    Generalized Amazons is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:132-137 [Conf]
  13. Hiroki Arimura, Takeaki Uno
    An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. [Citation Graph (0, 0)][DBLP]
    ILP, 2005, pp:1-19 [Conf]
  14. Hiroki Arimura, Takeaki Uno
    A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:724-737 [Conf]
  15. Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
    A Generalization of Magic Squares with Applications to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:89-100 [Conf]
  16. Takeaki Uno
    A Fast Algorithm for Enumerating Bipartite Perfect Matchings. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:367-379 [Conf]
  17. Takeaki Uno
    An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:166-173 [Conf]
  18. Takeaki Uno
    Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:92-101 [Conf]
  19. Takeaki Uno
    A New Approach for Speeding Up Enumeration Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:287-296 [Conf]
  20. Ken Satoh, Takeaki Uno
    Enumerating Minimally Revised Specifications Using Dualization. [Citation Graph (0, 0)][DBLP]
    JSAI Workshops, 2005, pp:182-189 [Conf]
  21. Ken Satoh, Ken Kaneiwa, Takeaki Uno
    Contradiction Finding and Minimal Recovery for UML Class Diagrams. [Citation Graph (0, 0)][DBLP]
    ASE, 2006, pp:277-280 [Conf]
  22. Ken Satoh, Takeaki Uno
    Enumerating Minimal Explanations by Minimal Hitting Set Computation. [Citation Graph (0, 0)][DBLP]
    KSEM, 2006, pp:354-365 [Conf]
  23. Kazuhisa Makino, Takeaki Uno
    New Algorithms for Enumerating All Maximal Cliques. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:260-272 [Conf]
  24. Masashi Kiyomi, Shuji Kijima, Takeaki Uno
    Listing Chordal Graphs and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:68-77 [Conf]
  25. Shin-Ichi Nakano, Takeaki Uno
    Constant Time Generation of Trees with Specified Diameter. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:33-45 [Conf]
  26. Shin-Ichi Nakano, Takeaki Uno
    Generating Colored Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:249-260 [Conf]
  27. Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
    Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:433-444 [Conf]
  28. Masashi Kiyomi, Takeaki Uno, Tomomi Matsui
    Efficient Algorithms for the Electric Power Transaction Problem. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:602-611 [Conf]
  29. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff
    Labeling Points with Weights. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:341-362 [Journal]
  30. Takeaki Uno, Mutsunori Yagiura
    Fast Algorithms to Enumerate All Common Intervals of Two Permutations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:2, pp:290-309 [Journal]
  31. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
    An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2387-2401 [Journal]
  32. Akiyoshi Shioura, Takeaki Uno
    A Linear Time Algorithm for Finding a k-Tree Core. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:281-290 [Journal]
  33. Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno
    An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:678-692 [Journal]
  34. Abdul Rehman Abbasi, Takeaki Uno, Matthew N. Dailey, Nitin V. Afzulpurkar
    Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect. [Citation Graph (0, 0)][DBLP]
    ACII, 2007, pp:452-463 [Conf]
  35. Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir
    Weighted Substructure Mining for Image Analysis. [Citation Graph (0, 0)][DBLP]
    CVPR, 2007, pp:- [Conf]
  36. Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
    Time and Space Efficient Discovery of Maximal Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2007, pp:42-55 [Conf]
  37. Takeaki Uno, Hiroki Arimura
    An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2007, pp:219-230 [Conf]
  38. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
    A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:115-127 [Conf]
  39. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
    Efficient Algorithms for Airline Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:428-439 [Conf]
  40. Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
    Matroid representation of clique complexes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:15, pp:1910-1929 [Journal]
  41. Hiroki Arimura, Takeaki Uno
    An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:3, pp:243-262 [Journal]

  42. On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. [Citation Graph (, )][DBLP]


  43. Finding Maximum Edge Bicliques in Convex Bipartite Graphs. [Citation Graph (, )][DBLP]


  44. Découverte d'itemsets fréquents fermés sur architecture multicoeurs. [Citation Graph (, )][DBLP]


  45. An Efficient Algorithm for Enumerating Pseudo Cliques. [Citation Graph (, )][DBLP]


  46. Enumeration of Perfect Sequences of Chordal Graph. [Citation Graph (, )][DBLP]


  47. A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. [Citation Graph (, )][DBLP]


  48. Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. [Citation Graph (, )][DBLP]


  49. Mining Maximal Flexible Patterns in a Sequence. [Citation Graph (, )][DBLP]


  50. An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data. [Citation Graph (, )][DBLP]


  51. LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. [Citation Graph (, )][DBLP]


  52. Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. [Citation Graph (, )][DBLP]


  53. Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. [Citation Graph (, )][DBLP]


  54. Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases. [Citation Graph (, )][DBLP]


  55. Improved Bounds for Wireless Localization. [Citation Graph (, )][DBLP]


  56. Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. [Citation Graph (, )][DBLP]


  57. UNO Is Hard, Even for a Single Player. [Citation Graph (, )][DBLP]


  58. Weighted Substructure Mining for Image Analysis. [Citation Graph (, )][DBLP]


  59. Efficient serial episode mining with minimal occurrences. [Citation Graph (, )][DBLP]


  60. Probabilistic Prediction of Student Affect from Hand Gestures. [Citation Graph (, )][DBLP]


  61. Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses. [Citation Graph (, )][DBLP]


  62. An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem. [Citation Graph (, )][DBLP]


  63. Mining complex genotypic features for predicting HIV-1 drug resistance. [Citation Graph (, )][DBLP]


  64. Enumeration of condition-dependent dense modules in protein interaction networks. [Citation Graph (, )][DBLP]


  65. Mining expression-dependent modules in the human interaction network. [Citation Graph (, )][DBLP]


  66. Transforming spanning trees: A lower bound. [Citation Graph (, )][DBLP]


  67. Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method [Citation Graph (, )][DBLP]


  68. The complexity of UNO [Citation Graph (, )][DBLP]


  69. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.451secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002