97 citations · 113 across the 13 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
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…
cs.CC2016★ 2 cited
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka
The problems of Permutation Routing via Matching and Token Swapping are reconfiguration problems on graphs. This paper is concerned with the complexity of those problems and a colo…