Introduction to algorithms
Multiple alignment, communication cost, and graph matching
SIAM Journal on Applied Mathematics
Approximation Algorithms for Multiple Sequence Alignment
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Near optimal multiple alignment within a band in polynomial time
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A data tracking scheme for general networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A Variant of the Arrow Distributed Directory with Low Average Complexity
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
The non-approximability of bicriteria network design problems
Journal of Discrete Algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
A tight upper bound on the probabilistic embedding of series-parallel graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Near optimal multiple alignment within a band in polynomial time
Journal of Computer and System Sciences
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A fast algorithm for computing minimum routing cost spanning trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the bias and performance of the edge-set encoding
IEEE Transactions on Evolutionary Computation
Constructing light spanning trees with small routing cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
SIAM Journal on Discrete Mathematics
Multi-source trees: algorithms for minimizing eccentricity cost metrics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |