Takeaki Uno - RankMe

233 papers A* 6A 9B 49C 16Misc 16Journal 103Unranked 32

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A heuristic algorithm for the cluster editing problem. Comput. Optim. Appl. Keisuke Murakami, Takeaki Uno
2026	J	`jnl`	Efficient evaluation of nonblocking property of optical circuit-Switched clos networks with non-Uniform link distribution. Comput. Networks Takeru Inoue, Toru Mano, Takeaki Uno
2026	J	`jnl`	Revisiting the Sparse Matrix Compression Problem. CoRR Vincent Jugé, Dominik Köppl, Vincent Limouzy, Andrea Marino, Jannik Olblich, Giulia Punzi, Takeaki Uno
2025	B	`conf`	AI-Enhanced Two-Stage Clustering for COVID-19 Vaccine Discourse Analysis: Multi-Faceted Public Reaction Assessment. IEEE Big Data Takako Hashimoto, Tetsuji Kuboyama, Masashi Toyoda, Naoki Yoshinaga, Masaru Kitsuregawa, Takeaki Uno
2025	—	`conf`	Designing Output Sensitive Algorithms for Subgraph Enumeration. From Strings to Graphs, and Back Again Alessio Conte, Kazuhiro Kurita, Andrea Marino, Giulia Punzi, Takeaki Uno, Kunihiro Wasa
2025	J	`jnl`	Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. Algorithmica Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
2025	J	`jnl`	Inference and visualization of community structure in attributed hypergraphs using mixed-membership stochastic block models. Soc. Netw. Anal. Min. Kazuki Nakajima, Takeaki Uno
2025	J	`jnl`	Learning Multi-Order Block Structure in Higher-Order Networks. CoRR Kazuki Nakajima, Yuya Sasaki, Takeaki Uno, Masaki Aida
2025	J	`jnl`	Listing maximal H-free subgraphs. Discret. Appl. Math. Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
2025	—	`conf`	Spanner Enumeration for Temporal Graphs. SAND Kazuhiro Kurita, Andrea Marino, Jason Schoeters, Takeaki Uno
2024	J	`jnl`	Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
2024	B	`conf`	Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
2024	J	`jnl`	Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
2024	J	`jnl`	Inferring community structure in attributed hypergraphs using stochastic block models. CoRR Kazuki Nakajima, Takeaki Uno
2024	J	`jnl`	Listing the bonds of a graph in O˜(n)-delay. Discret. Appl. Math. Alice Raffaele, Romeo Rizzi, Takeaki Uno
2024	J	`jnl`	On the hardness of inclusion-wise minimal separators enumeration. Inf. Process. Lett. Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
2024	J	`jnl`	Parameterized Complexity of Finding Dissimilar Shortest Paths. CoRR Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno
2023	B	`conf`	A Compact DAG for Storing and Searching Maximal Common Subsequences. ISAAC Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2023	J	`jnl`	A Compact DAG for Storing and Searching Maximal Common Subsequences. CoRR Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2023	A*	`conf`	Cost-Effective Live Expansion of Three-Stage Switching Networks without Blocking or Connection Rearrangement. INFOCOM Takeru Inoue, Toru Mano, Takeaki Uno
2023	J	`jnl`	Enumerating Empty and Surrounding Polygons. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno
2023	J	`jnl`	On the hardness of inclusion-wise minimal separators enumeration. CoRR Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
2023	B	`conf`	Optimal LZ-End Parsing Is Hard. CPM Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023	J	`jnl`	Optimal LZ-End Parsing is Hard. CoRR Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023	J	`jnl`	Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022	J	`jnl`	An IEICE Trans. Inf. Syst. Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
2022	J	`jnl`	Enumeration of Maximal Common Subsequences Between Two Strings. Algorithmica Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2022	J	`jnl`	Evolution of the public opinion on COVID-19 vaccination in Japan. CoRR Yuri Nakayama, Yuka Takedomi, Towa Suda, Takeaki Uno, Takako Hashimoto, Masashi Toyoda, Naoki Yoshinaga, Masaru Kitsuregawa, Luis E. C. Rocha, Ryota Kobayashi
2022	J	`jnl`	Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
2022	Misc	`conf`	Sorting Balls and Water: Equivalence and Computational Complexity. FUN Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022	J	`jnl`	Sorting Balls and Water: Equivalence and Computational Complexity. CoRR Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2021	J	`jnl`	A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. Theor. Comput. Sci. Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2021	J	`jnl`	Analyzing temporal patterns of topic diversity using graph clustering. J. Supercomput. Takako Hashimoto, David Lawrence Shepard, Tetsuji Kuboyama, Kilho Shin, Ryota Kobayashi, Takeaki Uno
2021	J	`jnl`	Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2021	J	`jnl`	Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2021	J	`jnl`	Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
2021	A	`conf`	Modeling Collective Anticipation and Response on Wikipedia. ICWSM Ryota Kobayashi, Patrick Gildersleve, Takeaki Uno, Renaud Lambiotte
2021	J	`jnl`	Modeling Collective Anticipation and Response on Wikipedia. CoRR Ryota Kobayashi, Patrick Gildersleve, Takeaki Uno, Renaud Lambiotte
2021	J	`jnl`	On the dualization in distributive lattices and related problems. Discret. Appl. Math. Oscar Defrain, Lhouari Nourine, Takeaki Uno
2021	J	`jnl`	Preface: WEPA 2018. Discret. Appl. Math. Takeaki Uno, Andrea Marino
2021	—	`conf`	Two-stage Clustering Method for Discovering People's Perceptions: A Case Study of the COVID-19 Vaccine from Twitter. IEEE BigData Takako Hashimoto, Takeaki Uno, Yuka Takedomi, David Lawrence Shepard, Masashi Toyoda, Naoki Yoshinaga, Masaru Kitsuregawa, Ryota Kobayashi
2020	J	`jnl`	Efficient enumeration of maximal Theor. Comput. Sci. Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
2020	J	`jnl`	Guest Editorial: Special issue on Discovery Science. Mach. Learn. Takuya Kida, Tetsuji Kuboyama, Takeaki Uno, Akihiro Yamamoto
2020	C	`conf`	Twitter Topic Progress Visualization using Micro-clustering. ICPRAM Takako Hashimoto, Akira Kusaba, Dave Shepard, Tetsuji Kuboyama, Kilho Shin, Takeaki Uno
2020	—	`conf`	Unsupervised Rumor Detection on Twitter using Topic Homogeneity. DH David Lawrence Shepard, Takako Hashimoto, Kilho Shin, Takeaki Uno, Tetsuji Kuboyama
2019	C	`conf`	An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2019	J	`jnl`	An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2019	J	`jnl`	Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. CoRR Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2019	C	`conf`	Fast Identification of Heavy Hitters by Cached and Packed Group Testing. SPIRE Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
2019	B	`conf`	Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
2019	Misc	`conf`	Max-Min 3-Dispersion Problems. COCOON Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2019	C	`conf`	Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
2019	A*	`conf`	New polynomial delay bounds for maximal subgraph enumeration by proximity search. STOC Alessio Conte, Takeaki Uno
2019	J	`jnl`	On the dualization in distributive lattices and related problems. CoRR Oscar Defrain, Lhouari Nourine, Takeaki Uno
2019	C	`conf`	Polynomial-Delay Enumeration of Maximal Common Subsequences. SPIRE Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2019	J	`jnl`	Proximity Search For Maximal Subgraph Enumeration. CoRR Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari
2019	J	`jnl`	Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2019	—	`conf`	Simple Fold and Cut Problem for Line Segments. CCCG Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2019	—	`conf`	Time Series Topic Transition Based on Micro-Clustering. BigComp Takako Hashimoto, Takeaki Uno, Tetsuji Kuboyama, Kilho Shin, Dave Shepard
2018	C	`conf`	An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. COCOA Kunihiro Wasa, Takeaki Uno
2018	C	`conf`	Computational Complexity of Robot Arm Simulation Problems. IWOCA Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
2018	Misc	`conf`	Efficient Enumeration of Bipartite Subgraphs in Graphs. COCOON Kunihiro Wasa, Takeaki Uno
2018	J	`jnl`	Efficient Enumeration of Bipartite Subgraphs in Graphs. CoRR Kunihiro Wasa, Takeaki Uno
2018	B	`conf`	Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2018	J	`jnl`	Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2018	J	`jnl`	Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2018	C	`conf`	Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
2018	J	`jnl`	Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
2018	Misc	`conf`	Exact Algorithms for the Max-Min Dispersion Problem. FAW Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2018	—	`conf`	Ladder-Lottery Realization. CCCG Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa
2018	J	`jnl`	Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. CoRR Benjamin Hellouin de Menibus, Takeaki Uno
2018	A*	`conf`	Node Similarity with q -Grams for Real-World Labeled Networks. KDD Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
2018	J	`jnl`	Optimization algorithm for k-anonymization of datasets with low information loss. Int. J. Inf. Sec. Keisuke Murakami, Takeaki Uno
2018	B	`conf`	Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari
2017	C	`conf`	Counting Minimal Dominating Sets. TAMC Mamadou Moustapha Kanté, Takeaki Uno
2017	B	`ed.`	Discovery Science - 20th International Conference, DS 2017, Kyoto, Japan, October 15-17, 2017, Proceedings DS Akihiro Yamamoto, Takuya Kida, Takeaki Uno, Tetsuji Kuboyama
2017	J	`jnl`	Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2017	Misc	`conf`	Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
2017	J	`jnl`	Hitori Numbers. J. Inf. Process. Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno
2017	—	`conf`	Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. COCOA (2) Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno
2017	C	`conf`	Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
2017	—	`conf`	Micro-clustering by data polishing. IEEE BigData Takeaki Uno, Hiroki Maegawa, Takanobu Nakahara, Yukinobu Hamuro, Ryo Yoshinaka, Makoto Tatsuta
2017	B	`conf`	On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
2017	J	`jnl`	Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. J. Inf. Process. Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
2017	B	`conf`	Sequentially Swapping Colored Tokens on Graphs. WALCOM Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2016	J	`jnl`	A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2016	—	`ch.`	Amortized Analysis on Enumeration Algorithms. Encyclopedia of Algorithms Takeaki Uno
2016	A	`conf`	Approximation and Hardness of Token Swapping. ESA Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
2016	—	`ch.`	Frequent Pattern Mining. Encyclopedia of Algorithms Takeaki Uno
2016	J	`jnl`	Mining preserving structures in a graph sequence. Theor. Comput. Sci. Takeaki Uno, Yushi Uno
2016	J	`jnl`	Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
2015	B	`conf`	A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. WG Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2015	B	`conf`	Constant Time Enumeration by Amortization. WADS Takeaki Uno
2015	A	`conf`	Map merging using cycle consistency check and RANSAC-based spanning tree selection. IROS Masahiro Tomono, Takeaki Uno
2015	J	`jnl`	Micro-Clustering: Finding Small Clusters in Large Diversity. CoRR Takeaki Uno, Hiroki Maegawa, Takanobu Nakahara, Yukinobu Hamuro, Ryo Yoshinaka, Makoto Tatsuta
2015	Misc	`conf`	Mining Preserving Structures in a Graph Sequence. COCOON Takeaki Uno, Yushi Uno
2015	B	`conf`	Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2015	J	`jnl`	Swapping labeled tokens on graphs. Theor. Comput. Sci. Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2014	J	`jnl`	A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2014	—	`conf`	A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration. ECML/PKDD (2) Shin-ichi Minato, Takeaki Uno, Koji Tsuda, Aika Terada, Jun Sese
2014	—	`conf`	A Framework for Object Classification in Farfield Videos. WICON Insaf Setitra, Slimane Larabi, Takeaki Uno
2014	J	`jnl`	A New Approach to Efficient Enumeration by Push-out Amortization. CoRR Takeaki Uno
2014	J	`jnl`	A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2014	B	`conf`	An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. Discovery Science Takeaki Uno, Hiroko Satoh
2014	J	`jnl`	An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. CoRR Takeaki Uno, Hiroko Satoh
2014	J	`jnl`	Base-object location problems for base-monotone regions. Theor. Comput. Sci. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2014	J	`jnl`	Chemical Structure Elucidation from J. Chem. Inf. Model. Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh
2014	J	`jnl`	Constant Time Enumeration of Subtrees with Exactly IEICE Trans. Inf. Syst. Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
2014	B	`conf`	Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. ISAAC Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2014	J	`jnl`	Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. CoRR Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2014	J	`jnl`	Efficient algorithms for dualizing large-scale hypergraphs. Discret. Appl. Math. Keisuke Murakami, Takeaki Uno
2014	—	`conf`	Enumeration of complete set of flock patterns in trajectories. IWGS Xiaoliang Geng, Takuya Takagi, Hiroki Arimura, Takeaki Uno
2014	J	`jnl`	Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2014	B	`conf`	Prediction Model Using Micro-clustering. KES Takanobu Nakahara, Takeaki Uno, Yukinobu Hamuro
2014	Misc	`conf`	Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
2014	Misc	`conf`	Swapping Labeled Tokens on Graphs. FUN Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2014	J	`jnl`	UNO is hard, even for a single player. Theor. Comput. Sci. Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2013	B	`conf`	A New Approach to String Pattern Mining with Approximate Match. Discovery Science Tetsushi Matsui, Takeaki Uno, Juzoh Umemori, Tsuyoshi Koide
2013	B	`conf`	Base Location Problems for Base-Monotone Regions. WALCOM Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2013	J	`jnl`	Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. Discret. Math. Algorithms Appl. Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
2013	J	`jnl`	Efficient algorithms for a simple network design problem. Networks Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2013	A	`conf`	Efficient algorithms for dualizing large-scale hypergraphs. ALENEX Keisuke Murakami, Takeaki Uno
2013	B	`conf`	Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. SISAP Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura
2013	A	`conf`	Mining-based compression approach of propositional formulae. CIKM Saïd Jabbour, Lakhdar Sais, Yakoub Salhi, Takeaki Uno
2013	B	`conf`	On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. ISAAC Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2013	B	`conf`	Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. Discovery Science Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura
2013	—	`conf`	Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. KDIR/KMIS Xiaoliang Geng, Takeaki Uno, Hiroki Arimura
2012	B	`conf`	A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	—	`conf`	A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	B	`conf`	Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. WALCOM Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
2012	Misc	`conf`	Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. COCOON Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
2012	B	`conf`	Efficient Computation of Power Indices for Weighted Majority Games. ISAAC Takeaki Uno
2012	J	`jnl`	Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh
2012	Misc	`conf`	Hitori Number. FUN Akira Suzuki, Kei Uchizawa, Takeaki Uno
2012	J	`jnl`	Mining Preserving Structures in a Graph Sequence CoRR Takeaki Uno, Yushi Uno
2012	J	`jnl`	On Complexity of Flooding Games on Graphs with Interval Representations CoRR Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	—	`conf`	On Complexity of Flooding Games on Graphs with Interval Representations. TJJCCGG Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	J	`jnl`	Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Algorithmica Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou
2012	—	`conf`	Pattern Mining from Trajectory GPS Data. IIAI-AAI Xiaoliang Geng, Hiroki Arimura, Takeaki Uno
2012	J	`jnl`	Subgraph isomorphism in graph classes. Discret. Math. Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno
2012	J	`jnl`	The Algebraic Combinatorial Approach for Low-Rank Matrix Completion CoRR Franz J. Király, Louis Theran, Ryota Tomioka, Takeaki Uno
2011	J	`jnl`	A Doubly Exponentially Crumbled Cake CoRR Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
2011	J	`jnl`	A Doubly Exponentially Crumbled Cake. Electron. Notes Discret. Math. Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
2011	J	`jnl`	A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. Eur. J. Oper. Res. Yoshio Okamoto, Takeaki Uno
2011	J	`jnl`	Algorithmic Folding Complexity. Graphs Comb. Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno
2011	Misc	`conf`	Dominating Set Counting in Graph Classes. COCOON Shuji Kijima, Yoshio Okamoto, Takeaki Uno
2011	J	`jnl`	Efficient Algorithms for Dualizing Large-Scale Hypergraphs CoRR Keisuke Murakami, Takeaki Uno
2011	C	`conf`	Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
2011	J	`jnl`	Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
2011	C	`conf`	Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. TAMC Benjamin Hellouin de Menibus, Takeaki Uno
2010	J	`jnl`	An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem. Algorithmica Takeaki Uno
2010	—	`conf`	Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses. HPCS Benjamin Négrevergne, Alexandre Termier, Jean-François Méhaut, Takeaki Uno
2010	—	`conf`	Découverte d'itemsets fréquents fermés sur architecture multicoeurs. EGC Benjamin Négrevergne, Jean-François Méhaut, Alexandre Termier, Takeaki Uno
2010	J	`jnl`	Enumeration of the perfect sequences of a chordal graph. Theor. Comput. Sci. Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
2010	—	`conf`	Extracting Promising Sequential Patterns from RFID Data Using the LCM Sequence. KES (3) Takanobu Nakahara, Takeaki Uno, Katsutoshi Yada
2010	Misc	`conf`	Finding Maximum Edge Bicliques in Convex Bipartite Graphs. COCOON Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh
2010	A	`conf`	Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases. SDM Shin-ichi Minato, Takeaki Uno
2010	J	`jnl`	Improved Bounds for Wireless Localization. Algorithmica Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
2010	—	`conf`	Levelwise Mesh Sparsification for Shortest Path Queries. ISAAC (1) Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
2010	J	`jnl`	Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data. Knowl. Inf. Syst. Takeaki Uno
2010	J	`jnl`	On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
2010	C	`conf`	Single versus Multiple Sorting in All Pairs Similarity Search. ACML Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji Tsuda
2010	J	`jnl`	Student mental state inference from unintentional body gestures using dynamic Bayesian networks. J. Multimodal User Interfaces Abdul Rehman Abbasi, Matthew N. Dailey, Nitin V. Afzulpurkar, Takeaki Uno
2010	J	`jnl`	The complexity of UNO CoRR Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2010	Misc	`conf`	UNO Is Hard, Even for a Single Player. FUN Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2009	J	`jnl`	A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2009	B	`conf`	Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
2009	J	`jnl`	Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method CoRR Takeaki Uno, Masashi Sugiyama, Koji Tsuda
2009	—	`conf`	Efficient serial episode mining with minimal occurrences. ICUIMC Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura
2009	J	`jnl`	Enumeration of condition-dependent dense modules in protein interaction networks. Bioinform. Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda
2009	A	`conf`	Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. SDM Hiroki Arimura, Takeaki Uno
2009	J	`jnl`	Transforming spanning trees: A lower bound. Comput. Geom. Kevin Buchin, Andreas Razen, Takeaki Uno, Uli Wagner
2008	J	`jnl`	A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
2008	B	`conf`	Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD Takeaki Uno, Hiroki Arimura
2008	B	`conf`	An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data. PAKDD Takeaki Uno
2008	J	`jnl`	An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discret. Appl. Math. Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura
2008	J	`jnl`	Counting the number of independent sets in chordal graphs. J. Discrete Algorithms Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
2008	B	`conf`	Enumeration of Perfect Sequences of Chordal Graph. ISAAC Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
2008	—	`conf`	Improved Bounds for Wireless Localization. SWAT Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
2008	B	`conf`	LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. PAKDD Shin-ichi Minato, Takeaki Uno, Hiroki Arimura
2008	Misc	`conf`	On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
2008	B	`conf`	Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
2008	—	`conf`	Probabilistic Prediction of Student Affect from Hand Gestures. ARCS Abdul Rehman Abbasi, Matthew N. Dailey, Nitin V. Afzulpurkar, Takeaki Uno
2007	C	`conf`	A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2007	B	`conf`	A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ISAAC Yoshio Okamoto, Takeaki Uno
2007	J	`jnl`	Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information. J. Chem. Inf. Model. Shungo Koichi, Satoru Iwata, Takeaki Uno, Hiroyuki Koshino, Hiroko Satoh
2007	B	`conf`	An Efficient Algorithm for Enumerating Pseudo Cliques. ISAAC Takeaki Uno
2007	B	`conf`	An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science Takeaki Uno, Hiroki Arimura
2007	J	`jnl`	An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. J. Comb. Optim. Hiroki Arimura, Takeaki Uno
2007	C	`conf`	Efficient Algorithms for Airline Problem. TAMC Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2007	J	`jnl`	Matroid representation of clique complexes. Discret. Appl. Math. Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
2007	—	`conf`	Mining Maximal Flexible Patterns in a Sequence. JSAI Hiroki Arimura, Takeaki Uno
2007	J	`jnl`	Mining complex genotypic features for predicting HIV-1 drug resistance. Bioinform. Hiroto Saigo, Takeaki Uno, Koji Tsuda
2007	J	`jnl`	Mining expression-dependent modules in the human interaction network. BMC Bioinform. Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda
2007	B	`conf`	Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
2007	B	`conf`	Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect. ACII Abdul Rehman Abbasi, Takeaki Uno, Matthew N. Dailey, Nitin V. Afzulpurkar
2007	A*	`conf`	Weighted Substructure Mining for Image Analysis. CVPR Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir
2007	—	`conf`	Weighted Substructure Mining for Image Analysis. MLG Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir
2006	J	`jnl`	An O(n log Discret. Appl. Math. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
2006	A*	`conf`	Contradiction Finding and Minimal Recovery for UML Class Diagrams. ASE Ken Satoh, Ken Kaneiwa, Takeaki Uno
2006	C	`conf`	Enumerating Minimal Explanations by Minimal Hitting Set Computation. KSEM Ken Satoh, Takeaki Uno
2006	J	`jnl`	Generating Chordal Graphs Included in Given Graphs. IEICE Trans. Inf. Syst. Masashi Kiyomi, Takeaki Uno
2006	B	`conf`	Listing Chordal Graphs and Interval Graphs. WG Masashi Kiyomi, Shuji Kijima, Takeaki Uno
2006	A	`conf`	Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. GD Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff
2005	B	`conf`	A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC Hiroki Arimura, Takeaki Uno
2005	B	`conf`	An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP Hiroki Arimura, Takeaki Uno
2005	J	`jnl`	Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Transp. Sci. Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura
2005	—	`conf`	Efficient Algorithms for the Electric Power Transaction Problem. WINE Masashi Kiyomi, Takeaki Uno, Tomomi Matsui
2005	—	`conf`	Enumerating Minimally Revised Specifications Using Dualization. JSAI Workshops Ken Satoh, Takeaki Uno
2005	A*	`conf`	Generalized Amazons is PSPACE-Complete. IJCAI Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro
2005	B	`conf`	Generating Colored Trees. WG Shin-Ichi Nakano, Takeaki Uno
2005	B	`conf`	Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
2004	B	`conf`	A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
2004	B	`conf`	An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Discovery Science Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura
2004	—	`conf`	An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. IFIP TCS Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
2004	B	`conf`	Constant Time Generation of Trees with Specified Diameter. WG Shin-Ichi Nakano, Takeaki Uno
2004	—	`conf`	LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets FIMI Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
2004	J	`jnl`	Labeling Points with Weights. Algorithmica Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff
2004	—	`conf`	New Algorithms for Enumerating All Maximal Cliques. SWAT Kazuhisa Makino, Takeaki Uno
2003	—	`conf`	Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. FIMI Takeaki Uno, Ken Satoh
2003	B	`conf`	Discovering Frequent Substructures in Large Unordered Trees. Discovery Science Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano
2003	B	`conf`	Enumerating Maximal Frequent Sets Using Irredundant Dualization. Discovery Science Ken Satoh, Takeaki Uno
2003	—	`conf`	LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura
2003	Misc	`conf`	Matroid Representation of Clique Complexes. COCOON Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
2003	A	`conf`	More Efficient Generation of Plane Triangulations. GD Shin-Ichi Nakano, Takeaki Uno
2001	B	`conf`	A Fast Algorithm for Enumerating Bipartite Perfect Matchings. ISAAC Takeaki Uno
2000	J	`jnl`	Fast Algorithms to Enumerate All Common Intervals of Two Permutations. Algorithmica Takeaki Uno, Mutsunori Yagiura
1999	Misc	`conf`	A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. COCOON Takeaki Uno
1998	B	`conf`	A New Approach for Speeding Up Enumeration Algorithms. ISAAC Takeaki Uno
1997	J	`jnl`	A Linear Time Algorithm for Finding a k-Tree Core. J. Algorithms Akiyoshi Shioura, Takeaki Uno
1997	B	`conf`	Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. ISAAC Takeaki Uno
1997	J	`jnl`	An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. SIAM J. Comput. Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno
1996	B	`conf`	An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. ISAAC Takeaki Uno