An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. - Takeaki Uno (ISAAC, 1996)

Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. - Takeaki Uno (ISAAC, 1997)

A Linear Time Algorithm for Finding a k-Tree Core. - Akiyoshi Shioura; Takeaki Uno (J. Algorithms, 1997)

An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. - Akiyoshi Shioura; Akihisa Tamura; Takeaki Uno (SIAM J. Comput., 1997)

A New Approach for Speeding Up Enumeration Algorithms. - Takeaki Uno (ISAAC, 1998)

A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. - Takeaki Uno (COCOON, 1999)

Fast Algorithms to Enumerate All Common Intervals of Two Permutations. - Takeaki Uno; Mutsunori Yagiura (Algorithmica, 2000)

A Fast Algorithm for Enumerating Bipartite Perfect Matchings. - Takeaki Uno (ISAAC, 2001)

Discovering Frequent Substructures in Large Unordered Trees. - Tatsuya Asai; Hiroki Arimura; Takeaki Uno; Shin-Ichi Nakano (Discovery Science, 2003)

Enumerating Maximal Frequent Sets Using Irredundant Dualization. - Ken Satoh; Takeaki Uno (Discovery Science, 2003)

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

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

More Efficient Generation of Plane Triangulations. - Shin-Ichi Nakano; Takeaki Uno (GD, 2003)

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

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

An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. - Satoko Mamada; Takeaki Uno; Kazuhisa Makino; Satoru Fujishige (IFIP TCS, 2004)

New Algorithms for Enumerating All Maximal Cliques. - Kazuhisa Makino; Takeaki Uno (SWAT, 2004)

Constant Time Generation of Trees with Specified Diameter. - Shin-Ichi Nakano; Takeaki Uno (WG, 2004)

Labeling Points with Weights. - Sheung-Hung Poon; Chan-Su Shin; Tycho Strijk; Takeaki Uno; Alexander Wolff 001 (Algorithmica, 2004)

Generalized Amazons is PSPACE-Complete. - Timothy Furtak; Masashi Kiyomi; Takeaki Uno; Michael Buro (IJCAI, 2005)

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. - Hiroki Arimura; Takeaki Uno (ILP, 2005)

A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. - Hiroki Arimura; Takeaki Uno (ISAAC, 2005)

Enumerating Minimally Revised Specifications Using Dualization. - Ken Satoh; Takeaki Uno (JSAI Workshops, 2005)

Generating Colored Trees. - Shin-Ichi Nakano; Takeaki Uno (WG, 2005)

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. - Yoshio Okamoto; Takeaki Uno; Ryuhei Uehara (WG, 2005)

Efficient Algorithms for the Electric Power Transaction Problem. - Masashi Kiyomi; Takeaki Uno; Tomomi Matsui (WINE, 2005)

Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. - Toshihide Ibaraki; Shinji Imahori; Mikio Kubo; T. Masuda; Takeaki Uno; Mutsunori Yagiura (Transp. Sci., 2005)

Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. - Marc Benkert; Martin Nöllenburg; Takeaki Uno; Alexander Wolff 001 (GD, 2006)

Contradiction Finding and Minimal Recovery for UML Class Diagrams. - Ken Satoh; Ken Kaneiwa; Takeaki Uno (ASE, 2006)

Enumerating Minimal Explanations by Minimal Hitting Set Computation. - Ken Satoh; Takeaki Uno (KSEM, 2006)

Listing Chordal Graphs and Interval Graphs. - Masashi Kiyomi; Shuji Kijima; Takeaki Uno (WG, 2006)

An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. - Satoko Mamada; Takeaki Uno; Kazuhisa Makino; Satoru Fujishige (Discret. Appl. Math., 2006)

Generating Chordal Graphs Included in Given Graphs. - Masashi Kiyomi; Takeaki Uno (IEICE Trans. Inf. Syst., 2006)

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

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

Time and Space Efficient Discovery of Maximal Geometric Graphs. - Hiroki Arimura; Takeaki Uno; Shinichi Shimozono (Discovery Science, 2007)

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. - Takeaki Uno; Hiroki Arimura (Discovery Science, 2007)

