| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2022-12-06 09:55 |
Ehime | Ehime Univ. Media Hall |  COMP2022-22 |
組合せ遷移，グラフアルゴリズム，点素パス [more] | COMP2022-22 pp.9-13 |
| COMP | 2021-12-03 10:30 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Complexity of reconfiguration of regular induced subgraphs Hiroshi Eto, Takehiro Ito (Tohoku Univ), Yasuaki Kobayashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech) COMP2021-22 |
[more] | COMP2021-22 pp.9-10 |
| COMP | 2020-12-04 16:30 |
Online | Online | Approximation algorithms for the maximum happy set problem Yuichi Asahiro (Kyushu Sangyo Univ), Hiroshi Eto (Kyushu Univ), Tesshu Hanaka (Chuo Univ), Guohui Lin (U. Alberta), Eiji Miyano, Ippei Terabaru (Kyutech) COMP2020-26 |
[more] | COMP2020-26 pp.39-43 |
| COMP | 2018-09-18 16:25 |
Fukuoka | Kyusyu Institute of Technology | Triangulation with Many/Few Triangles Hiroshi Eto (Kyushu Univ), Tesshu Hanaka (Chuo Univ), Eiji Miyano, Ayumi Nishijima (Kyutech), Hirotaka Ono (Nagoya Univ), Yota Otachi (Kumamoto Univ), Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht Univ) COMP2018-19 |
[more] | COMP2018-19 pp.69-76 |
| COMP, IPSJ-AL | 2017-05-13 11:00 |
Nagasaki | Approximability of the distance independent set problem on cubic graphs Hiroshi Eto (Kyushu Univ), Takehiro Ito (Tohoku Univ), Zhilong Liu, Eiji Miyano (Kyutech) COMP2017-7 |
[more] | COMP2017-7 pp.47-54 |
|
| COMP | 2015-10-02 14:30 |
Tokyo | Complexity of Single Dominating Cycle Problems Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano (Kyutech) COMP2015-27 |
[more] | COMP2015-27 pp.29-34 |
|
| COMP | 2013-09-03 15:35 |
Tottori | Finding Maximum Regular Induced Subgraphs with Prescribed Degree Yuichi Asahiro (Kyushu Sangyo Univ.), Takehiro Ito (Tohoku Univ.), Hiroshi Eto, Eiji Miyano (Kyushu Inst. of Tech.) COMP2013-31 |
We study the problem of finding a maximum vertex-subset $S$ of a given graph $G$ such that the subgraph $G[S]$ induced b... [more] | COMP2013-31 pp.43-50 |
|
| COMP | 2012-06-21 14:10 |
Hokkaido | Hokkaido University | Complexity results of distance-d independent set problems Hiroshi Eto, Fengrui Guo, Eiji Miyano (Kyutech) COMP2012-19 |
[more] | COMP2012-19 pp.57-63 |
| COMP | 2011-06-30 15:15 |
Hiroshima | Hiroshima Univ. | Complexity of Maximum r-Regular Induced Connected Subgraph Problems Yuichi Asahiro (Kyushu Sangyo Univ), Hiroshi Eto, Eiji Miyano (Kyutech) COMP2011-21 |
[more] | COMP2011-21 pp.39-44 |
[Return to Top Page]