Approximation Algorithms for the Longest Run Subsequence Problem Reviewed

Asahiro Y., Gong M., Lin G., Ono H., Eto H., Jansson J., Miyano E., Tanaka S.

Leibniz International Proceedings in Informatics, LIPIcs   259   2023.06

Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs Reviewed

Saito R., Eto H., Ito T., Uehara R.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   13973 LNCS   191 - 201   2023.01

Independent Set Under a Change Constraint from an Initial Solution Reviewed International journal

Asahiro Y., Eto H., Korenaga K., Lin G., Miyano E., Nonoue R.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   13898 LNCS   37 - 51   2023.01

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

Eto H., Ito T., Liu Z., Miyano E.

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   105 ( 9 )   1211 - 1222   2022.09

Reconfiguration of Regular Induced Subgraphs Reviewed

Eto H., Ito T., Kobayashi Y., Otachi Y., Wasa K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   13174 LNCS   35 - 46   2022.01

Happy Set Problem on Subclasses of Co-comparability Graphs Reviewed

Eto H., Ito T., Miyano E., Suzuki A., Tamura Y.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   13174 LNCS   149 - 160   2022.01

Parameterized algorithms for the Happy Set problem Reviewed

Asahiro Y., Eto H., Hanaka T., Lin G., Miyano E., Terabaru I.

Discrete Applied Mathematics   304   32 - 44   2021.12

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

Duarte G.L., Eto H., Hanaka T., Kobayashi Y., Kobayashi Y., Lokshtanov D., Pedrosa L.L.C., Schouery R.C.S., Souza U.S.

Algorithmica   83 ( 5 )   1421 - 1458   2021.05

Complexity and approximability of the happy set problem Reviewed

Asahiro Y., Eto H., Hanaka T., Lin G., Miyano E., Terabaru I.

Theoretical Computer Science   866   123 - 144   2021.04

Parameterized algorithms for the happy set problem Reviewed

Asahiro Y., Eto H., Hanaka T., Lin G., Miyano E., Terabaru I.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   12049 LNCS   323 - 328   2020.01

Graph Classes and Approximability of the Happy Set Problem Reviewed

Asahiro Y., Eto H., Hanaka T., Lin G., Miyano E., Terabaru I.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   12273 LNCS   335 - 346   2020.01

Parameterized algorithms for maximum cut with connectivity constraints Reviewed

Eto H., Hanaka T., Kobayashi Y., Kobayashi Y.

Leibniz International Proceedings in Informatics, LIPIcs   148   2019.12

Complexity of the minimum single dominating cycle problem for graph classes Reviewed

Eto H., Kawahara H., Miyano E., Nonoue N.

IEICE Transactions on Information and Systems   E101D ( 3 )   574 - 581   2018.03

Approximation algorithm for the distance-3 independent set problem on cubic graphs Reviewed

Eto H., Ito T., Liu Z., Miyano E.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   10167 LNCS   228 - 240   2017.01

Approximability of the distance independent set problem on regular graphs and planar graphs Reviewed

Eto H., Ito T., Liu Z., Miyano E.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   10043 LNCS   270 - 284   2016.01

Complexity of finding maximum regular induced subgraphs with prescribed degree Reviewed

Asahiro Y., Eto H., Ito T., Miyano E.

Theoretical Computer Science   550 ( C )   21 - 35   2014.01

Distance-d independent set problems for bipartite and chordal graphs Reviewed

Eto H., Guo F., Miyano E.

Journal of Combinatorial Optimization   27 ( 1 )   88 - 99   2014.01

Complexity of finding maximum regular induced subgraphs with prescribed degree Reviewed

Asahiro Y., Eto H., Ito T., Miyano E.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   8070 LNCS   28 - 39   2013.09

Inapproximability of maximum r-regular induced connected subgraph problems Reviewed

Asahiro Y., Eto H., Miyano E.

IEICE Transactions on Information and Systems   E96-D ( 3 )   443 - 449   2013.03

Distance-d independent set problems for bipartite and chordal graphs Reviewed

Eto H., Guo F., Miyano E.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7402 LNCS   234 - 244   2012.08