STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An approximation algorithm for finding a long path in Hamiltonian graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
Proceedings of the 6th ACM conference on Electronic commerce
On finding spanning trees with few leaves
Information Processing Letters
| Hi-index | 0.00 |