2 citations · 2 across the 2 of their papers we have counts for
3 papers
Characterizing Universal Reconfigurability of Modular Pivoting Robots
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi +7
We give both efficient algorithms and hardness results for reconfiguring between two connected configurations of modules in the hexagonal grid. The reconfiguration moves that we co…
Reconfiguration of Connected Graph Partitions via Recombination
Hugo A. Akitaya, Matias Korman, Oliver Korten +2
Motivated by applications in gerrymandering detection, we study a reconfiguration problem on connected partitions of a connected graph . A partition of is \emph{connected…
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players
Jeffrey Bosboom, Charlotte Chen, Lily Chung +12
We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, prov…