Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
Finding k points with minimum diameter and related problems
Journal of Algorithms
New algorithms for minimum area k-gons
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation for the k-MST problem in the plane
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Online algorithms for selective multicast and maximal dense trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Finding subsets maximizing minimum structures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Bypass rates: reducing query abandonment using negative inferences
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Static manycast routing and wavelength assignment over wavelength-routed optical WDM networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
QoS-based manycasting over optical burst-switched (OBS) networks
IEEE/ACM Transactions on Networking (TON)
Algorithmics in intensity-modulated radiation therapy
Algorithms and theory of computation handbook
A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Shape rectangularization problems in intensity-modulated radiation therapy
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Improved steiner tree algorithms for bounded treewidth
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
On finding minimum cost tree for multi-resource manycast in mesh networks
Optical Switching and Networking
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
Journal of Combinatorial Optimization
| Hi-index | 0.00 |