Takeaki Uno

Keisuke Murakami, Takeaki Uno: Efficient algorithms for dualizing large-scale hypergraphs. ALENEX 2013: 1-13

Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno: Base Location Problems for Base-Monotone Regions. WALCOM 2013: 53-64

Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou: Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Algorithmica 62(3-4): 823-841 (2012)

Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh: Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica 64(2): 311-325 (2012)

Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno: Subgraph isomorphism in graph classes. Discrete Mathematics 312(21): 3164-3173 (2012)

Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura: Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. COCOON 2012: 347-359

Akira Suzuki, Kei Uchizawa, Takeaki Uno: Hitori Number. FUN 2012: 334-345

Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno: A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381

Takeaki Uno: Efficient Computation of Power Indices for Weighted Majority Games. ISAAC 2012: 679-689

Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno: A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT 2012: 24-35

Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano: Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. WALCOM 2012: 5-16

Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno: On Complexity of Flooding Games on Graphs with Interval Representations. CoRR abs/1206.6201 (2012)

Takeaki Uno, Yushi Uno: Mining Preserving Structures in a Graph Sequence. CoRR abs/1206.6202 (2012)

Franz J. Király, Louis Theran, Ryota Tomioka, Takeaki Uno: The Algebraic Combinatorial Approach for Low-Rank Matrix Completion. CoRR abs/1211.4116 (2012)

Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno: A Doubly Exponentially Crumbled Cake. Electronic Notes in Discrete Mathematics 38: 265-271 (2011)

Yoshio Okamoto, Takeaki Uno: A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. European Journal of Operational Research 210(1): 48-56 (2011)

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 27(3): 341-351 (2011)

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. 15(6): 727-751 (2011)

Shuji Kijima, Yoshio Okamoto, Takeaki Uno: Dominating Set Counting in Graph Classes. COCOON 2011: 13-24

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462

Benjamin Hellouin de Menibus, Takeaki Uno: Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. TAMC 2011: 483-494

Keisuke Murakami, Takeaki Uno: Efficient Algorithms for Dualizing Large-Scale Hypergraphs. CoRR abs/1102.3813 (2011)

Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno: A Doubly Exponentially Crumbled Cake. CoRR abs/1104.0122 (2011)

Takeaki Uno: An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem. Algorithmica 56(1): 3-16 (2010)

Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. Algorithmica 57(3): 499-516 (2010)

Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji Tsuda: Single versus Multiple Sorting in All Pairs Similarity Search. Journal of Machine Learning Research - Proceedings Track 13: 145-160 (2010)

Takeaki Uno: Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data. Knowl. Inf. Syst. 25(2): 229-251 (2010)

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. 411(26-28): 2591-2601 (2010)

Yasuko Matsui, Ryuhei Uehara, Takeaki Uno: Enumeration of the perfect sequences of a chordal graph. Theor. Comput. Sci. 411(40-42): 3635-3641 (2010)

Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh: Finding Maximum Edge Bicliques in Convex Bipartite Graphs. COCOON 2010: 140-149

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: 465-470

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: UNO Is Hard, Even for a Single Player. FUN 2010: 133-144

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: 521-528

Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo: Levelwise Mesh Sparsification for Shortest Path Queries. ISAAC (1) 2010: 121-132

Takanobu Nakahara, Takeaki Uno, Katsutoshi Yada: Extracting Promising Sequential Patterns from RFID Data Using the LCM Sequence. KES (3) 2010: 244-253

Shin-ichi Minato, Takeaki Uno: Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases. SDM 2010: 339-349

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: The complexity of UNO. CoRR abs/1003.2851 (2010)

Elisabeth 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)

Kevin Buchin, Andreas Razen, Takeaki Uno, Uli Wagner: Transforming spanning trees: A lower bound. Comput. Geom. 42(8): 724-730 (2009)

Shin-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)

Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura: Efficient serial episode mining with minimal occurrences. ICUIMC 2009: 457-464

Hiroki Arimura, Takeaki Uno: Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. SDM 2009: 1087-1098

Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG 2009: 296-307

Takeaki Uno, Masashi Sugiyama, Koji Tsuda: Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method. CoRR abs/0904.3151 (2009)

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)

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2): 229-242 (2008)

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)

Abdul Rehman Abbasi, Matthew N. Dailey, Nitin V. Afzulpurkar, Takeaki Uno: Probabilistic Prediction of Student Affect from Hand Gestures. ARCS 2008: 58-63

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467

Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki: Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC 2008: 196-207

Yasuko Matsui, Ryuhei Uehara, Takeaki Uno: Enumeration of Perfect Sequences of Chordal Graph. ISAAC 2008: 859-870

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

Takeaki Uno: An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data. PAKDD 2008: 345-356

Takeaki Uno, Hiroki Arimura: Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD 2008: 357-368

Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. SWAT 2008: 77-89

