| 2026 | IWOCA | Enumerating Spanners in Directed Temporal Graphs. | Lapo Cioni, Andrea Marino, Jason Schoeters, Takeaki Uno |
| 2024 | CPM | Finding Diverse Strings and Longest Common Subsequences in a Graph. | Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura |
| 2023 | CPM | Optimal LZ-End Parsing Is Hard. | Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno |
| 2023 | INFOCOM | Cost-Effective Live Expansion of Three-Stage Switching Networks without Blocking or Connection Rearrangement. | Takeru Inoue, Toru Mano, Takeaki Uno |
| 2023 | ISAAC | A Compact DAG for Storing and Searching Maximal Common Subsequences. | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
| 2022 | FUN | Sorting Balls and Water: Equivalence and Computational Complexity. | Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka |
| 2021 | ICWSM | Modeling Collective Anticipation and Response on Wikipedia. | Ryota Kobayashi, Patrick Gildersleve, Takeaki Uno, Renaud Lambiotte |
| 2020 | ICPRAM | Twitter Topic Progress Visualization using Micro-clustering. | Takako Hashimoto, Akira Kusaba, Dave Shepard, Tetsuji Kuboyama, Kilho Shin, Takeaki Uno |
| 2019 | COCOON | Max-Min 3-Dispersion Problems. | Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2019 | IWOCA | Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. | Alessio Conte, Mamadou Moustapha Kant, Andrea Marino, Takeaki Uno |
| 2019 | IWOCA | An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura |
| 2019 | MFCS | Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. | Alessio Conte, Roberto Grossi, Mamadou Moustapha Kant, Andrea Marino, Takeaki Uno, Kunihiro Wasa |
| 2019 | STOC | New polynomial delay bounds for maximal subgraph enumeration by proximity search. | Alessio Conte, Takeaki Uno |
| 2019 | SPIRE | Polynomial-Delay Enumeration of Maximal Common Subsequences. | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
| 2019 | SPIRE | Fast Identification of Heavy Hitters by Cached and Packed Group Testing. | Yusaku Kaneta, Takeaki Uno, Hiroki Arimura |
| 2018 | COCOA | An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. | Kunihiro Wasa, Takeaki Uno |
| 2018 | COCOON | Efficient Enumeration of Bipartite Subgraphs in Graphs. | Kunihiro Wasa, Takeaki Uno |
| 2018 | FAW | 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 |
| 2018 | ISAAC | Efficient Enumeration of Dominating Sets for Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2018 | IWOCA | Computational Complexity of Robot Arm Simulation Problems. | Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara |
| 2018 | IWOCA | Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. | Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura |
| 2018 | KDD | Node Similarity with q -Grams for Real-World Labeled Networks. | Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno |
| 2018 | WG | Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari |
| 2017 | COCOA | Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. | Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno |
| 2017 | COCOON | Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. | Alessio Conte, Mamadou Moustapha Kant, Yota Otachi, Takeaki Uno, Kunihiro Wasa |
| 2017 | ISAAC | On Maximal Cliques with Connectivity Constraints in Directed Graphs. | Alessio Conte, Mamadou Moustapha Kant, Takeaki Uno, Kunihiro Wasa |
| 2017 | SPIRE | Listing Maximal Independent Sets with Minimal Space and Bounded Delay. | Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari |
| 2017 | TAMC | Counting Minimal Dominating Sets. | Mamadou Moustapha Kant, Takeaki Uno |
| 2017 | WALCOM | Sequentially Swapping Colored Tokens on Graphs. | Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno |
| 2016 | ESA | Approximation and Hardness of Token Swapping. | Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Gnter Rote, Antonis Thomas, Takeaki Uno |
| 2015 | COCOON | Mining Preserving Structures in a Graph Sequence. | Takeaki Uno, Yushi Uno |
| 2015 | IROS | Map merging using cycle consistency check and RANSAC-based spanning tree selection. | Masahiro Tomono, Takeaki Uno |
| 2015 | WADS | Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. | Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno |
| 2015 | WADS | Constant Time Enumeration by Amortization. | Takeaki Uno |
| 2015 | WG | A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. | Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno |
| 2014 | DIS | An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. | Takeaki Uno, Hiroko Satoh |
| 2014 | FUN | 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 |
| 2014 | FUN | Swapping Labeled Tokens on Graphs. | Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno |
| 2014 | ISAAC | Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. | Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2014 | KES | Prediction Model Using Micro-clustering. | Takanobu Nakahara, Takeaki Uno, Yukinobu Hamuro |
| 2013 | ALENEX | Efficient algorithms for dualizing large-scale hypergraphs. | Keisuke Murakami, Takeaki Uno |
| 2013 | CIKM | Mining-based compression approach of propositional formulae. | Sad Jabbour, Lakhdar Sais, Yakoub Salhi, Takeaki Uno |
| 2013 | DIS | A New Approach to String Pattern Mining with Approximate Match. | Tetsushi Matsui, Takeaki Uno, Juzoh Umemori, Tsuyoshi Koide |
| 2013 | DIS | Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. | Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura |
| 2013 | IC3K | Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. | Xiaoliang Geng, Takeaki Uno, Hiroki Arimura |
| 2013 | ISAAC | 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 |
| 2013 | SISAP | Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. | Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura |
| 2013 | WALCOM | Base Location Problems for Base-Monotone Regions. | Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno |
| 2012 | COCOON | Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. | Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura |
| 2012 | FUN | Hitori Number. | Akira Suzuki, Kei Uchizawa, Takeaki Uno |
| 2012 | ISAAC | 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 |
| 2012 | ISAAC | Efficient Computation of Power Indices for Weighted Majority Games. | Takeaki Uno |
| 2012 | WALCOM | Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. | Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano |
| 2011 | COCOON | Dominating Set Counting in Graph Classes. | Shuji Kijima, Yoshio Okamoto, Takeaki Uno |
| 2011 | TAMC | Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. | Benjamin Hellouin de Menibus, Takeaki Uno |
| 2011 | TAMC | Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno |
| 2010 | COCOON | Finding Maximum Edge Bicliques in Convex Bipartite Graphs. | Doron Nussbaum, Shuye Pu, Jrg-Rdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh |
| 2010 | FUN | UNO Is Hard, Even for a Single Player. | Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
| 2010 | ISAAC | Levelwise Mesh Sparsification for Shortest Path Queries. | Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo |
| 2010 | KES | Extracting Promising Sequential Patterns from RFID Data Using the LCM Sequence. | Takanobu Nakahara, Takeaki Uno, Katsutoshi Yada |
| 2010 | SDM | Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases. | Shin-ichi Minato, Takeaki Uno |
| 2009 | SDM | Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. | Hiroki Arimura, Takeaki Uno |
| 2009 | WG | Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. | Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno |
| 2008 | COCOON | On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. | Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno |
| 2008 | ISAAC | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. | Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki |
| 2008 | ISAAC | Enumeration of Perfect Sequences of Chordal Graph. | Yasuko Matsui, Ryuhei Uehara, Takeaki Uno |
| 2008 | PAKDD | LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. | Shin-ichi Minato, Takeaki Uno, Hiroki Arimura |
| 2008 | PAKDD | An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data. | Takeaki Uno |
| 2008 | PAKDD | Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. | Takeaki Uno, Hiroki Arimura |
| 2007 | ACII | Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect. | Abdul Rehman Abbasi, Takeaki Uno, Matthew N. Dailey, Nitin V. Afzulpurkar |
| 2007 | CVPR | Weighted Substructure Mining for Image Analysis. | Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gkhan H. Bakir |
| 2007 | DIS | Time and Space Efficient Discovery of Maximal Geometric Graphs. | Hiroki Arimura, Takeaki Uno, Shinichi Shimozono |
| 2007 | DIS | An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. | Takeaki Uno, Hiroki Arimura |
| 2007 | ISAAC | A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. | Yoshio Okamoto, Takeaki Uno |
| 2007 | ISAAC | An Efficient Algorithm for Enumerating Pseudo Cliques. | Takeaki Uno |
| 2007 | TAMC | A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
| 2007 | TAMC | Efficient Algorithms for Airline Problem. | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
| 2006 | GD | Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. | Marc Benkert, Martin Nllenburg, Takeaki Uno, Alexander Wolff |
| 2006 | KSEM | Enumerating Minimal Explanations by Minimal Hitting Set Computation. | Ken Satoh, Takeaki Uno |
| 2006 | WG | Listing Chordal Graphs and Interval Graphs. | Masashi Kiyomi, Shuji Kijima, Takeaki Uno |
| 2005 | IJCAI | Generalized Amazons is PSPACE-Complete. | Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro |
| 2005 | ILP | An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. | Hiroki Arimura, Takeaki Uno |
| 2005 | ISAAC | A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. | Hiroki Arimura, Takeaki Uno |
| 2005 | WG | Generating Colored Trees. | Shin-Ichi Nakano, Takeaki Uno |
| 2005 | WG | Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. | Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara |
| 2004 | DIS | An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. | Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura |
| 2004 | ISAAC | A Generalization of Magic Squares with Applications to Digital Halftoning. | Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno |
| 2004 | WG | Constant Time Generation of Trees with Specified Diameter. | Shin-Ichi Nakano, Takeaki Uno |
| 2003 | COCOON | Matroid Representation of Clique Complexes. | Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno |
| 2003 | DIS | Discovering Frequent Substructures in Large Unordered Trees. | Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano |
| 2003 | DIS | Enumerating Maximal Frequent Sets Using Irredundant Dualization. | Ken Satoh, Takeaki Uno |
| 2003 | GD | More Efficient Generation of Plane Triangulations. | Shin-Ichi Nakano, Takeaki Uno |
| 2001 | ISAAC | A Fast Algorithm for Enumerating Bipartite Perfect Matchings. | Takeaki Uno |
| 1999 | COCOON | A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. | Takeaki Uno |
| 1998 | ISAAC | A New Approach for Speeding Up Enumeration Algorithms. | Takeaki Uno |
| 1997 | ISAAC | Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. | Takeaki Uno |
| 1996 | ISAAC | An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. | Takeaki Uno |