Yota Otachi | Graduate School Of Information Sciences Tohoku University.
スポンサーリンク
概要
関連著者
-
Yota Otachi
Graduate School of Information Sciences, Tohoku University.
-
Yota Otachi
Graduate School Of Information Sciences Tohoku University.
-
Katsuhisa Yamanaka
Graduate School of Information Systems, University of Electro-communications.
-
Katsuhisa Yamanaka
Graduate School Of Information Systems University Of Electro-communications.
-
Yoshio Okamoto
Center for Graduate Education Initiative, JAIST
-
Yoshio Okamoto
Center For Graduate Education Initiative Jaist
-
Masanobu Ishikawa
Department of Computer Science, Gunma University.
-
Shin-ichiNakano
Department of Computer Science, Gunma University.
-
Ryuhei Uehara
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Uehara Ryuhei
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Masanobu Ishikawa
Department Of Computer Science Gunma University.
-
Toshiki Saitoh
Japan Advanced Institute Of Science And Technology
-
Hirotaka Ono
Kyushu University
-
Toshiki Saitoh
Erato Minato Discrete Structure Manipulation System Project Japan Science And Technology Agency.
-
Ryuhei Uehara
School Of Information Science Jaist
-
Koichi Yamazaki
Department Of Computer Science Gunma University.
-
Takeaki Uno
National Institute Of Informatics
-
Shuji Kijima
Graduate School of Information Science and Electrical Engineering, Kyushu University
-
Hirotaka Ono
Department of Economic Engineering, Kyushu University.
-
Yushi Uno
Department of Mathematics and Information Sciences, Graduate School of Science, Osaka Prefecture Uni
-
Shuji Kijima
Graduate School Of Information Science And Electrical Engineering Kyushu University
-
Hirotaka Ono
Department Of Economic Engineering Kyushu University.
-
Yushi Uno
Department Of Mathematics And Information Sciences Graduate School Of Science Osaka Prefecture Unive
-
Toshiki Saitoh
Graduate School of Engineering, Kobe University
著作論文
- Enumerating All Rooted Trees Including k Leaves
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
- Approximating the path-distance-width for k-cocomparability graphs