Takeaki Uno

National Institute of Informatics — Japan

Computer Science · Physical Sciences

33h-index4.9kcitations315works0.42yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(105), Algorithms and Data Compression(59), Complexity and Algorithms in Graphs(51), Data Management and Algorithms(48), Data Mining Algorithms and Applications(44)

Publications315 total

Learning Multi-Order Block Structure in Higher-Order Networks
arXiv (Cornell University)·2025Open Access
A heuristic algorithm for the cluster editing problem
Computational Optimization and Applications·2025
Listing maximal H-free subgraphs
Discrete Applied Mathematics·2025Open Access
Sample-Cluster-Select: A new framework to obtain diverse approximate solutions of combinatorial optimization problems
arXiv (Cornell University)·2025Open Access
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
Algorithmica·2025Open Access
Inference and visualization of community structure in attributed hypergraphs using mixed-membership stochastic block models
Social Network Analysis and Mining·2025· 1 citedOpen Access
Inference and Visualization of Community Structure in Grant Collaboration Hypergraphs
Studies in computational intelligence·2025
Interdisciplinary Discussions for Future Computer Science
2025Open Access
Methodologies for Fruitful Interdisciplinary Discussions
2025Open Access
Nonblocking conditions for Clos fabrics with non-uniform switch radixes
Journal of Optical Communications and Networking·2024· 2 cited
Evolution of COVID-19 Vaccination-related Topics on Twitter
Transactions of the Japanese Society for Artificial Intelligence·2024Open Access
Inferring community structure in attributed hypergraphs using stochastic block models
2024· 2 citedOpen Access
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
arXiv (Cornell University)·2024Open Access
Parameterized Complexity of Finding Dissimilar Shortest Paths
arXiv (Cornell University)·2024Open Access
Listing the bonds of a graph in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e865" altimg="si19.svg"><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mo>˜</mml:mo></mml:mrow></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>–delay
Discrete Applied Mathematics·2024· 1 cited
Finding Diverse Strings and Longest Common Subsequences in a Graph
arXiv (Cornell University)·2024· 1 citedOpen Access
Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Models
arXiv (Cornell University)·2024Open Access
On the hardness of inclusion-wise minimal separators enumeration
Information Processing Letters·2023· 3 citedOpen Access
Sorting balls and water: Equivalence and computational complexity
Theoretical Computer Science·2023· 1 cited
On the hardness of inclusion-wise minimal separators enumeration
arXiv (Cornell University)·2023Open Access
page 1 of 16Next →

Frequent Co-authors

Hiroki Arimura(9), Masashi Kiyomi(4), Koji Tsuda(4), Tatsuya Asai(3), Mutsunori Yagiura(3), Keisuke Takahashi(3), Lauren Takahashi(3), Jun Fujima(3), Hiroko Satoh(3), Junya Ohyama(3), Shun Nishimura(3), Shin-ichi Nakano(3), Vincent Limouzy(3), Arnaud Mary(3), Kazuhisa Makino(2), Yuzo Uchida(2), Toshihide Ibaraki(2), Shinji Imahori(2), Itsuki Miyazato(2), Koichi Ohno(2)