Author

Y. Otachi

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Complexity of induced subgraph isomorphism and maximum common induced subgraph parameterized by cluster vertex deletion number

The results reveal that, in this setting, MCIS is strictly harder than ISI, and it is shown that it becomes NP-hard already when each input graph has cluster vertex deletion number 2.

Tomohiro Koana, Soh Kumabe, Y. Otachi · 0 citations