12 citations · 21 across the 7 of their papers we have counts for
8 papers
FO Value Discovery and Partial Vertex Cover Discovery
Enna Gerhard, Stephanie Maaz, Pascale Schott +2
We study solution discovery in the token-sliding model from a logical and cost-value optimization perspective. In solution discovery, we are given a graph, an initial placement of…
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,…
On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers
Nicolas Bousquet, Amer E. Mouawad, Stephanie Maaz +2
Solution discovery asks whether a given (infeasible) starting configuration to a problem can be transformed into a feasible solution using a limited number of transformation steps.…
Kernelization Complexity of Solution Discovery Problems
Mario Grobler, Stephanie Maaz, Amer E. Mouawad +3
In the solution discovery variant of a vertex (edge) subset problem on graphs, we are given an initial configuration of tokens on the vertices (edges) of an input graph tog…
Solution discovery via reconfiguration for problems in P
Mario Grobler, Stephanie Maaz, Nicole Megow +4
In the recently introduced framework of solution discovery via reconfiguration [Fellows et al., ECAI 2023], we are given an initial configuration of tokens on a graph and the q…
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…
Parameterized complexity of reconfiguration of atoms
Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad +1
Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in…