The isoperimetric number of random regular graphs
European Journal of Combinatorics
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Towards a 4/3 approximation for the asymmetric traveling salesman problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On Some Tighter Inapproximability Results, Further Improvements
On Some Tighter Inapproximability Results, Further Improvements
On the Edge-Expansion of Graphs
Combinatorics, Probability and Computing
An explicit lower bound for TSP with distances one and two
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Approximation algorithms for time-dependent orienteering
Information Processing Letters
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximation Hardness of the Steiner Tree Problem on Graphs
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximation Hardness of TSP with Bounded Metrics
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for Time-Dependent Orienteering
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Theoretical Computer Science
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Journal of Computer and System Sciences
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Journal of Algorithms
LP-based solution methods for the asymmetric TSP
Information Processing Letters
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research
The Steiner tree problem on graphs: Inapproximability results
Theoretical Computer Science
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
On the approximation hardness of some generalizations of TSP
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 0.03 |