| Publication | Date of Publication | Type |
|---|
Approximate majority analyses using tri-molecular chemical reaction networks
Natural Computing | 2024-02-09 | Paper |
Weak coverage of a rectangular barrier
Algorithmica | 2020-02-28 | Paper |
Design of nucleic acid strands with long low-barrier folding pathways
Natural Computing | 2019-07-10 | Paper |
| Simplifying analyses of chemical reaction networks for approximate majority | 2018-02-02 | Paper |
Combinatorial RNA design: designability and structure-approximating algorithm in Watson-Crick and Nussinov-Jacobson energy models
Algorithmica | 2017-11-09 | Paper |
| Pattern overlap implies runaway growth in hierarchical tile systems | 2017-10-10 | Paper |
Weak coverage of a rectangular barrier
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Pattern overlap implies runaway growth in hierarchical tile systems
(available as arXiv preprint) | 2017-03-30 | Paper |
Reachability bounds for chemical reaction networks and strand displacement systems
Natural Computing | 2016-04-15 | Paper |
Combinatorial RNA design: designability and structure-approximating algorithm
Combinatorial Pattern Matching | 2015-08-20 | Paper |
The complexity of string partitioning
Journal of Discrete Algorithms | 2015-05-04 | Paper |
On the gapped consecutive-ones property
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Hardness results on the gapped consecutive-ones property problem
Discrete Applied Mathematics | 2012-11-22 | Paper |
Step-wise tile assembly with a constant number of tile types
Natural Computing | 2012-11-15 | Paper |
Turing universality of step-wise and stage assembly at temperature 1
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Reachability bounds for chemical reaction networks and strand displacement systems
Lecture Notes in Computer Science | 2012-11-06 | Paper |
The Complexity of String Partitioning
Combinatorial Pattern Matching | 2012-08-14 | Paper |
A simple proof of Lerch's formula
Congressus Numerantium | 2012-05-10 | Paper |
Less haste, less waste: on recycling and its limits in strand displacement systems
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Tractability results for the consecutive-ones property with multiplicity
Combinatorial Pattern Matching | 2011-06-29 | Paper |
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
Natural Computing | 2011-05-23 | Paper |
Complexity of finding non-planar rectilinear drawings of graphs
Graph Drawing | 2011-02-11 | Paper |
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Lecture Notes in Computer Science | 2010-01-07 | Paper |
Step-assembly with a constant number of tile types
Algorithms and Computation | 2009-12-17 | Paper |
Spanning cubic graph designs
Discrete Mathematics | 2009-12-15 | Paper |
The odd-distance plane graph
Discrete & Computational Geometry | 2009-07-24 | Paper |
On the Generalised Character Compatibility Problem for Non-branching Character Trees
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices
Discrete Applied Mathematics | 2009-06-24 | Paper |
On the Complexity of Ordered Colorings
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Constructing Camin-Sokal Phylogenies Via Answer Set Programming
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Ordered 3-colorings
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Fault tolerant forwarding and optical indexes: A design theory approach
Journal of Combinatorial Designs | 2006-03-24 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
| scientific article; zbMATH DE number 2051830 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2051830 (Why is no real title available?) | 2004-03-07 | Paper |
On the computational complexity of infinite words.
Theoretical Computer Science | 2003-08-17 | Paper |
A defect theorem for bi-infinite words.
Theoretical Computer Science | 2003-01-22 | Paper |
| scientific article; zbMATH DE number 1834659 (Why is no real title available?) | 2002-11-25 | Paper |
On Conjugacy of Languages
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
On Conjugacy of Languages
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Multiple factorizations of words and defect effect
Theoretical Computer Science | 2002-07-15 | Paper |
Defect effect of Bi-infinite words in the two-element case
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
Defect effect of Bi-infinite words in the two-element case
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
| Characterization of a word by its subwords | 2001-04-04 | Paper |
Construction of Very Hard Functions for Multiparty Communication Complexity
RAIRO - Theoretical Informatics and Applications | 2000-08-06 | Paper |
Construction of Very Hard Functions for Multiparty Communication Complexity
RAIRO - Theoretical Informatics and Applications | 2000-08-06 | Paper |
| scientific article; zbMATH DE number 1418336 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1222603 (Why is no real title available?) | 1999-06-21 | Paper |
