From the 3 of 10 linked papers with an AI index.
1 citations · 1 across the 6 of their papers we have counts for
10 papers
Complexity of induced subgraph isomorphism and maximum common induced subgraph parameterized by cluster vertex deletion number
Tomohiro Koana, Soh Kumabe, Yota Otachi
We study the parameterized complexity of Induced Subgraph Isomorphism (ISI) and Maximum Common Induced Subgraph (MCIS) with respect to the cluster vertex deletion number . For I…
A Single-Exponential FPT Algorithm for 2-Vertex-Connectivity Augmentation
Tomohiro Koana, Soh Kumabe
We study restricted-link augmentation to -vertex-connectivity. An instance consists of a graph , possibly disconnected, a set of admissible links on its vertices, integer…
Sensitivity and Differential Privacy in Metric Voting with Distortion below Three
Shinsaku Sakaue, Kaito Fujii, Soh Kumabe +1
The paper proposes randomized voting rules that achieve a metric distortion slightly below three while maintaining low worst‑case sensitivity and providing approximate differential…
Kernelization for -Packing Revisited
Tomohiro Koana, Soh Kumabe
The paper investigates kernelization for the H‑Packing problem, providing improved polynomial kernels for various subdivided‑star patterns and proving compression lower bounds for…
Complexity of graph-state preparation by Clifford circuits
Soh Kumabe, Ryuhei Mori, Yusei Yoshimura
In this work, we study the complexity of graph-state preparation in a general model of quantum algorithms that allows measurements in the computational basis, single-qubit Clifford…
Frameworks to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi +4
Finding a \emph{single} best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world probl…