Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Asymptotic experimental analysis for the Held-Karp traveling salesman bound
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Finding the right cutting planes for the TSP
Journal of Experimental Algorithmics (JEA)
A New Bound for the 2-Edge Connected Subgraph Problem
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Finding the Exact Integrality Gap for Small Traveling Salesman Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Finding the Right Cutting Planes for the TSP
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Improved approximations for tour and tree covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research
Deterministic Sampling Algorithms for Network Design
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Asymmetric traveling salesman path and directed latency problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
TSP on cubic and subcubic graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A proof of the Boyd-Carr conjecture
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improving christofides' algorithm for the s-t path TSP
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the integrality gap of the subtour LP for the 1,2-TSP
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Analysis of the Held-Karp lower bound for the asymmetric TSP
Operations Research Letters
The parsimonious property of cut covering problems and its applications
Operations Research Letters
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Operations Research Letters
| Hi-index | 0.89 |