| Publication | Date of Publication | Type |
|---|
SOBRA - shielding optimization for BRAchytherapy
Theoretical Computer Science | 2026-03-30 | Paper |
| Approximation and fixed parameter algorithms for the approximate cover problem | 2024-05-29 | Paper |
| Nesting Tasks Dataset for 2D-Nesting Efficiency Estimation | 2022-05-25 | Dataset |
| Nearest constrained circular words | 2020-12-16 | Paper |
On the approximability of the minimum weight t-partite clique problem
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
SOBRA -- shielding optimization for brachytherapy
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Approximation and hardness results for the maximum edges in transitive closure problem
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Approximation hardness of the cross-species conserved active modules detection problem
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Complexity insights of the minimum duplication problem
Theoretical Computer Science | 2014-03-27 | Paper |
Minimum mosaic inference of a set of recombinants
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
A faster algorithm for finding minimum Tucker submatrices
Theory of Computing Systems | 2012-12-07 | Paper |
Medians of an odd number of permutations
PU.M.A. Pure Mathematics and Applications | 2012-09-18 | Paper |
Hardness of longest common subsequence for sequences with bounded run-lengths
Combinatorial Pattern Matching | 2012-08-14 | Paper |
An algorithmic view on multi-related-segments: a unifying model for approximate common interval
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Complexity insights of the minimum duplication problem
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
On the parameterized complexity of the repetition free longest common subsequence problem
Information Processing Letters | 2012-05-04 | Paper |
Algorithmic aspects of heterogeneous biological networks comparison
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
A polynomial-time algorithm for finding a minimal conflicting set containing a given row
Computer Science – Theory and Applications | 2011-06-17 | Paper |
A faster algorithm for finding minimum Tucker submatrices
Programs, Proofs, Processes | 2010-07-29 | Paper |
Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Extending the Hardness of RNA Secondary Structure Comparison
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
Journal of Discrete Algorithms | 2009-02-23 | Paper |
How to Compare Arc-Annotated Sequences: The Alignment Hierarchy
String Processing and Information Retrieval | 2008-09-04 | Paper |
What Makes the Arc-Preserving Subsequence Problem Hard?
Transactions on Computational Systems Biology II | 2008-03-19 | Paper |
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science | 2007-10-18 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
