15 citations · 65 across the 24 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
Approximation and Hardness for Token Swapping
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto +3
Given a graph with , we place on every vertex a token . A swap is an exchange of tokens on adjacent vertices. We consider the algorithmi…