Search

Ján Maňuch

The complexity of string partitioning
Less haste, less waste: on recycling and its limits in strand displacement systems
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
An algorithm for the energy barrier problem without pseudoknots and temporary arcs
Complexity of finding non-planar rectilinear drawings of graphs
Complexity of a collision-aware string partition problem and its relation to oligo design for gene synthesis

Powered by the Academic theme for Hugo.