papers

Publications (13)

cs.DM2025

Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents

William K. Moses, Amanda Redlich, Frederick Stock

We revisit the problem of \textsc{Broadcast}, introduced by Das, Giachoudis, Luccio, and Markou [OPODIS, 2020], where agents are initially placed on an node dynamic graph…

cs.CG2026

Sliding Cubes in Parallel

Hugo A. Akitaya, Joseph Dorfer, Peter Kramer +3

We study the classic sliding cube model for programmable matter under parallel reconfiguration in three dimensions, providing novel algorithmic and surprising complexity results in…

cs.CG2024

Minimum Plane Bichromatic Spanning Trees

Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine +3

For a set of red and blue points in the plane, a minimum bichromatic spanning tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endp…

cs.CG2024

A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves

Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers +2

In the modular robot reconfiguration problem, we are given cube-shaped modules (or robots) as well as two configurations, i.e., placements of the modules so that their unio…

math.MG2025

Deltahedral Domes over Equiangular Polygons

MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine +6

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant w…

cs.CG2025

Input-Sensitive Reconfiguration of Sliding Cubes

Hugo Akitaya, Matias Korman, Frederick Stock

A configuration of unit-cube-shaped \textit{modules} (or \textit{robots}) is a lattice-aligned placement of the modules so that their union is face-connected. The reconfigu…