IEICE Trans

Eiji MIYANO

Complexity of the Maximum k-Path Vertex Cover Problem Eiji MIYANO Toshiki SAITOH Ryuhei UEHARA Tsuyoshi YAGITA Tom C. van der ZANDEN
Publication: Publication Date: 2020/10/01 Vol. E103-A No. 10 pp. 1193-1201 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: complexity theory Keyword: Maximum k-path vertex cover, NP-hardness, polynomial time algorithm, split graphs, bounded treewidth,
	Summary \| Full Text:PDF(1.9MB)

An Approximation Algorithm for the Maximum Induced Matching Problem on C₅-Free Regular Graphs Yuichi ASAHIRO Guohui LIN Zhilong LIU Eiji MIYANO
Publication: Publication Date: 2019/09/01 Vol. E102-A No. 9 pp. 1142-1149 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Optimization Keyword: induced matching problem, C₅-free regular graph, approximation algorithm,
	Summary \| Full Text:PDF(1.4MB)

Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes Hiroshi ETO Hiroyuki KAWAHARA Eiji MIYANO Natsuki NONOUE
Publication: Publication Date: 2018/03/01 Vol. E101-D No. 3 pp. 574-581 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — Frontiers of Theoretical Computer Science —) Category: Keyword: minimum single dominating problem, graph classes, (in)tractability, (in)approximability,
	Summary \| Full Text:PDF(456.6KB)

Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes Daiki HOSHIKA Eiji MIYANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2016/06/01 Vol. E99-A No. 6 pp. 1059-1066 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: element-disjoint Steiner tree packing, bounded terminal nodes, approximation algorithms,
	Summary \| Full Text:PDF(756.5KB)

Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems Yuichi ASAHIRO Hiroshi ETO Eiji MIYANO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/03/01 Vol. E96-D No. 3 pp. 443-449 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —) Category: Keyword: induced connected subgraph, regularity, NP-hardness, inapproximability,
	Summary \| Full Text:PDF(443.6KB)

FOREWORD Eiji MIYANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2011/06/01 Vol. E94-A No. 6 pp. 1221-1221 Type of Manuscript: FOREWORD Category: Keyword:
	Summary \| Full Text:PDF(92KB)

Computational Complexities of University Interview Timetabling Naoyuki KAMIYAMA Yuuki KIYONARI Eiji MIYANO Shuichi MIYAZAKI Katsuhisa YAMANAKA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/02/01 Vol. E92-D No. 2 pp. 130-140 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: timetable, scheduling, optimization, computational complexity,
	Summary \| Full Text:PDF(602.5KB)

The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics Takahiro YUKIZANE Shin-ya OHI Eiji MIYANO Hideo HIROSE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2006/08/01 Vol. E89-D No. 8 pp. 2332-2339 Type of Manuscript: INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing) Category: Keyword: data mining, data science, bump hunting, genetic algorithm, extreme-value statistics, trade-off curve, decision tree, bootstrap,
	Summary \| Full Text:PDF(668.3KB)

Recent Developments in Mesh Routing Algorithms Kazuo IWAMA Eiji MIYANO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/03/25 Vol. E83-D No. 3 pp. 530-540 Type of Manuscript: INVITED SURVEY PAPER Category: Parallel and Distributed Algorithms Keyword: parallel computation, meshes, packet routing,
	Summary \| Full Text:PDF(390.9KB)