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  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 24  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
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 2018-09-18
16:50
Fukuoka Kyusyu Institute of Technology (In)approximability of Packing Directed Acyclic Graph Problems
Tsuyoshi Yagita (Kyutech), Yuichi Asahiro (Kyushu Sangyo Univ), Eiji Miyano (Kyutech) COMP2018-20
 [more] COMP2018-20
pp.77-84
ISEC, COMP 2017-12-21
11:50
Kochi Eikokuji Campus, Kochi University of Technology Maximum k-path Vertex Cover Problem on Graph Classes
Tsuyoshi Yagita, Eiji Miyano, Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht U.) ISEC2017-76 COMP2017-30
This paper introduces the maximum version of the $k$-path vertex cover problem, called the textsc{Maximum $k$-Path Verte... [more] ISEC2017-76 COMP2017-30
pp.25-31
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-12-21
16:05
Okinawa Okinawa Industry Support Center Approximability of graph orientation problems with degree constraints
Yuichi Asahiro (Kyushu Sangyo Univ.), Jesper Jansson (Kyoto Univ.), Eiji Miyano (Kyushu Institute of Technology), Hirotaka Ono (Kyushu Univ.) COMP2013-58
A degree-constrained graph orientation of an undirected graph is an assignment of a direction to each
edge in the graph... [more]
COMP2013-58
pp.123-130
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, IPSJ-AL 2013-05-17
09:55
Hokkaido Otaru University of Commerce Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Five Terminals
Daiki Hoshika, Eiji Miyano (Kyushu Inst. of Tech.) COMP2013-9
In this paper we study the maximum packing element-disjoint Steiner tree
problem(element-disjoint MaxPST problem, for s... [more]
COMP2013-9
pp.7-12
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-12-16
13:30
Aichi Nagoya Univ. Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation
Yuichi Asahiro (Kyushu Sangyo Univ.), Jesper Jansson (Ochanomizu Univ.), Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.) COMP2011-41
 [more] COMP2011-41
pp.37-44
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
COMP 2010-12-03
16:35
Fukuoka Kyutech Plaza, Kyushu Institute of Technology Maximum Domination Problem
Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.) COMP2010-46
We consider new variants of the vertex/edge domination
problems on graphs. A vertex is said to {\em dominate} itself an... [more]
COMP2010-46
pp.53-60
COMP 2010-06-25
14:00
Tokyo Tokyo Tech Line Embeddings of Complete Binary Trees
Masao Kumamoto, Eiji Miyano (Kyushu Inst. of Tech.) COMP2010-19
 [more] COMP2010-19
pp.23-28
COMP 2008-05-13
10:40
Fukuoka Kyushu Sangyo University NP-Hardness of the Sorting Buffer Problem on the Unifrom Metric
Yuichi Asahiro (Kyushu Sangyo Univ.), Kenichi Kawahara, Eiji Miyano (Kyushu Inst of Tech) COMP2008-8
 [more] COMP2008-8
pp.1-8
COMP 2007-05-25
10:40
Fukuoka Kyushu University On Approximation of Bookmark Assignments
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (Kyushu Inst of Tech), Hirotaka Ono (Kyushu Univ.), Toshihide Murata (Kyushu Inst of Tech) COMP2007-11
 [more] COMP2007-11
pp.1-6
COMP 2006-12-04
10:00
Aichi Nagoya University weighted nearest neighbor algorithms for the graph exploration problem on cycles
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.), Takuro Yoshimuta (KIT)
 [more] COMP2006-43
pp.15-22
COMP 2006-06-23
10:35
Saitama Saitama Univ. On the Computational Complexity of Interview Timetabling Problems
Yuuki Kiyonari, Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.)
 [more] COMP2006-18
pp.7-14
COMP 2006-03-22
14:30
Tokyo The University of Electro-Communications Approximability and Non-approximability of the Minimum Block Transfer Problem
Yuichi Asahiro (Kyushu Sangyo Univ.), Tetsuya Furukawa (Kyushu Univ.), Keiichi Ikegami, Eiji Miyano (Kyushu Inst. of Tech.)
 [more] COMP2005-59
pp.17-24
COMP 2005-10-18
16:30
Miyagi Tohoku Univ. On the Graph Orientation of Minimizing the Maximum Outdegree
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.), Kouhei Zenmyo (Kyushu Inst. of Tech.)
 [more] COMP2005-43
pp.53-60
 Results 1 - 20 of 24  /  [Next]  
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