3 citations · 7 across the 10 of their papers we have counts for
10 papers
Orientable Burning Number of Graphs
Julien Courtiel, Paul Dorbec, Tatsuya Gima +2
In this paper, we introduce the problem of finding an orientation of a given undirected graph that maximizes the burning number of the resulting directed graph. We show that the pr…
Minimum Consistent Subset for Trees Revisited
Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi +2
In a vertex-colored graph , a subset is said to be consistent if every vertex has a nearest neighbor in with the same color. The problem of computin…
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond
Tesshu Hanaka, Hirotaka Ono, Yota Otachi +1
A dominating set of graph is called an -grouped dominating set if can be partitioned into such that the size of each unit is and the s…
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +2
Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study…
Reconfiguration of Cliques in a Graph
Takehiro Ito, Hirotaka Ono, Yota Otachi
We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-st…
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs
Takehiro Ito, Yota Otachi, Toshiki Saitoh +6
Consider an undirected graph modeling a social network, where the vertices represent users, and the edges do connections among them. In the competitive diffusion game, each of a nu…