Hiroshi ETO

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)
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)