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)
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating asymmetric maximum TSP
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A New Bound for the 2-Edge Connected Subgraph Problem
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Separation of Simple Comb Inequalities
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
Mathematics of Operations Research
On the relative strength of split, triangle and quadrilateral cuts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The nonidealness index of rank-ideal matrices
Discrete Applied Mathematics
Spanning closed walks and TSP in 3-connected planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A proof of the Boyd-Carr conjecture
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Not every GTSP facet induces an STSP facet
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
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
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Operations Research Letters
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
Operations Research Letters
Lift-and-project ranks of the set covering polytope of circulant matrices
Discrete Applied Mathematics
TSP tours in cubic graphs: beyond 4/3
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.01 |