3 citations · 7 across the 32 of their papers we have counts for
49 papers
W[1]-Hardness of Upper Clique Transversal
J. Pascal Gollin, Pascal J. Gollin, Tesshu Hanaka +3
A clique transversal of a graph is a set of vertices intersecting every maximal clique. We prove that deciding whether a graph has an inclusion-wise minimal clique transversal of s…
Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense
Tesshu Hanaka, Nicolás Honorato-Droguett, Hirotaka Ono +2
In this paper, we study graph editing problems on geometric intersection graphs. For a tuple of geometric objects in some Euclidean space, let $G_\mat…
On the Complexity of Secluded Path Problems
Tesshu Hanaka, Daisuke Tsuru
This paper investigates the complexity of finding secluded paths in graphs. We focus on the \textsc{Short Secluded Path} problem and a natural new variant we introduce, \textsc{Sho…
Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
Tesshu Hanaka, Nikolaos Melissinos, Hirotaka Ono
Coordinating the movement of multiple autonomous agents over a shared network is a fundamental challenge in algorithmic robotics, intelligent transportation, and distributed system…
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
Tesshu Hanaka, Yuto Okada, Yota Otachi +1
We study the parameterized complexity of the problems of finding a maximum common (induced) subgraph of two given graphs. Since these problems generalize several NP-complete proble…
Finding a HIST: Chordality, Structural Parameters, and Diameter
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
A homeomorphically irreducible spanning tree (HIST) is a spanning tree with no degree-2 vertices, serving as a structurally minimal backbone of a graph. While the existence of HIST…