4 citations · 18 across the 22 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CG2022
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains
Erik D. Demaine, Hiro Ito, Jayson Lynch +1
Planar/flat configurations of fixed-angle chains and trees are well studied in the context of polymer science, molecular biology, and puzzles. In this paper, we focus on a simple t…
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…