| Publication | Date of Publication | Type |
|---|
| Approximate majority analyses using tri-molecular chemical reaction networks | 2024-02-09 | Paper |
| Weak coverage of a rectangular barrier | 2020-02-28 | Paper |
| Design of nucleic acid strands with long low-barrier folding pathways | 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 | 2017-11-09 | Paper |
| Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems | 2017-10-10 | Paper |
| Weak coverage of a rectangular barrier | 2017-07-21 | Paper |
| Pattern overlap implies runaway growth in hierarchical tile systems | 2017-03-30 | Paper |
| Reachability bounds for chemical reaction networks and strand displacement systems | 2016-04-15 | Paper |
| Combinatorial RNA Design: Designability and Structure-Approximating Algorithm | 2015-08-20 | Paper |
| The complexity of string partitioning | 2015-05-04 | Paper |
| On the gapped consecutive-ones property | 2013-10-10 | Paper |
| Hardness results on the gapped consecutive-ones property problem | 2012-11-22 | Paper |
| Step-wise tile assembly with a constant number of tile types | 2012-11-15 | Paper |
| Turing Universality of Step-Wise and Stage Assembly at Temperature 1 | 2012-11-06 | Paper |
| Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems | 2012-11-06 | Paper |
| The Complexity of String Partitioning | 2012-08-14 | Paper |
| A simple proof of Lerch's formula | 2012-05-10 | Paper |
| Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems | 2011-09-16 | Paper |
| Tractability Results for the Consecutive-Ones Property with Multiplicity | 2011-06-29 | Paper |
| NP-completeness of the energy barrier problem without pseudoknots and temporary arcs | 2011-05-23 | Paper |
| Complexity of Finding Non-Planar Rectilinear Drawings of Graphs | 2011-02-11 | Paper |
| NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots | 2010-01-07 | Paper |
| Step-Assembly with a Constant Number of Tile Types | 2009-12-17 | Paper |
| Spanning cubic graph designs | 2009-12-15 | Paper |
| The odd-distance plane graph | 2009-07-24 | Paper |
| On the Generalised Character Compatibility Problem for Non-branching Character Trees | 2009-07-23 | Paper |
| Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices | 2009-06-24 | Paper |
| On the Complexity of Ordered Colorings | 2009-05-27 | Paper |
| Haplotype Inferring Via Galled-Tree Networks Is NP-Complete | 2008-07-10 | Paper |
| Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis | 2008-07-10 | Paper |
| Constructing Camin-Sokal Phylogenies Via Answer Set Programming | 2008-05-27 | Paper |
| Ordered 3-colorings | 2007-05-29 | Paper |
| Fault tolerant forwarding and optical indexes: A design theory approach | 2006-03-24 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453871 | 2004-03-07 | Paper |
| On the computational complexity of infinite words. | 2003-08-17 | Paper |
| A defect theorem for bi-infinite words. | 2003-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779155 | 2002-11-25 | Paper |
| On Conjugacy of Languages | 2002-09-18 | Paper |
| Multiple factorizations of words and defect effect | 2002-07-15 | Paper |
| Defect effect of Bi-infinite words in the two-element case | 2002-01-07 | Paper |
| Characterization of a word by its subwords | 2001-04-04 | Paper |
| Construction of Very Hard Functions for Multiparty Communication Complexity | 2000-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941898 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218145 | 1999-06-21 | Paper |