An Efficient Algorithm for Enumerating Pseudo Cliques. - Takeaki Uno (ISAAC, 2007)

Mining Maximal Flexible Patterns in a Sequence. - Hiroki Arimura; Takeaki Uno (JSAI, 2007)

Efficient Algorithms for Airline Problem. - Shin-Ichi Nakano; Ryuhei Uehara; Takeaki Uno (TAMC, 2007)

Mining complex genotypic features for predicting HIV-1 drug resistance. - Hiroto Saigo; Takeaki Uno; Koji Tsuda (Bioinform., 2007)

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

Matroid representation of clique complexes. - Kenji Kashiwabara; Yoshio Okamoto; Takeaki Uno (Discret. Appl. Math., 2007)

Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information. - Shungo Koichi; Satoru Iwata 001; Takeaki Uno; Hiroyuki Koshino; Hiroko Satoh (J. Chem. Inf. Model., 2007)

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. - Hiroki Arimura; Takeaki Uno (J. Comb. Optim., 2007)

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

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. - Takehiro Ito; Takeaki Uno; Xiao Zhou 001; Takao Nishizeki (ISAAC, 2008)

LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. - Shin-ichi Minato; Takeaki Uno; Hiroki Arimura (PAKDD, 2008)

An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data. - Takeaki Uno (PAKDD, 2008)

Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. - Takeaki Uno; Hiroki Arimura (PAKDD, 2008)

An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. - Toshihide Ibaraki; Shinji Imahori; Koji Nonobe; Kensuke Sobue; Takeaki Uno; Mutsunori Yagiura (Discret. Appl. Math., 2008)

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

A Generalization of Magic Squares with Applications to Digital Halftoning. - Boris Aronov; Tetsuo Asano; Yosuke Kikuchi; Subhas C. Nandy; Shinji Sasahara; Takeaki Uno (Theory Comput. Syst., 2008)

Efficient serial episode mining with minimal occurrences. - Hideyuki Ohtani; Takuya Kida; Takeaki Uno; Hiroki Arimura (ICUIMC, 2009)

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

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. - Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno (WG, 2009)

Enumeration of condition-dependent dense modules in protein interaction networks. - Elisabeth Georgii; Sabine Dietmann; Takeaki Uno; Philipp Pagel; Koji Tsuda (Bioinform., 2009)

Transforming spanning trees: A lower bound. - Kevin Buchin; Andreas Razen; Takeaki Uno; Uli Wagner 001 (Comput. Geom., 2009)

Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method - Takeaki Uno; Masashi Sugiyama; Koji Tsuda (CoRR, 2009)

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. - Shin-Ichi Nakano; Ryuhei Uehara; Takeaki Uno (J. Comput. Sci. Technol., 2009)

Découverte d'itemsets fréquents fermés sur architecture multicoeurs. - Benjamin Négrevergne; Jean-François Méhaut; Alexandre Termier; Takeaki Uno (EGC, 2010)

UNO Is Hard, Even for a Single Player. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Takeaki Uno; Yushi Uno (FUN, 2010)

Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses. - Benjamin Négrevergne; Alexandre Termier; Jean-François Méhaut; Takeaki Uno (HPCS, 2010)

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

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

Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases. - Shin-ichi Minato; Takeaki Uno (SDM, 2010)

Improved Bounds for Wireless Localization. - Tobias Christ; Michael Hoffmann 001; Yoshio Okamoto; Takeaki Uno (Algorithmica, 2010)

An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem. - Takeaki Uno (Algorithmica, 2010)

The complexity of UNO - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Takeaki Uno; Yushi Uno (CoRR, 2010)

Single versus Multiple Sorting in All Pairs Similarity Search. - Yasuo Tabei; Takeaki Uno; Masashi Sugiyama; Koji Tsuda (ACML, 2010)

Student mental state inference from unintentional body gestures using dynamic Bayesian networks. - Abdul Rehman Abbasi; Matthew N. Dailey; Nitin V. Afzulpurkar; Takeaki Uno (J. Multimodal User Interfaces, 2010)

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

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

Enumeration of the perfect sequences of a chordal graph. - Yasuko Matsui; Ryuhei Uehara; Takeaki Uno (Theor. Comput. Sci., 2010)

