14 citations · 69 across the 31 of their papers we have counts for
3 papers · 1 filter
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…
Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
Hanno von Bergen, Larissa Fastenau, Enna Gerhard +8
We study solution discovery, where the goal is to obtain a feasible solution to a problem from an initial configuration by a bounded sequence of local moves. In many applications,…
Finding Graph Isomorphisms in Heated Spaces in Almost No Time
Sara Najem, Amer E. Mouawad
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite…