IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 9 of 9  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2022-12-06
Ehime Ehime Univ. Media Hall COMP2022-22 組合せ遷移,グラフアルゴリズム,点素パス [more] COMP2022-22
COMP 2021-12-03
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
COMP 2020-12-04
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
COMP 2018-09-18
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
COMP, IPSJ-AL 2017-05-13
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
COMP 2015-10-02
Tokyo   Complexity of Single Dominating Cycle Problems
Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano (Kyutech) COMP2015-27
 [more] COMP2015-27
COMP 2013-09-03
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
COMP 2012-06-21
Hokkaido Hokkaido University Complexity results of distance-d independent set problems
Hiroshi Eto, Fengrui Guo, Eiji Miyano (Kyutech) COMP2012-19
 [more] COMP2012-19
COMP 2011-06-30
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
 Results 1 - 9 of 9  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan