Takeaki Uno

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 78

Top Venues

CoRR

Theor. Comput. Sci.

Discret. Appl. Math.

ISAAC

Publications

Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration. Inf. Process. Lett. 185 (2024)
Kazuki Nakajima, Takeaki Uno
Inferring community structure in attributed hypergraphs using stochastic block models. CoRR (2024)
Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno
Parameterized Complexity of Finding Dissimilar Shortest Paths. CoRR (2024)
Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR (2024)
Alice Raffaele, Romeo Rizzi, Takeaki Uno
Listing the bonds of a graph in O˜(n)-delay. Discret. Appl. Math. 348 (2024)
Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM (2024)
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR (2024)
Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno
Enumerating Empty and Surrounding Polygons. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106 (9) (2023)
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration. CoRR (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing is Hard. CoRR (2023)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
A Compact DAG for Storing and Searching Maximal Common Subsequences. ISAAC (2023)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. 978 (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing Is Hard. CPM (2023)
Takeru Inoue, Toru Mano, Takeaki Uno
Cost-Effective Live Expansion of Three-Stage Switching Networks without Blocking or Connection Rearrangement. INFOCOM (2023)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
A Compact DAG for Storing and Searching Maximal Common Subsequences. CoRR (2023)
Yuri Nakayama, Yuka Takedomi, Towa Suda, Takeaki Uno, Takako Hashimoto, Masashi Toyoda, Naoki Yoshinaga, Masaru Kitsuregawa, Luis E. C. Rocha, Ryota Kobayashi
Evolution of the public opinion on COVID-19 vaccination in Japan. CoRR (2022)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting Balls and Water: Equivalence and Computational Complexity. CoRR (2022)
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51 (5) (2022)
Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. (3) (2022)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
Enumeration of Maximal Common Subsequences Between Two Strings. Algorithmica 84 (3) (2022)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting Balls and Water: Equivalence and Computational Complexity. FUN (2022)
Takeaki Uno, Andrea Marino
Preface: WEPA 2018. Discret. Appl. Math. 303 (2021)
Takako Hashimoto, David Lawrence Shepard, Tetsuji Kuboyama, Kilho Shin, Ryota Kobayashi, Takeaki Uno
Analyzing temporal patterns of topic diversity using graph clustering. J. Supercomput. 77 (5) (2021)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Takako Hashimoto, Takeaki Uno, Yuka Takedomi, David Lawrence Shepard, Masashi Toyoda, Naoki Yoshinaga, Masaru Kitsuregawa, Ryota Kobayashi
Two-stage Clustering Method for Discovering People's Perceptions: A Case Study of the COVID-19 Vaccine from Twitter. IEEE BigData (2021)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. Theor. Comput. Sci. 874 (2021)
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. 303 (2021)
Ryota Kobayashi, Patrick Gildersleve, Takeaki Uno, Renaud Lambiotte
Modeling Collective Anticipation and Response on Wikipedia. CoRR (2021)
Ryota Kobayashi, Patrick Gildersleve, Takeaki Uno, Renaud Lambiotte
Modeling Collective Anticipation and Response on Wikipedia. ICWSM (2021)
Oscar Defrain, Lhouari Nourine, Takeaki Uno
On the dualization in distributive lattices and related problems. Discret. Appl. Math. 300 (2021)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. 303 (2021)
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
-degenerate induced subgraphs of a chordal graph. Theor. Comput. Sci. 818 (2020)
Takuya Kida, Tetsuji Kuboyama, Takeaki Uno, Akihiro Yamamoto
Guest Editorial: Special issue on Discovery Science. Mach. Learn. 109 (6) (2020)
Takako Hashimoto, Akira Kusaba, Dave Shepard, Tetsuji Kuboyama, Kilho Shin, Takeaki Uno
Twitter Topic Progress Visualization using Micro-clustering. ICPRAM (2020)
David Lawrence Shepard, Takako Hashimoto, Kilho Shin, Takeaki Uno, Tetsuji Kuboyama
Unsupervised Rumor Detection on Twitter using Topic Homogeneity. DH (2020)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
Polynomial-Delay Enumeration of Maximal Common Subsequences. SPIRE (2019)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR (2019)
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS (2019)
Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari
Proximity Search For Maximal Subgraph Enumeration. CoRR (2019)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23 (1) (2019)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. COCOON (2019)
Oscar Defrain, Lhouari Nourine, Takeaki Uno
On the dualization in distributive lattices and related problems. CoRR (2019)
Alessio Conte, Takeaki Uno
New polynomial delay bounds for maximal subgraph enumeration by proximity search. STOC (2019)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. CoRR (2019)
Takako Hashimoto, Takeaki Uno, Tetsuji Kuboyama, Kilho Shin, Dave Shepard
Time Series Topic Transition Based on Micro-Clustering. BigComp (2019)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA (2019)
Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA (2019)
Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
Fast Identification of Heavy Hitters by Cached and Packed Group Testing. SPIRE (2019)
Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
Simple Fold and Cut Problem for Line Segments. CCCG (2019)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR (2018)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC (2018)
Kunihiro Wasa, Takeaki Uno
Efficient Enumeration of Bipartite Subgraphs in Graphs. CoRR (2018)
Kunihiro Wasa, Takeaki Uno
An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. COCOA (2018)
Kunihiro Wasa, Takeaki Uno
Efficient Enumeration of Bipartite Subgraphs in Graphs. COCOON (2018)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR (2018)
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Exact Algorithms for the Max-Min Dispersion Problem. FAW (2018)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG (2018)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Keisuke Murakami, Takeaki Uno
Optimization algorithm for k-anonymization of datasets with low information loss. Int. J. Inf. Sec. 17 (6) (2018)
Benjamin Hellouin de Menibus, Takeaki Uno
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. CoRR (2018)
Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa
Ladder-Lottery Realization. CCCG (2018)
Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
Computational Complexity of Robot Arm Simulation Problems. IWOCA (2018)
Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
Node Similarity with q -Grams for Real-World Labeled Networks. KDD (2018)
Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. COCOA (2) (2017)
Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno
Hitori Numbers. J. Inf. Process. 25 (2017)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. WALCOM (2017)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR (2017)
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE (2017)
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC (2017)
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. J. Inf. Process. 25 (2017)
Takeaki Uno, Hiroki Maegawa, Takanobu Nakahara, Yukinobu Hamuro, Ryo Yoshinaka, Makoto Tatsuta
Micro-clustering by data polishing. IEEE BigData (2017)
Mamadou Moustapha Kanté, Takeaki Uno
Counting Minimal Dominating Sets. TAMC (2017)
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
Approximation and Hardness of Token Swapping. ESA (2016)
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. Comput. Geom. 51 (2016)
Takeaki Uno, Yushi Uno
Mining preserving structures in a graph sequence. Theor. Comput. Sci. 654 (2016)
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR (2016)
Takeaki Uno
Constant Time Enumeration by Amortization. WADS (2015)
Masahiro Tomono, Takeaki Uno
Map merging using cycle consistency check and RANSAC-based spanning tree selection. IROS (2015)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS (2015)
Takeaki Uno, Yushi Uno
Mining Preserving Structures in a Graph Sequence. COCOON (2015)
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
Swapping labeled tokens on graphs. Theor. Comput. Sci. 586 (2015)
Takeaki Uno, Hiroki Maegawa, Takanobu Nakahara, Yukinobu Hamuro, Ryo Yoshinaka, Makoto Tatsuta
Micro-Clustering: Finding Small Clusters in Large Diversity. CoRR (2015)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. WG (2015)
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
Swapping Labeled Tokens on Graphs. FUN (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR (2014)
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
UNO is hard, even for a single player. Theor. Comput. Sci. 521 (2014)
Takeaki Uno, Hiroko Satoh
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. CoRR (2014)
Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh
C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms. J. Chem. Inf. Model. 54 (4) (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR (2014)
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. ISAAC (2014)
Shin-ichi Minato, Takeaki Uno, Koji Tsuda, Aika Terada, Jun Sese
A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration. ECML/PKDD (2) (2014)
Insaf Setitra, Slimane Larabi, Takeaki Uno
A Framework for Object Classification in Farfield Videos. WICON (2014)
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. CoRR (2014)
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
Base-object location problems for base-monotone regions. Theor. Comput. Sci. 555 (2014)
Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
Nodes in a Tree. IEICE Trans. Inf. Syst. (3) (2014)
Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN (2014)
Takeaki Uno
A New Approach to Efficient Enumeration by Push-out Amortization. CoRR (2014)
Takeaki Uno, Hiroko Satoh
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. Discovery Science (2014)

Takeaki Uno.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Takeaki Uno