On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Multiple genome rearrangement by swaps and by element duplications
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
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |