Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
On the complexity of the single-move labeled token routing problem
Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad +1
In neutral-atom quantum computers, atoms are moved to target positions along paths of empty positions, and a target position may be reserved for one species of atom. Motivated by t…
cs.CC2025
On the complexity of constrained reconfiguration and motion planning
Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad +1
Coordinating the motion of multiple agents in constrained environments is a fundamental challenge in robotics, motion planning, and scheduling. A motivating example involves ro…