4 citations · 9 across the 9 of their papers we have counts for
3 papers · 1 filter
Sorting Balls and Water: Equivalence and Computational Complexity
Takehiro Ito, Jun Kawahara, Shin-ichi Minato +7
Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps are popularized. In these puzzles, we are given a set of bins filled…
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…
On the Parameterized Complexity of Reconfiguration Problems
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman +2
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem takes as input two feasible…