Dominating Set Counting in Graph Classes. - Shuji Kijima; Yoshio Okamoto; Takeaki Uno (COCOON, 2011)

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

A Doubly Exponentially Crumbled Cake. - Tobias Christ; Andrea Francke; Heidi Gebauer; Jirí Matousek 001; Takeaki Uno (Electron. Notes Discret. Math., 2011)

A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. - Yoshio Okamoto; Takeaki Uno (Eur. J. Oper. Res., 2011)

Algorithmic Folding Complexity. - Jean Cardinal; Erik D. Demaine; Martin L. Demaine; Shinji Imahori; Tsuyoshi Ito; Masashi Kiyomi; Stefan Langerman; Ryuhei Uehara; Takeaki Uno (Graphs Comb., 2011)

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

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

Hitori Number. - Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (FUN, 2012)

Pattern Mining from Trajectory GPS Data. - Xiaoliang Geng; Hiroki Arimura; Takeaki Uno (IIAI-AAI, 2012)

Efficient Computation of Power Indices for Weighted Majority Games. - Takeaki Uno (ISAAC, 2012)

On Complexity of Flooding Games on Graphs with Interval Representations. - Hiroyuki Fukui; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (TJJCCGG, 2012)

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. - Takehiro Ito; Takao Nishizeki; Michael Schröder 001; Takeaki Uno; Xiao Zhou 001 (Algorithmica, 2012)

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

On Complexity of Flooding Games on Graphs with Interval Representations - Hiroyuki Fukui; Ryuhei Uehara; Takeaki Uno; Yushi Uno (CoRR, 2012)

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

Subgraph isomorphism in graph classes. - Shuji Kijima; Yota Otachi; Toshiki Saitoh; Takeaki Uno (Discret. Math., 2012)

Mining-based compression approach of propositional formulae. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi; Takeaki Uno (CIKM, 2013)

A New Approach to String Pattern Mining with Approximate Match. - Tetsushi Matsui; Takeaki Uno; Juzoh Umemori; Tsuyoshi Koide (Discovery Science, 2013)

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. - Kunihiro Wasa; Takeaki Uno; Kouichi Hirata; Hiroki Arimura (Discovery Science, 2013)

Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. - Xiaoliang Geng; Takeaki Uno; Hiroki Arimura (KDIR/KMIS, 2013)

On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine; Takeaki Uno (ISAAC, 2013)

Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. - Kunihiro Wasa; Kouichi Hirata; Takeaki Uno; Hiroki Arimura (SISAP, 2013)

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

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. - Takeaki Uno; Ryuhei Uehara; Shin-Ichi Nakano (Discret. Math. Algorithms Appl., 2013)

Efficient algorithms for a simple network design problem. - Shin-Ichi Nakano; Ryuhei Uehara; Takeaki Uno (Networks, 2013)

An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. - Takeaki Uno; Hiroko Satoh (Discovery Science, 2014)

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. - Takashi Horiyama; Masashi Kiyomi; Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno; Yushi Uno; Yukiko Yamauchi (FUN, 2014)

Enumeration of complete set of flock patterns in trajectories. - Xiaoliang Geng; Takuya Takagi; Hiroki Arimura; Takeaki Uno (IWGS, 2014)

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. - Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (ISAAC, 2014)

Prediction Model Using Micro-clustering. - Takanobu Nakahara; Takeaki Uno; Yukinobu Hamuro (KES, 2014)

A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration. - Shin-ichi Minato; Takeaki Uno; Koji Tsuda; Aika Terada; Jun Sese (ECML/PKDD (2), 2014)

A Framework for Object Classification in Farfield Videos. - Insaf Setitra; Slimane Larabi; Takeaki Uno (WICON, 2014)

A New Approach to Efficient Enumeration by Push-out Amortization. - Takeaki Uno (CoRR, 2014)

Efficient algorithms for dualizing large-scale hypergraphs. - Keisuke Murakami; Takeaki Uno (Discret. Appl. Math., 2014)

Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree. - Kunihiro Wasa; Yusaku Kaneta; Takeaki Uno; Hiroki Arimura (IEICE Trans. Inf. Syst., 2014)

Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms. - Shungo Koichi; Masaki Arisaka; Hiroyuki Koshino; Atsushi Aoki; Satoru Iwata 001; Takeaki Uno; Hiroko Satoh (J. Chem. Inf. Model., 2014)