Hiroto Saigo, Takeaki Uno, Koji Tsuda: Mining complex genotypic features for predicting HIV-1 drug resistance. Bioinformatics 23(18): 2455-2462 (2007)

Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda: Mining expression-dependent modules in the human interaction network. BMC Bioinformatics 8(S-8) (2007)

Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid representation of clique complexes. Discrete Applied Mathematics 155(15): 1910-1929 (2007)

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)

Abdul Rehman Abbasi, Takeaki Uno, Matthew N. Dailey, Nitin V. Afzulpurkar: Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect. ACII 2007: 452-463

Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir: Weighted Substructure Mining for Image Analysis. CVPR 2007

Hiroki Arimura, Takeaki Uno, Shinichi Shimozono: Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science 2007: 42-55

Takeaki Uno, Hiroki Arimura: An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science 2007: 219-230

Takeaki Uno: An Efficient Algorithm for Enumerating Pseudo Cliques. ISAAC 2007: 402-414

Yoshio Okamoto, Takeaki Uno: A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ISAAC 2007: 609-620

Hiroki Arimura, Takeaki Uno: Mining Maximal Flexible Patterns in a Sequence. JSAI 2007: 307-317

Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir: Weighted Substructure Mining for Image Analysis. MLG 2007

Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC 2007: 115-127

Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: Efficient Algorithms for Airline Problem. TAMC 2007: 428-439

Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige: An O(n log²n) algorithm for the optimal sink location problem in dynamic tree networks. Discrete Applied Mathematics 154(16): 2387-2401 (2006)

Masashi Kiyomi, Takeaki Uno: Generating Chordal Graphs Included in Given Graphs. IEICE Transactions 89-D(2): 763-770 (2006)

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

Ken Satoh, Ken Kaneiwa, Takeaki Uno: Contradiction Finding and Minimal Recovery for UML Class Diagrams. ASE 2006: 277-280

Ken Satoh, Takeaki Uno: Enumerating Minimal Explanations by Minimal Hitting Set Computation. KSEM 2006: 354-365

Masashi Kiyomi, Shuji Kijima, Takeaki Uno: Listing Chordal Graphs and Interval Graphs. WG 2006: 68-77

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 39(2): 206-232 (2005)

Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro: Generalized Amazons is PSPACE-Complete. IJCAI 2005: 132-137

Hiroki Arimura, Takeaki Uno: An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP 2005: 1-19

Hiroki Arimura, Takeaki Uno: A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC 2005: 724-737

Ken Satoh, Takeaki Uno: Enumerating Minimally Revised Specifications Using Dualization. JSAI Workshops 2005: 182-189

Shin-Ichi Nakano, Takeaki Uno: Generating Colored Trees. WG 2005: 249-260

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444

Masashi Kiyomi, Takeaki Uno, Tomomi Matsui: Efficient Algorithms for the Electric Power Transaction Problem. WINE 2005: 602-611

Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura: An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Discovery Science 2004: 16-31

Takeaki Uno, Masashi Kiyomi, Hiroki Arimura: LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets. FIMI 2004

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

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

Kazuhisa Makino, Takeaki Uno: New Algorithms for Enumerating All Maximal Cliques. SWAT 2004: 260-272

Shin-Ichi Nakano, Takeaki Uno: Constant Time Generation of Trees with Specified Diameter. WG 2004: 33-45

Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff: Labeling Points with Weights. Algorithmica 38(2): 341-362 (2003)

Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid Representation of Clique Complexes. COCOON 2003: 192-201

Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano: Discovering Frequent Substructures in Large Unordered Trees. Discovery Science 2003: 47-61

Ken Satoh, Takeaki Uno: Enumerating Maximal Frequent Sets Using Irredundant Dualization. Discovery Science 2003: 256-268

Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura: LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI 2003

Takeaki Uno, Ken Satoh: Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. FIMI 2003

Shin-Ichi Nakano, Takeaki Uno: More Efficient Generation of Plane Triangulations. Graph Drawing 2003: 273-282

Takeaki Uno: A Fast Algorithm for Enumerating Bipartite Perfect Matchings. ISAAC 2001: 367-379

Takeaki Uno, Mutsunori Yagiura: Fast Algorithms to Enumerate All Common Intervals of Two Permutations. Algorithmica 26(2): 290-309 (2000)

Takeaki Uno: A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. COCOON 1999: 349-359

Takeaki Uno: A New Approach for Speeding Up Enumeration Algorithms. ISAAC 1998: 287-296

Akiyoshi Shioura, Takeaki Uno: A Linear Time Algorithm for Finding a k-Tree Core. J. Algorithms 23(2): 281-290 (1997)

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)

Takeaki Uno: Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. ISAAC 1997: 92-101

Takeaki Uno: An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. ISAAC 1996: 166-173