default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakeaki Uno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j63]Alice Raffaele
, Romeo Rizzi, Takeaki Uno:
Listing the bonds of a graph in O˜(n)-delay. Discret. Appl. Math. 348: 105-121 (2024)- [j62]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: 106469 (2024) - [c124]Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura:
Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM 2024: 27:1-27:19 - [i33]Kazuki Nakajima, Takeaki Uno:
Inferring community structure in attributed hypergraphs using stochastic block models. CoRR abs/2401.00688 (2024) - [i32]Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno:
Parameterized Complexity of Finding Dissimilar Shortest Paths. CoRR abs/2402.14376 (2024) - [i31]Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura:
Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR abs/2405.00131 (2024) - [i30]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 abs/2405.13613 (2024) - 2023
- [j61]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): 1082-1091 (2023) - [j60]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: 114158 (2023) - [c123]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing Is Hard. CPM 2023: 3:1-3:11 - [c122]Takeru Inoue, Toru Mano, Takeaki Uno:
Cost-Effective Live Expansion of Three-Stage Switching Networks without Blocking or Connection Rearrangement. INFOCOM 2023: 1-10 - [c121]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
A Compact DAG for Storing and Searching Maximal Common Subsequences. ISAAC 2023: 21:1-21:15 - [i29]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing is Hard. CoRR abs/2302.02586 (2023) - [i28]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
A Compact DAG for Storing and Searching Maximal Common Subsequences. CoRR abs/2307.13695 (2023) - [i27]Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa:
On the hardness of inclusion-wise minimal separators enumeration. CoRR abs/2308.15444 (2023) - 2022
- [j59]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
Enumeration of Maximal Common Subsequences Between Two Strings. Algorithmica 84(3): 757-783 (2022) - [j58]Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka:
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. 105-D(3): 503-507 (2022) - [j57]Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51(5): 1580-1625 (2022) - [c120]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: 16:1-16:17 - [i26]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 abs/2202.09495 (2022) - [i25]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 abs/2207.10924 (2022) - 2021
- [j56]Oscar Defrain, Lhouari Nourine, Takeaki Uno:
On the dualization in distributive lattices and related problems. Discret. Appl. Math. 300: 85-96 (2021) - [j55]Takeaki Uno, Andrea Marino:
Preface: WEPA 2018. Discret. Appl. Math. 303: 160 (2021) - [j54]Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa:
Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. 303: 237-252 (2021) - [j53]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. 303: 283-295 (2021) - [j52]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. 104-A(9): 1101-1107 (2021) - [j51]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: 32-41 (2021) - [j50]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): 4375-4388 (2021) - [c119]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: 614-621 - [c118]Ryota Kobayashi, Patrick Gildersleve, Takeaki Uno, Renaud Lambiotte:
Modeling Collective Anticipation and Response on Wikipedia. ICWSM 2021: 315-326 - [i24]Ryota Kobayashi, Patrick Gildersleve, Takeaki Uno, Renaud Lambiotte:
Modeling Collective Anticipation and Response on Wikipedia. CoRR abs/2105.10900 (2021) - 2020
- [j49]Takuya Kida, Tetsuji Kuboyama, Takeaki Uno, Akihiro Yamamoto:
Guest Editorial: Special issue on Discovery Science. Mach. Learn. 109(6): 1145-1146 (2020) - [j48]Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph. Theor. Comput. Sci. 818: 2-11 (2020) - [c117]David Lawrence Shepard, Takako Hashimoto, Kilho Shin, Takeaki Uno, Tetsuji Kuboyama:
Unsupervised Rumor Detection on Twitter using Topic Homogeneity. DH 2020 - [c116]Takako Hashimoto, Akira Kusaba, Dave Shepard, Tetsuji Kuboyama, Kilho Shin, Takeaki Uno:
Twitter Topic Progress Visualization using Micro-clustering. ICPRAM 2020: 585-592
2010 – 2019
- 2019
- [j47]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): 3-27 (2019) - [c115]Takako Hashimoto, Takeaki Uno, Tetsuji Kuboyama, Kilho Shin, Dave Shepard:
Time Series Topic Transition Based on Micro-Clustering. BigComp 2019: 1-8 - [c114]Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Simple Fold and Cut Problem for Line Segments. CCCG 2019: 153-158 - [c113]Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Max-Min 3-Dispersion Problems. COCOON 2019: 291-300 - [c112]Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno:
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA 2019: 148-159 - [c111]Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA 2019: 339-351 - [c110]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: 73:1-73:14 - [c109]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
Polynomial-Delay Enumeration of Maximal Common Subsequences. SPIRE 2019: 189-202 - [c108]Yusaku Kaneta, Takeaki Uno, Hiroki Arimura:
Fast Identification of Heavy Hitters by Cached and Packed Group Testing. SPIRE 2019: 241-257 - [c107]Alessio Conte, Takeaki Uno:
New polynomial delay bounds for maximal subgraph enumeration by proximity search. STOC 2019: 1179-1190 - [i23]Oscar Defrain, Lhouari Nourine, Takeaki Uno:
On the dualization in distributive lattices and related problems. CoRR abs/1902.07004 (2019) - [i22]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR abs/1903.02161 (2019) - [i21]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 abs/1906.09680 (2019) - [i20]Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari:
Proximity Search For Maximal Subgraph Enumeration. CoRR abs/1912.13446 (2019) - 2018
- [j46]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. 101-A(9): 1383-1391 (2018) - [j45]Keisuke Murakami, Takeaki Uno:
Optimization algorithm for k-anonymization of datasets with low information loss. Int. J. Inf. Sec. 17(6): 631-644 (2018) - [c106]Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa:
Ladder-Lottery Realization. CCCG 2018: 61-67 - [c105]Kunihiro Wasa, Takeaki Uno:
An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. COCOA 2018: 35-45 - [c104]Kunihiro Wasa, Takeaki Uno:
Efficient Enumeration of Bipartite Subgraphs in Graphs. COCOON 2018: 454-466 - [c103]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: 263-272 - [c102]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC 2018: 8:1-8:13 - [c101]Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara:
Computational Complexity of Robot Arm Simulation Problems. IWOCA 2018: 177-188 - [c100]Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA 2018: 201-213 - [c99]Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno:
Node Similarity with q -Grams for Real-World Labeled Networks. KDD 2018: 1282-1291 - [c98]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: 100-110 - [i19]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR abs/1802.07863 (2018) - [i18]Kunihiro Wasa, Takeaki Uno:
Efficient Enumeration of Bipartite Subgraphs in Graphs. CoRR abs/1803.03839 (2018) - [i17]Benjamin Hellouin de Menibus, Takeaki Uno:
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. CoRR abs/1806.00791 (2018) - [i16]Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR abs/1806.04307 (2018) - 2017
- [j44]Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno:
Hitori Numbers. J. Inf. Process. 25: 695-707 (2017) - [j43]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: 708-715 (2017) - [c97]Takeaki Uno, Hiroki Maegawa, Takanobu Nakahara, Yukinobu Hamuro, Ryo Yoshinaka, Makoto Tatsuta:
Micro-clustering by data polishing. IEEE BigData 2017: 1012-1018 - [c96]Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno:
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. COCOA (2) 2017: 169-181 - [c95]Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON 2017: 150-161 - [c94]Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa:
On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC 2017: 23:1-23:13 - [c93]Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE 2017: 144-160 - [c92]Mamadou Moustapha Kanté, Takeaki Uno:
Counting Minimal Dominating Sets. TAMC 2017: 333-347 - [c91]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: 435-447 - [e1]Akihiro Yamamoto, Takuya Kida, Takeaki Uno, Tetsuji Kuboyama:
Discovery Science - 20th International Conference, DS 2017, Kyoto, Japan, October 15-17, 2017, Proceedings. Lecture Notes in Computer Science 10558, Springer 2017, ISBN 978-3-319-67785-9 [contents] - [i15]Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR abs/1707.02740 (2017) - 2016
- [j42]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: 25-39 (2016) - [j41]Takeaki Uno, Yushi Uno:
Mining preserving structures in a graph sequence. Theor. Comput. Sci. 654: 155-163 (2016) - [c90]Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno:
Approximation and Hardness of Token Swapping. ESA 2016: 66:1-66:15 - [r2]Takeaki Uno:
Amortized Analysis on Enumeration Algorithms. Encyclopedia of Algorithms 2016: 72-76 - [r1]Takeaki Uno:
Frequent Pattern Mining. Encyclopedia of Algorithms 2016: 785-789 - [i14]Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno:
Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR abs/1602.05150 (2016) - 2015
- [j40]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: 81-94 (2015) - [c89]Takeaki Uno, Yushi Uno:
Mining Preserving Structures in a Graph Sequence. COCOON 2015: 3-15 - [c88]Masahiro Tomono, Takeaki Uno:
Map merging using cycle consistency check and RANSAC-based spanning tree selection. IROS 2015: 5662-5669 - [c87]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS 2015: 446-457 - [c86]Takeaki Uno:
Constant Time Enumeration by Amortization. WADS 2015: 593-605 - [c85]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: 138-153 - [i13]Takeaki Uno, Hiroki Maegawa, Takanobu Nakahara, Yukinobu Hamuro, Ryo Yoshinaka, Makoto Tatsuta:
Micro-Clustering: Finding Small Clusters in Large Diversity. CoRR abs/1507.03067 (2015) - 2014
- [j39]Keisuke Murakami, Takeaki Uno:
Efficient algorithms for dualizing large-scale hypergraphs. Discret. Appl. Math. 170: 83-94 (2014) - [j38]Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura:
Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree. IEICE Trans. Inf. Syst. 97-D(3): 421-430 (2014) - [j37]Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh:
Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms. J. Chem. Inf. Model. 54(4): 1027-1035 (2014) - [j36]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: 51-61 (2014) - [j35]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. 544: 14-31 (2014) - [j34]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: 71-84 (2014) - [c84]Takeaki Uno, Hiroko Satoh:
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. Discovery Science 2014: 313-324 - [c83]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: 230-239 - [c82]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: 364-375 - [c81]Xiaoliang Geng, Takuya Takagi, Hiroki Arimura, Takeaki Uno:
Enumeration of complete set of flock patterns in trajectories. IWGS 2014: 53-61 - [c80]Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. ISAAC 2014: 94-102 - [c79]Takanobu Nakahara, Takeaki Uno, Yukinobu Hamuro:
Prediction Model Using Micro-clustering. KES 2014: 1488-1494 - [c78]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: 422-436 - [c77]Insaf Setitra, Slimane Larabi, Takeaki Uno:
A Framework for Object Classification in Farfield Videos. WICON 2014: 159-166 - [i12]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR abs/1404.3501 (2014) - [i11]Takeaki Uno, Hiroko Satoh:
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. CoRR abs/1404.7610 (2014) - [i10]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR abs/1407.2036 (2014) - [i9]Takeaki Uno:
A New Approach to Efficient Enumeration by Push-out Amortization. CoRR abs/1407.3857 (2014) - [i8]Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. CoRR abs/1407.6140 (2014) - 2013
- [j33]Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano:
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. Discret. Math. Algorithms Appl. 5(2) (2013) - [j32]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Efficient algorithms for a simple network design problem. Networks 62(2): 95-104 (2013) - [c76]Keisuke Murakami, Takeaki Uno:
Efficient algorithms for dualizing large-scale hypergraphs. ALENEX 2013: 1-13 - [c75]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi, Takeaki Uno:
Mining-based compression approach of propositional formulae. CIKM 2013: 289-298 - [c74]Tetsushi Matsui, Takeaki Uno, Juzoh Umemori, Tsuyoshi Koide:
A New Approach to String Pattern Mining with Approximate Match. Discovery Science 2013: 110-125 - [c73]Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura:
Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. Discovery Science 2013: 308-323 - [c72]Xiaoliang Geng, Takeaki Uno, Hiroki Arimura:
Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. KDIR/KMIS 2013: 143-151 - [c71]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. ISAAC 2013: 339-349 - [c70]Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura:
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. SISAP 2013: 73-84 - [c69]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base Location Problems for Base-Monotone Regions. WALCOM 2013: 53-64 - 2012
- [j31]Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou:
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Algorithmica 62(3-4): 823-841 (2012) - [j30]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica 64(2): 311-325 (2012) - [j29]Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno:
Subgraph isomorphism in graph classes. Discret. Math. 312(21): 3164-3173 (2012) - [c68]Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura:
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. COCOON 2012: 347-359 - [c67]Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Hitori Number. FUN 2012: 334-345 - [c66]Xiaoliang Geng, Hiroki Arimura, Takeaki Uno:
Pattern Mining from Trajectory GPS Data. IIAI-AAI 2012: 60-65 - [c65]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381 - [c64]Takeaki Uno:
Efficient Computation of Power Indices for Weighted Majority Games. ISAAC 2012: 679-689 - [c63]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT 2012: 24-35 - [c62]Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
On Complexity of Flooding Games on Graphs with Interval Representations. TJJCCGG 2012: 73-84 - [c61]Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano:
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. WALCOM 2012: 5-16 - [i7]Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
On Complexity of Flooding Games on Graphs with Interval Representations. CoRR abs/1206.6201 (2012) - [i6]Takeaki Uno, Yushi Uno:
Mining Preserving Structures in a Graph Sequence. CoRR abs/1206.6202 (2012) - [i5]Franz J. Király, Louis Theran, Ryota Tomioka, Takeaki Uno:
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion. CoRR abs/1211.4116 (2012) - 2011
- [j28]Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. Electron. Notes Discret. Math. 38: 265-271 (2011) - [j27]Yoshio Okamoto, Takeaki Uno:
A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. Eur. J. Oper. Res. 210(1): 48-56 (2011) - [j26]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno:
Algorithmic Folding Complexity. Graphs Comb. 27(3): 341-351 (2011) - [j25]Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno:
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. 15(6): 727-751 (2011) - [c60]Shuji Kijima, Yoshio Okamoto, Takeaki Uno:
Dominating Set Counting in Graph Classes. COCOON 2011: 13-24 - [c59]Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno:
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462 - [c58]Benjamin Hellouin de Menibus, Takeaki Uno:
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. TAMC 2011: 483-494 - [i4]Keisuke Murakami, Takeaki Uno:
Efficient Algorithms for Dualizing Large-Scale Hypergraphs. CoRR abs/1102.3813 (2011) - [i3]Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. CoRR abs/1104.0122 (2011) - 2010
- [j24]Takeaki Uno:
An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem. Algorithmica 56(1): 3-16 (2010) - [j23]Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno:
Improved Bounds for Wireless Localization. Algorithmica 57(3): 499-516 (2010) - [j22]Abdul Rehman Abbasi, Matthew N. Dailey, Nitin V. Afzulpurkar, Takeaki Uno:
Student mental state inference from unintentional body gestures using dynamic Bayesian networks. J. Multimodal User Interfaces 3(1-2): 21-31 (2010) - [j21]Takeaki Uno:
Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data. Knowl. Inf. Syst. 25(2): 229-251 (2010) - [j20]Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno:
On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. 411(26-28): 2591-2601 (2010) - [j19]Yasuko Matsui, Ryuhei Uehara, Takeaki Uno:
Enumeration of the perfect sequences of a chordal graph. Theor. Comput. Sci. 411(40-42): 3635-3641 (2010) - [c57]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. COCOON 2010: 140-149 - [c56]Benjamin Négrevergne, Jean-François Méhaut, Alexandre Termier, Takeaki Uno:
Découverte d'itemsets fréquents fermés sur architecture multicoeurs. EGC 2010: 465-470 - [c55]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
UNO Is Hard, Even for a Single Player. FUN 2010: 133-144 - [c54]Benjamin Négrevergne, Alexandre Termier, Jean-François Méhaut, Takeaki Uno:
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses. HPCS 2010: 521-528 - [c53]Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo:
Levelwise Mesh Sparsification for Shortest Path Queries. ISAAC (1) 2010: 121-132 - [c52]Takanobu Nakahara, Takeaki Uno, Katsutoshi Yada:
Extracting Promising Sequential Patterns from RFID Data Using the LCM Sequence. KES (3) 2010: 244-253 - [c51]Shin-ichi Minato, Takeaki Uno:
Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases. SDM 2010: 339-349 - [c50]Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji Tsuda:
Single versus Multiple Sorting in All Pairs Similarity Search. ACML 2010: 145-160 - [i2]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
The complexity of UNO. CoRR abs/1003.2851 (2010)
2000 – 2009
- 2009
- [j18]Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda:
Enumeration of condition-dependent dense modules in protein interaction networks. Bioinform. 25(7): 933-940 (2009) - [j17]Kevin Buchin, Andreas Razen, Takeaki Uno, Uli Wagner:
Transforming spanning trees: A lower bound. Comput. Geom. 42(8): 724-730 (2009) - [j16]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. 24(3): 517-533 (2009) - [c49]Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura:
Efficient serial episode mining with minimal occurrences. ICUIMC 2009: 457-464 - [c48]Hiroki Arimura, Takeaki Uno:
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. SDM 2009: 1088-1099 - [c47]Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno:
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG 2009: 296-307 - [i1]Takeaki Uno, Masashi Sugiyama, Koji Tsuda:
Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method. CoRR abs/0904.3151 (2009) - 2008
- [j15]Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura:
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discret. Appl. Math. 156(11): 2050-2069 (2008) - [j14]Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara:
Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2): 229-242 (2008) - [j13]Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno:
A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008) - [c46]Abdul Rehman Abbasi, Matthew N. Dailey, Nitin V. Afzulpurkar, Takeaki Uno:
Probabilistic Prediction of Student Affect from Hand Gestures. ARCS 2008: 58-63 - [c45]Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno:
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467 - [c44]Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki:
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC 2008: 196-207 - [c43]Yasuko Matsui, Ryuhei Uehara, Takeaki Uno:
Enumeration of Perfect Sequences of Chordal Graph. ISAAC 2008: 859-870 - [c42]Shin-ichi Minato, Takeaki Uno, Hiroki Arimura:
LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. PAKDD 2008: 234-246 - [c41]Takeaki Uno:
An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data. PAKDD 2008: 345-356 - [c40]Takeaki Uno, Hiroki Arimura:
Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. PAKDD 2008: 357-368 - [c39]Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno:
Improved Bounds for Wireless Localization. SWAT 2008: 77-89 - 2007
- [j12]Hiroto Saigo, Takeaki Uno, Koji Tsuda:
Mining complex genotypic features for predicting HIV-1 drug resistance. Bioinform. 23(18): 2455-2462 (2007) - [j11]Elisabeth Georgii, Sabine Dietmann, Takeaki Uno, Philipp Pagel, Koji Tsuda:
Mining expression-dependent modules in the human interaction network. BMC Bioinform. 8(S-8) (2007) - [j10]Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno:
Matroid representation of clique complexes. Discret. Appl. Math. 155(15): 1910-1929 (2007) - [j9]Shungo Koichi, Satoru Iwata, Takeaki Uno, Hiroyuki Koshino, Hiroko Satoh:
Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information. J. Chem. Inf. Model. 47(5): 1734-1746 (2007) - [j8]Hiroki Arimura, Takeaki Uno:
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. J. Comb. Optim. 13(3): 243-262 (2007) - [c38]Abdul Rehman Abbasi, Takeaki Uno, Matthew N. Dailey, Nitin V. Afzulpurkar:
Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect. ACII 2007: 452-463 - [c37]Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir:
Weighted Substructure Mining for Image Analysis. CVPR 2007 - [c36]Hiroki Arimura, Takeaki Uno, Shinichi Shimozono:
Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science 2007: 42-55 - [c35]Takeaki Uno, Hiroki Arimura:
An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science 2007: 219-230 - [c34]Takeaki Uno:
An Efficient Algorithm for Enumerating Pseudo Cliques. ISAAC 2007: 402-414 - [c33]Yoshio Okamoto, Takeaki Uno:
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ISAAC 2007: 609-620 - [c32]Hiroki Arimura, Takeaki Uno:
Mining Maximal Flexible Patterns in a Sequence. JSAI 2007: 307-317 - [c31]Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku Kudo, Gökhan H. Bakir:
Weighted Substructure Mining for Image Analysis. MLG 2007 - [c30]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC 2007: 115-127 - [c29]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Efficient Algorithms for Airline Problem. TAMC 2007: 428-439 - 2006
- [j7]Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige:
An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. Discret. Appl. Math. 154(16): 2387-2401 (2006) - [j6]Masashi Kiyomi, Takeaki Uno:
Generating Chordal Graphs Included in Given Graphs. IEICE Trans. Inf. Syst. 89-D(2): 763-770 (2006) - [c28]Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff:
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. GD 2006: 270-281 - [c27]Ken Satoh, Ken Kaneiwa, Takeaki Uno:
Contradiction Finding and Minimal Recovery for UML Class Diagrams. ASE 2006: 277-280 - [c26]Ken Satoh, Takeaki Uno:
Enumerating Minimal Explanations by Minimal Hitting Set Computation. KSEM 2006: 354-365 - [c25]Masashi Kiyomi, Shuji Kijima, Takeaki Uno:
Listing Chordal Graphs and Interval Graphs. WG 2006: 68-77 - 2005
- [j5]Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura:
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Transp. Sci. 39(2): 206-232 (2005) - [c24]Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro:
Generalized Amazons is PSPACE-Complete. IJCAI 2005: 132-137 - [c23]Hiroki Arimura, Takeaki Uno:
An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ILP 2005: 1-19 - [c22]Hiroki Arimura, Takeaki Uno:
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC 2005: 724-737 - [c21]Ken Satoh, Takeaki Uno:
Enumerating Minimally Revised Specifications Using Dualization. JSAI Workshops 2005: 182-189 - [c20]Shin-Ichi Nakano, Takeaki Uno:
Generating Colored Trees. WG 2005: 249-260 - [c19]Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara:
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444 - [c18]Masashi Kiyomi, Takeaki Uno, Tomomi Matsui:
Efficient Algorithms for the Electric Power Transaction Problem. WINE 2005: 602-611 - 2004
- [j4]Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff:
Labeling Points with Weights. Algorithmica 38(2): 341-362 (2004) - [c17]Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura:
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. Discovery Science 2004: 16-31 - [c16]Takeaki Uno, Masashi Kiyomi, Hiroki Arimura:
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets. FIMI 2004 - [c15]Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige:
An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. IFIP TCS 2004: 251-264 - [c14]Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno:
A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC 2004: 89-100 - [c13]Kazuhisa Makino, Takeaki Uno:
New Algorithms for Enumerating All Maximal Cliques. SWAT 2004: 260-272 - [c12]Shin-Ichi Nakano, Takeaki Uno:
Constant Time Generation of Trees with Specified Diameter. WG 2004: 33-45 - 2003
- [c11]Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno:
Matroid Representation of Clique Complexes. COCOON 2003: 192-201 - [c10]Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano:
Discovering Frequent Substructures in Large Unordered Trees. Discovery Science 2003: 47-61 - [c9]Ken Satoh, Takeaki Uno:
Enumerating Maximal Frequent Sets Using Irredundant Dualization. Discovery Science 2003: 256-268 - [c8]Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura:
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI 2003 - [c7]Takeaki Uno, Ken Satoh:
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. FIMI 2003 - [c6]Shin-Ichi Nakano, Takeaki Uno:
More Efficient Generation of Plane Triangulations. GD 2003: 273-282 - 2001
- [c5]Takeaki Uno:
A Fast Algorithm for Enumerating Bipartite Perfect Matchings. ISAAC 2001: 367-379 - 2000
- [j3]Takeaki Uno, Mutsunori Yagiura:
Fast Algorithms to Enumerate All Common Intervals of Two Permutations. Algorithmica 26(2): 290-309 (2000)
1990 – 1999
- 1999
- [c4]Takeaki Uno:
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. COCOON 1999: 349-359 - 1998
- [c3]Takeaki Uno:
A New Approach for Speeding Up Enumeration Algorithms. ISAAC 1998: 287-296 - 1997
- [j2]Akiyoshi Shioura, Takeaki Uno:
A Linear Time Algorithm for Finding a k-Tree Core. J. Algorithms 23(2): 281-290 (1997) - [j1]Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno:
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. SIAM J. Comput. 26(3): 678-692 (1997) - [c2]Takeaki Uno:
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. ISAAC 1997: 92-101 - 1996
- [c1]Takeaki Uno:
An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. ISAAC 1996: 166-173
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
