| Publication | Date of Publication | Type |
|---|
| A sparse dynamic programming algorithm for solving the coding sequence design problem | 2026-01-28 | Paper |
The exact multiple pattern matching problem solved by a reference tree approach
Theoretical Computer Science | 2021-08-11 | Paper |
Computing a longest common almost-increasing subsequence of two sequences
Theoretical Computer Science | 2021-01-25 | Paper |
Two-string consensus problem under non-overlapping inversion and transposition distance
Information Processing Letters | 2017-11-22 | Paper |
An efficient algorithm for computing non-overlapping inversion and transposition distance
Information Processing Letters | 2016-08-16 | Paper |
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
Information Processing Letters | 2016-05-26 | Paper |
An efficient algorithm for one-sided block ordering problem under block-interchange distance
Theoretical Computer Science | 2015-12-08 | Paper |
A new filtration method and a hybrid strategy for approximate string matching
Theoretical Computer Science | 2013-11-29 | Paper |
An efficient algorithm for one-sided block ordering problem with block-interchange distance
Lecture Notes in Computer Science | 2013-06-11 | Paper |
On the full and bottleneck full Steiner tree problems
Lecture Notes in Computer Science | 2011-03-18 | Paper |
An improved algorithm for sorting by block-interchanges based on permutation groups
Information Processing Letters | 2010-09-07 | Paper |
An improved algorithm for finding a length-constrained maximum-density subtree in a tree
Information Processing Letters | 2010-06-09 | Paper |
Efficient algorithms for regular expression constrained sequence alignment
Information Processing Letters | 2010-03-24 | Paper |
Constrained sequence alignment: A general model and the hardness results
Discrete Applied Mathematics | 2007-11-30 | Paper |
Efficient Algorithms for Regular Expression Constrained Sequence Alignment
Combinatorial Pattern Matching | 2007-09-14 | Paper |
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science | 2005-09-22 | Paper |
The full Steiner tree problem
Theoretical Computer Science | 2005-01-18 | Paper |
| scientific article; zbMATH DE number 2089965 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080250 (Why is no real title available?) | 2004-08-04 | Paper |
Efficient minus and signed domination in graphs
Theoretical Computer Science | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1796978 (Why is no real title available?) | 2002-09-05 | Paper |
Perfect edge domination and efficient edge domination in graphs
Discrete Applied Mathematics | 2002-08-29 | Paper |
Weighted efficient domination problem on some perfect graphs
Discrete Applied Mathematics | 2002-05-15 | Paper |
Solving the weighted efficient edge domination problem on bipartite permutation graphs
Discrete Applied Mathematics | 1999-04-23 | Paper |
