fontsize
Search

Undergraduate and Graduate Schools

Home > Undergraduate and Graduate Schools > Faculty Members List > Department of Computer Science and Engineering > WASA, Kunihiro

WASA, Kunihiro

Affiliation Department of Computer Science and Engineering
Title Assistant professor
Fields of Research Computer science
Degree Ph. D of Computer Science
Academic Societies Information Processing Society of Japan, The Japanese Society for Artificial Intelligence, the Institute of Electronics, The Information and Communication Engineers
E-mail wasa@cs
Please append ".tut.ac.jp" to the end of the address above.
Researcher information URL(researchmap) Researcher information

Theme1:Subgraph enumeration problem

Overview

You have come to a new city. When you wonder how to get to the station, you first look at a map to find a route. In most cases, it is sufficient to find one path. However, if you will be staying there for a week and you want to walk around the city, you want to find several ways to get to the station. The enumeration problem can be interpreted as an abstract representation of the situation. That is, the problem is to output all (or a specified number) of feasible solutions for a given input. This includes not only finding good routes, but also combinations of frequently purchased goods, feature extraction for machine learning, candidate useful compounds, and much more. Enumeration problems are very interesting not only in practice but also in theory. In this study, we focus on, in particular, enumeration problems for graph structures. Our goal is to develop efficient algorithms to solve them.

Selected publications and works

Alessio Conte, Mamadou M. Kanté, Yota Otachi, Takeaki Uno, and Kunihiro Wasa, "Efficient Enumeration of Maximal k-Degenerate Induced Subgraphs of a Chordal Graph," Theoretical Computer Science, August 10, 2018, in press. doi: 10.1016/j.tcs.2018.08.009;
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, and Hiroki Arimura, "Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four", IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E101-A, No.9, pp.1383-1391, September 01, 2018. doi: 10.1587/transfun.E101.A.1383;
Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, and Hiroki Arimura, "Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree", IEICE TRANSACTIONS on Information and Systems, Vol.E97-D, No.3, pp.421-430, March 01, 2014. doi: 10.1587/transinf.E97.D.421;

Keywords

Enumeration problems, graph theory

to Page top