19 citations · 46 across the 18 of their papers we have counts for
24 papers
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard
Michael Hoffmann, Jayson Lynch, Andrew Winslow
We consider the computational complexity of winning this turn (mate-in-1 or "finding lethal") in Hearthstone as well as several other single turn puzzle types introduced in the Boo…
Spanning Properties of Theta-Theta-6
Mirela Damian, John Iacono, Andrew Winslow
We show that, unlike the Yao-Yao graph , the Theta-Theta graph defined by six cones is a spanner for sets of points in convex position. We also show that, for sets of…
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect
Jean Cardinal, Erik D. Demaine, David Eppstein +2
We consider the computational complexity of reconfiguration problems, in which one is given two combinatorial configurations satisfying some constraints, and is asked to transform…
Verification in Staged Tile Self-Assembly
Robert Schweller, Andrew Winslow, Tim Wylie
We prove the unique assembly and unique shape verification problems, benchmark measures of self-assembly model power, are -hard and contained in $\math…
The Complexity of Fixed-Height Patterned Tile Self-Assembly
Shinnosuke Seki, Andrew Winslow
We characterize the complexity of the PATS problem for patterns of fixed height and color count in variants of the model where seed glues are either chosen or fixed and identical (…
Design of Geometric Molecular Bonds
David Doty, Andrew Winslow
An example of a nonspecific molecular bond is the affinity of any positive charge for any negative charge (like-unlike), or of nonpolar material for itself when in aqueous solution…