14 citations · 69 across the 31 of their papers we have counts for
8 papers · 1 filter
Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm
Remy El Sabeh, Jessica Bohm, Zhiqian Ding +5
Programmable arrays of optical traps enable the assembly of configurations of single atoms to perform controlled experiments on quantum many-body systems. Finding the sequence of c…
Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm
Barry Cimring, Remy El Sabeh, Marc Bacvanski +5
We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using arrays of dynamic optical traps. Red-rec exploits simple heuristics…
On finding short reconfiguration sequences between independent sets
Akanksha Agrawal, Soumita Hait, Amer E. Mouawad
Assume we are given a graph , two independent sets and in of size , and a positive integer . The goal is to decide whether there exists a sequ…
Combinatorial and Algorithmic Aspects of Monadic Stability
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad +2
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Mon…
Token sliding on graphs of girth five
Valentin Bartier, Nicolas Bousquet, Jihad Hanna +2
In the Token Sliding problem we are given a graph and two independent sets and in of size . The goal is to decide whether there exists a sequence $\la…
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura +1
A graph vertex-subset problem defines which subsets of the vertices of an input graph are feasible solutions. We view a feasible solution as a set of tokens placed on the vertices…
Parallel Vertex Cover Algorithms on GPUs
Peter Yamout, Karim Barada, Adnan Jaljuli +2
Finding small vertex covers in a graph has applications in numerous domains. Two common formulations of the problem include: Minimum Vertex Cover, which finds the smallest vertex c…
Galactic Token Sliding
Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad
Given a graph and two independent sets and of size , the independent set reconfiguration problem asks whether there exists a sequence of -sized independent se…