3 citations · 7 across the 32 of their papers we have counts for
3 papers · 1 filter
Optimal Partition of a Tree with Social Distance
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
We study the problem to find a partition of \textcolor{black}{a} graph with maximum social welfare based on social distance between vertices in , called MaxSWP. This problem…
Parameterized Orientable Deletion
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis +2
A graph is -orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most . -orientability is a well-studied concept with close…
Reconfiguring spanning and induced subgraphs
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta +5
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertice…