Eiji MIYANO


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 problemgraph 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 packingbounded terminal nodesapproximation 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 subgraphregularityNP-hardnessinapproximability
 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: 
timetableschedulingoptimizationcomputational 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 miningdata sciencebump huntinggenetic algorithmextreme-value statisticstrade-off curvedecision treebootstrap
 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 computationmeshespacket routing
 Summary | Full Text:PDF(390.9KB)