The algebraic degree of geometric optimization problems
Discrete & Computational Geometry
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Two algorithmic results for the traveling salesman problem
Mathematics of Operations Research
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Designing least-cost nonblocking broadband networks
Journal of Algorithms
Mathematical Programming: Series A and B
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Linear time bounds for median computations
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On minimum stars, minimum Steiner stars, and maximum matchings
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Computational geometry column 37
ACM SIGACT News
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
The Lazy Bureaucrat scheduling problem
Information and Computation
Journal of Experimental Algorithmics (JEA)
Robust artificial landmark recognition using polar histograms
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP
Discrete Applied Mathematics
| Hi-index | 0.00 |