Base-object location problems for base-monotone regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (Theor. Comput. Sci., 2014)

UNO is hard, even for a single player. - Erik D. Demaine; Martin L. Demaine; Nicholas J. A. Harvey; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2014)

A 4.31-approximation for the geometric unique coverage problem on unit disks. - Takehiro Ito; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2014)

Map merging using cycle consistency check and RANSAC-based spanning tree selection. - Masahiro Tomono; Takeaki Uno (IROS, 2015)

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine; Takeaki Uno (WADS, 2015)

Constant Time Enumeration by Amortization. - Takeaki Uno (WADS, 2015)

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine; Takeaki Uno (WG, 2015)

Micro-Clustering: Finding Small Clusters in Large Diversity. - Takeaki Uno; Hiroki Maegawa; Takanobu Nakahara; Yukinobu Hamuro; Ryo Yoshinaka; Makoto Tatsuta (CoRR, 2015)

Swapping labeled tokens on graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (Theor. Comput. Sci., 2015)

Approximation and Hardness of Token Swapping. - Tillmann Miltzow; Lothar Narins; Yoshio Okamoto; Günter Rote; Antonis Thomas; Takeaki Uno (ESA, 2016)

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. - Takehiro Ito; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Comput. Geom., 2016)

Tight Exact and Approximate Algorithmic Results on Token Swapping. - Tillmann Miltzow; Lothar Narins; Yoshio Okamoto; Günter Rote; Antonis Thomas; Takeaki Uno (CoRR, 2016)

Mining preserving structures in a graph sequence. - Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2016)

Amortized Analysis on Enumeration Algorithms. - Takeaki Uno (Encyclopedia of Algorithms, 2016)

Frequent Pattern Mining. - Takeaki Uno (Encyclopedia of Algorithms, 2016)

Micro-clustering by data polishing. - Takeaki Uno; Hiroki Maegawa; Takanobu Nakahara; Yukinobu Hamuro; Ryo Yoshinaka; Makoto Tatsuta (IEEE BigData, 2017)

Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. - Alessio Conte; Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno (COCOA (2), 2017)

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. - Alessio Conte; Mamadou Moustapha Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa (COCOON, 2017)

On Maximal Cliques with Connectivity Constraints in Directed Graphs. - Alessio Conte; Mamadou Moustapha Kanté; Takeaki Uno; Kunihiro Wasa (ISAAC, 2017)

Listing Maximal Independent Sets with Minimal Space and Bounded Delay. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Takeaki Uno; Luca Versari (SPIRE, 2017)

Counting Minimal Dominating Sets. - Mamadou Moustapha Kanté; Takeaki Uno (TAMC, 2017)

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. - Takashi Horiyama; Takashi Iizuka; Masashi Kiyomi; Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno; Yushi Uno; Yukiko Yamauchi (J. Inf. Process., 2017)

Hitori Numbers. - Akira Suzuki 001; Masashi Kiyomi; Yota Otachi; Kei Uchizawa; Takeaki Uno (J. Inf. Process., 2017)

Ladder-Lottery Realization. - Katsuhisa Yamanaka; Takashi Horiyama; Takeaki Uno; Kunihiro Wasa (CCCG, 2018)

An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. - Kunihiro Wasa; Takeaki Uno (COCOA, 2018)

Efficient Enumeration of Bipartite Subgraphs in Graphs. - Kunihiro Wasa; Takeaki Uno (COCOON, 2018)

Exact Algorithms for the Max-Min Dispersion Problem. - Toshihiro Akagi; Tetsuya Araki; Takashi Horiyama; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa (FAW, 2018)

Computational Complexity of Robot Arm Simulation Problems. - Tianfeng Feng; Takashi Horiyama; Yoshio Okamoto; Yota Otachi; Toshiki Saitoh; Takeaki Uno; Ryuhei Uehara (IWOCA, 2018)

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. - Kazuhiro Kurita; Kunihiro Wasa; Alessio Conte; Takeaki Uno; Hiroki Arimura (IWOCA, 2018)

