A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the complexity of finding common approximate substrings
Theoretical Computer Science
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Computing the similarity of two sequences with nested arc annotations
Theoretical Computer Science
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science
Multiple genome rearrangement by swaps and by element duplications
Theoretical Computer Science
Polynomial algorithms for protein similarity search for restricted mRNA structures
Information Processing Letters
On parameterized complexity of the Multi-MCS problem
Theoretical Computer Science
A probabilistic beam search approach to the shortest common supersequence problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On the parameterized complexity of the Multi-MCT and Multi-MCST problems
Journal of Combinatorial Optimization
Lower bounds and parameterized approach for longest common subsequence
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Memetic algorithms with partial lamarckism for the shortest common supersequence problem
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
A comparison of evolutionary approaches to the shortest common supersequence problem
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Discrete Optimization
W[2]-hardness of precedence constrained K-processor scheduling
Operations Research Letters
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Hardness of longest common subsequence for sequences with bounded run-lengths
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On the space complexity of parameterized problems
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 5.23 |