( en | de | ru )

 

Disambiguation of "Eto, Hiroshi"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Algorithms for the Happy Set Problem.

, , , , , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 323-328. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hiroshi Kawabe

Hiroshi Murata

Hiroshi Kubota

Hiroshi Uchida

Angy Etou

 

Other publications of authors with the same name

Corrigendum to "Complexity and approximability of the happy set problem" Theor. Comput. Sci. 866 (2021) 123-144., , , , , and . Theor. Comput. Sci., (October 2023)Graph Classes and Approximability of the Happy Set Problem., , , , , and . COCOON, volume 12273 of Lecture Notes in Computer Science, page 335-346. Springer, (2020)Reconfiguration of Regular Induced Subgraphs., , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 35-46. Springer, (2022)Parameterized Algorithms for Maximum Cut with Connectivity Constraints., , , and . IPEC, volume 148 of LIPIcs, page 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1211-1222 (September 2022)Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs., , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 228-240. Springer, (2017)Parameterized Algorithms for the Happy Set Problem., , , , , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 323-328. Springer, (2020)Distance-d Independent Set Problems for Bipartite and Chordal Graphs., , and . COCOA, volume 7402 of Lecture Notes in Computer Science, page 234-244. Springer, (2012)Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs., , , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 191-201. Springer, (2023)Computing the Largest Bond and the Maximum Connected Cut of a Graph., , , , , , , , and . Algorithmica, 83 (5): 1421-1458 (2021)