research
∙
06/02/2021
The Hardest Explicit Construction
We investigate the complexity of explicit construction problems, where t...
share
research
∙
12/14/2020
Characterizing Universal Reconfigurability of Modular Pivoting Robots
We give both efficient algorithms and hardness results for reconfiguring...
research
∙
11/14/2020
Reconfiguration of Connected Graph Partitions via Recombination
Motivated by applications in gerrymandering detection, we study a reconf...
research
∙
02/10/2020
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players
We analyze the computational complexity of several new variants of edge-...
research
∙
11/18/2019