Hiroshi Eto

Complexity and approximability of the happy set problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Theor. Comput. Sci., 866 123-144, 2021

Computing the Largest Bond and the Maximum Connected Cut of a Graph.

Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza

Algorithmica, 83(5) 1421-1458, 2021

Parameterized Algorithms for the Happy Set Problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

WALCOM: Algorithms and Computation - 14th International Conference(WALCOM), 323-328, 2020

Graph Classes and Approximability of the Happy Set Problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Computing and Combinatorics - 26th International Conference(COCOON), 335-346, 2020

Parameterized Algorithms for Maximum Cut with Connectivity Constraints

Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi

CoRR, abs/1908.03389 13-15, Aug 9, 2019

Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes.

Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue

IEICE Trans. Inf. Syst., 101-D(3) 574-581, 2018

Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs.

Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

WALCOM: Algorithms and Computation, 11th International Conference and Workshops(WALCOM), 228-240, 2017

Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs.

Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

Combinatorial Optimization and Applications - 10th International Conference(COCOA), 270-284, 2016

Complexity of finding maximum regular induced subgraphs with prescribed degree.

Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano

Theor. Comput. Sci., 550 21-35, 2014

Distance- $$d$$ independent set problems for bipartite and chordal graphs.

Hiroshi Eto, Fengrui Guo, Eiji Miyano

J. Comb. Optim., 27(1) 88-99, 2014

Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.

Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano

Fundamentals of Computation Theory - 19th International Symposium(FCT), 28-39, 2013

Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems.

Yuichi Asahiro, Hiroshi Eto, Eiji Miyano

IEICE Trans. Inf. Syst., 96-D(3) 443-449, 2013

Distance-d Independent Set Problems for Bipartite and Chordal Graphs.

Hiroshi Eto, Fengrui Guo, Eiji Miyano

Combinatorial Optimization and Applications - 6th International Conference(COCOA), 234-244, 2012

Papers

Menu

Coauthors