Node Similarity with q -Grams for Real-World Labeled Networks. - Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino 001; Kunihiko Sadakane; Takeaki Uno (KDD, 2018)

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi; Takeaki Uno; Luca Versari (WG, 2018)

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Optimization algorithm for k-anonymization of datasets with low information loss. - Keisuke Murakami; Takeaki Uno (Int. J. Inf. Sec., 2018)

Time Series Topic Transition Based on Micro-Clustering. - Takako Hashimoto; Takeaki Uno; Tetsuji Kuboyama; Kilho Shin 001; Dave Shepard 001 (BigComp, 2019)

Simple Fold and Cut Problem for Line Segments. - Guoxin Hu; Shin-Ichi Nakano; Ryuhei Uehara; Takeaki Uno (CCCG, 2019)

Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. - Alessio Conte; Mamadou Moustapha Kanté; Andrea Marino 001; Takeaki Uno (IWOCA, 2019)

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (IWOCA, 2019)

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. - Alessio Conte; Roberto Grossi; Mamadou Moustapha Kanté; Andrea Marino 001; Takeaki Uno; Kunihiro Wasa (MFCS, 2019)

Polynomial-Delay Enumeration of Maximal Common Subsequences. - Alessio Conte; Roberto Grossi; Giulia Punzi; Takeaki Uno (SPIRE, 2019)

Fast Identification of Heavy Hitters by Cached and Packed Group Testing. - Yusaku Kaneta; Takeaki Uno; Hiroki Arimura (SPIRE, 2019)

New polynomial delay bounds for maximal subgraph enumeration by proximity search. - Alessio Conte; Takeaki Uno (STOC, 2019)

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. - Kazuhiro Kurita; Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (CoRR, 2019)

Sequentially Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin-Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2019)

Unsupervised Rumor Detection on Twitter using Topic Homogeneity. - David Lawrence Shepard; Takako Hashimoto; Kilho Shin 001; Takeaki Uno; Tetsuji Kuboyama (DH, 2020)

Twitter Topic Progress Visualization using Micro-clustering. - Takako Hashimoto; Akira Kusaba; Dave Shepard 001; Tetsuji Kuboyama; Kilho Shin 001; Takeaki Uno (ICPRAM, 2020)

Guest Editorial: Special issue on Discovery Science. - Takuya Kida; Tetsuji Kuboyama; Takeaki Uno; Akihiro Yamamoto (Mach. Learn., 2020)

Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph. - Alessio Conte; Mamadou Moustapha Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa (Theor. Comput. Sci., 2020)

Two-stage Clustering Method for Discovering People's Perceptions: A Case Study of the COVID-19 Vaccine from Twitter. - Takako Hashimoto; Takeaki Uno; Yuka Takedomi; David Lawrence Shepard; Masashi Toyoda; Naoki Yoshinaga 001; Masaru Kitsuregawa; Ryota Kobayashi (IEEE BigData, 2021)

Modeling Collective Anticipation and Response on Wikipedia. - Ryota Kobayashi; Patrick Gildersleve; Takeaki Uno; Renaud Lambiotte (ICWSM, 2021)

Maximal strongly connected cliques in directed graphs: Algorithms and bounds. - Alessio Conte; Mamadou Moustapha Kanté; Takeaki Uno; Kunihiro Wasa (Discret. Appl. Math., 2021)

On the dualization in distributive lattices and related problems. - Oscar Defrain; Lhouari Nourine; Takeaki Uno (Discret. Appl. Math., 2021)

Efficient enumeration of dominating sets for sparse graphs. - Kazuhiro Kurita; Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (Discret. Appl. Math., 2021)

Preface: WEPA 2018. - Takeaki Uno; Andrea Marino 001 (Discret. Appl. Math., 2021)

Max-Min 3-Dispersion Problems. - Takashi Horiyama; Shin-Ichi Nakano; Toshiki Saitoh; Koki Suetsugu; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (Theor. Comput. Sci., 2021)

Analyzing temporal patterns of topic diversity using graph clustering. - Takako Hashimoto; David Lawrence Shepard; Tetsuji Kuboyama; Kilho Shin 001; Ryota Kobayashi; Takeaki Uno (J. Supercomput., 2021)

