I agree that this site is using cookies. You can find further informations here.
X
Eto, Hiroshi
592  results:
Search for persons X
?
1

Directed Path Partition Problem on Directed Acyclic Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Eto, Hiroshi ; Kawaharada, Shunsuke ; Lin, Guohui.. - p. 314-326 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Saito, Rin ; Eto, Hiroshi ; Ito, Takehiro. - p. 191-201 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Independent Set Under a Change Constraint from an Initial S..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Asahiro, Yuichi ; Eto, Hiroshi ; Korenaga, Kana... - p. 37-51 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Corrigendum to "Complexity and approximability of the happy..:

Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu...
Theoretical Computer Science.  975 (2023)  - p. 114114 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Happy Set Problem on Subclasses of Co-comparability Graphs:

Eto, Hiroshi ; Ito, Takehiro ; Miyano, Eiji..
Algorithmica.  85 (2022)  11 - p. 3327-3347 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Reconfiguration of Regular Induced Subgraphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Eto, Hiroshi ; Ito, Takehiro ; Kobayashi, Yasuaki.. - p. 35-46 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Happy Set Problem on Subclasses of Co-comparability Graphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Eto, Hiroshi ; Ito, Takehiro ; Miyano, Eiji.. - p. 149-160 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Approximability of the Distance Independent Set Problem on ..:

ETO, Hiroshi ; ITO, Takehiro ; LIU, Zhilong.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences.  E105.A (2022)  9 - p. 1211-1222 , 2022
Link: https://doi.org/10.1587/..
 
?
9

Computing the Largest Bond and the Maximum Connected Cut of..:

Duarte, Gabriel L. ; Eto, Hiroshi ; Hanaka, Tesshu...
Algorithmica.  83 (2021)  5 - p. 1421-1458 , 2021
Link: https://doi.org/10.1007/..
 
?
10

Parameterized algorithms for the Happy Set problem:

Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu...
Discrete Applied Mathematics.  304 (2021)  - p. 32-44 , 2021
Link: https://doi.org/10.1016/..
 
?
11

Complexity and approximability of the happy set problem:

Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu...
Theoretical Computer Science.  866 (2021)  - p. 123-144 , 2021
Link: https://doi.org/10.1016/..
 
?
12

Parameterized Algorithms for the Happy Set Problem:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu... - p. 323-328 , 2020
Link: https://doi.org/10.1007/..
 
?
13

Graph Classes and Approximability of the Happy Set Problem:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu... - p. 335-346 , 2020
Link: https://doi.org/10.1007/..
 
?
14

Selective Suppression of Cell Growth and Programmed Cell De..:

Teruya, Kiichiro ; Kusumoto, Yoshihiro ; Eto, Hiroshi..
Marine Drugs.  17 (2019)  7 - p. 421 , 2019
Link: https://doi.org/10.3390/..
 
?
15

Complexity of the Minimum Single Dominating Cycle Problem f..:

ETO, Hiroshi ; KAWAHARA, Hiroyuki ; MIYANO, Eiji.
IEICE Transactions on Information and Systems.  E101.D (2018)  3 - p. 574-581 , 2018
Link: https://doi.org/10.1587/..
 
1-15