A new polynomial-time algorithm for linear programming
Combinatorica
There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Generating sparse spanners for weighted graphs
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Proceedings of the international symposium on Optimal algorithms
Which triangulations approximate the complete graph?
Proceedings of the international symposium on Optimal algorithms
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Approximating Euclidean Distances by Small Degree Graphs
Approximating Euclidean Distances by Small Degree Graphs
Degree-Constrained Pyramid Spanners
Degree-Constrained Pyramid Spanners
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Geodesic Spanners on Polyhedral Surfaces
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |