| Publication | Date of Publication | Type |
|---|
Optimal staged self-assembly of linear assemblies
Natural Computing | 2024-02-09 | Paper |
Verification in staged tile self-assembly
Natural Computing | 2024-02-09 | Paper |
Resiliency to multiple nucleation in temperature-1 self-assembly
Natural Computing | 2023-11-30 | Paper |
| Packing cube nets into rectangles with \(O(1)\) holes | 2023-03-31 | Paper |
On the effects of hierarchical self-assembly for reducing program-size complexity
Theoretical Computer Science | 2021-11-11 | Paper |
Spanning properties of Theta-Theta-6
Graphs and Combinatorics | 2020-04-30 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Theoretical Computer Science | 2020-01-16 | Paper |
Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems
Natural Computing | 2019-07-08 | Paper |
Staged self-assembly and polyomino context-free grammars
Natural Computing | 2019-07-08 | Paper |
Nearly constant tile complexity for any shape in two-handed tile assembly
Algorithmica | 2019-06-27 | Paper |
Intrinsic universality in tile self-assembly requires cooperation
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Some open problems in polyomino tilings | 2018-11-22 | Paper |
| Freezing simulates non-freezing tile automata | 2018-11-08 | Paper |
| Optimal staged self-assembly of linear assemblies | 2018-10-18 | Paper |
| Non-determinism reduces construction time in active self-assembly using an insertion primitive | 2018-10-04 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Optimal staged self-assembly of general shapes
Algorithmica | 2018-05-23 | Paper |
Optimal staged self-assembly of general shapes
Algorithmica | 2018-05-23 | Paper |
| scientific article; zbMATH DE number 6846397 (Why is no real title available?) | 2018-03-02 | Paper |
The complexity of fixed-height patterned tile self-assembly
International Journal of Foundations of Computer Science | 2018-02-22 | Paper |
| Complexities for high-temperature two-handed tile self-assembly | 2018-02-02 | Paper |
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
(available as arXiv preprint) | 2018-01-30 | Paper |
Verification in staged tile self-assembly
Lecture Notes in Computer Science | 2017-08-31 | Paper |
Dipole codes attractively encode glue functions
Theoretical Computer Science | 2017-05-18 | Paper |
Tight bounds for active self-assembly using an insertion primitive
Algorithmica | 2017-03-03 | Paper |
Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
(available as arXiv preprint) | 2017-01-30 | Paper |
| Algorithms for designing pop-up cards | 2017-01-30 | Paper |
Diffuse reflection radius in a simple polygon
Algorithmica | 2016-12-21 | Paper |
Resiliency to multiple nucleation in temperature-1 self-assembly
Lecture Notes in Computer Science | 2016-11-30 | Paper |
The complexity of fixed-height patterned tile self-assembly
Lecture Notes in Computer Science | 2016-11-09 | Paper |
A brief tour of theoretical tile self-assembly
Cellular Automata and Discrete Complex Systems | 2016-08-10 | Paper |
Diffuse reflection diameter in simple polygons
Discrete Applied Mathematics | 2016-06-22 | Paper |
One-dimensional staged self-assembly
Natural Computing | 2016-03-10 | Paper |
An optimal algorithm for tiling the plane with a translated polyomino
Algorithms and Computation | 2016-01-11 | Paper |
Size-dependent tile self-assembly: constant-height rectangles and stability
Algorithms and Computation | 2016-01-11 | Paper |
Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Tight bounds for active self-assembly using an insertion primitive
Lecture Notes in Computer Science | 2014-10-08 | Paper |
Diffuse reflection radius in a simple polygon
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Staged self-assembly and polyomino context-free grammars
Lecture Notes in Computer Science | 2014-07-07 | Paper |
One tile to rule them all: simulating any tile assembly system with a single universal tile
Automata, Languages, and Programming | 2014-07-01 | Paper |
Constrained tri-connected planar straight line graphs
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Simultaneously flippable edges in triangulations
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Open guard edges and edge guards in simple polygons
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Bounded-degree polyhedronization of point sets
Computational Geometry | 2012-12-04 | Paper |
One-dimensional staged self-assembly
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Algorithms for solving Rubik's cubes
Algorithms – ESA 2011 | 2011-09-16 | Paper |
