On better heuristic for euclidean Steiner minimum trees (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Discrete Applied Mathematics - ARIDAM IV and V
Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Aligning sequences via an evolutionary tree: complexity and approximation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Multiple Alignment of Biological Sequences with Gap Flexibility
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Better approximation bounds for the network and Euclidean Steiner tree problems
Better approximation bounds for the network and Euclidean Steiner tree problems
Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Approximation algorithms for constrained generalized tree alignment problem
Discrete Applied Mathematics
| Hi-index | 0.00 |