| Publication | Date of Publication | Type |
|---|
Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem
Scientific Annals of Computer Science | 2024-08-15 | Paper |
DNA-guided assembly of nanocellulose meshes
Theory and Practice of Natural Computing | 2023-10-16 | Paper |
Chemical reaction networks associated with the Hilbert's 16th problem. Limit cycles and stability analysis
| 2021-10-18 | Paper |
Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem
| 2018-08-15 | Paper |
Computational modelling of the kinetic tile assembly model using a rule-based approach
Theoretical Computer Science | 2017-12-06 | Paper |
An excursion through quantitative model refinement
Membrane Computing | 2016-02-26 | Paper |
Quantitative model refinement as a solution to the combinatorial size explosion of biomodels
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
Search methods for tile sets in patterned DNA self-assembly
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
Theoretical Computer Science | 2014-01-10 | Paper |
Self-assembly models of variable resolution
Lecture Notes in Computer Science | 2013-04-03 | Paper |
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Synthesizing small and reliable tile sets for patterned DNA self-assembly
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Towards a neighborhood simplification of tile systems: from Moore to quasi-linear dependencies
Natural Computing | 2011-05-23 | Paper |
An extension of the Lyndon-Schützenberger result to pseudoperiodic words
Information and Computation | 2011-04-28 | Paper |
scientific article; zbMATH DE number 5605080 (Why is no real title available?)
| 2009-09-19 | Paper |
On the descriptional complexity of Watson-Crick automata
Theoretical Computer Science | 2009-08-07 | Paper |
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
Developments in Language Theory | 2009-07-07 | Paper |
Unambiguous automata
Mathematics in Computer Science | 2008-09-08 | Paper |
Parallel communicating Watson-Crick automata systems
| 2007-10-26 | Paper |
A tight linear bound on the synchronization delay of bijective automata
Theoretical Computer Science | 2007-07-16 | Paper |
On the power of parallel communicating Watson-Crick automata systems
Theoretical Computer Science | 2006-09-14 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
Theoretical Computer Science | 2004-10-27 | Paper |
scientific article; zbMATH DE number 1951585 (Why is no real title available?)
| 2003-07-21 | Paper |