Enumeration of Maximal Common Subsequences Between Two Strings. - Alessio Conte; Roberto Grossi; Giulia Punzi; Takeaki Uno (Algorithmica, 2022)

Evolution of the public opinion on COVID-19 vaccination in Japan. - Yuri Nakayama; Yuka Takedomi; Towa Suda; Takeaki Uno; Takako Hashimoto; Masashi Toyoda; Naoki Yoshinaga 001; Masaru Kitsuregawa; Luis E. C. Rocha; Ryota Kobayashi (CoRR, 2022)

An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. - Yasuaki Kobayashi; Shin-Ichi Nakano; Kei Uchizawa; Takeaki Uno; Yutaro Yamaguchi 001; Katsuhisa Yamanaka (IEICE Trans. Inf. Syst., 2022)

Proximity Search for Maximal Subgraph Enumeration. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Takeaki Uno; Luca Versari (SIAM J. Comput., 2022)

Optimal LZ-End Parsing Is Hard. - Hideo Bannai; Mitsuru Funakoshi; Kazuhiro Kurita; Yuto Nakashima 001; Kazuhisa Seto; Takeaki Uno (CPM, 2023)

Cost-Effective Live Expansion of Three-Stage Switching Networks without Blocking or Connection Rearrangement. - Takeru Inoue; Toru Mano; Takeaki Uno (INFOCOM, 2023)

A Compact DAG for Storing and Searching Maximal Common Subsequences. - Alessio Conte; Roberto Grossi; Giulia Punzi; Takeaki Uno (ISAAC, 2023)

Enumerating Empty and Surrounding Polygons. - Shunta Terui; Katsuhisa Yamanaka; Takashi Hirayama; Takashi Horiyama; Kazuhiro Kurita; Takeaki Uno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Sorting balls and water: Equivalence and computational complexity. - Takehiro Ito; Jun Kawahara; Shin-ichi Minato; Yota Otachi; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Katsuhisa Yamanaka; Ryo Yoshinaka (Theor. Comput. Sci., 2023)

Finding Diverse Strings and Longest Common Subsequences in a Graph. - Yuto Shida; Giulia Punzi; Yasuaki Kobayashi; Takeaki Uno; Hiroki Arimura (CPM, 2024)

Inferring community structure in attributed hypergraphs using stochastic block models. - Kazuki Nakajima; Takeaki Uno (CoRR, 2024)

Parameterized Complexity of Finding Dissimilar Shortest Paths. - Ryo Funayama; Yasuaki Kobayashi; Takeaki Uno (CoRR, 2024)

Listing the bonds of a graph in O˜(n)-delay. - Alice Raffaele; Romeo Rizzi; Takeaki Uno (Discret. Appl. Math., 2024)

On the hardness of inclusion-wise minimal separators enumeration. - Caroline Brosse; Oscar Defrain; Kazuhiro Kurita; Vincent Limouzy; Takeaki Uno; Kunihiro Wasa (Inf. Process. Lett., 2024)

Designing Output Sensitive Algorithms for Subgraph Enumeration. - Alessio Conte; Kazuhiro Kurita; Andrea Marino 001; Giulia Punzi; Takeaki Uno; Kunihiro Wasa (From Strings to Graphs, and Back Again, 2025)

Spanner Enumeration for Temporal Graphs. - Kazuhiro Kurita; Andrea Marino 001; Jason Schoeters; Takeaki Uno (SAND, 2025)

Listing maximal H-free subgraphs. - Alessio Conte; Roberto Grossi; Mamadou Moustapha Kanté; Andrea Marino 001; Takeaki Uno (Discret. Appl. Math., 2025)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. - Alessio Conte; Roberto Grossi; Yasuaki Kobayashi; Kazuhiro Kurita; Davide Rucci; Takeaki Uno; Kunihiro Wasa (Algorithmica, 2025)

Inference and visualization of community structure in attributed hypergraphs using mixed-membership stochastic block models. - Kazuki Nakajima; Takeaki Uno (Soc. Netw. Anal. Min., 2025)