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
Minimum Restricted Diameter Spanning Trees
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Minimum restricted diameter spanning trees
Discrete Applied Mathematics
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
Orientation matters: how to efficiently solve ocst problems with problem-specific EAs
Proceedings of the 10th annual conference on Genetic and evolutionary computation
On Optimal Solutions for the Optimal Communication Spanning Tree Problem
Operations Research
On the bias and performance of the edge-set encoding
IEEE Transactions on Evolutionary Computation
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |