Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Probabilistic checking of proofs and hardness of approximation problems
Probabilistic checking of proofs and hardness of approximation problems
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An approximation scheme for planar graph TSP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the complexity of protein folding (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the complexity of protein folding (abstract)
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Simplicity and hardness of the maximum traveling salesman problem under geometric distances
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings and non-approximability of geometric problems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Hardness of TSP with Bounded Metrics
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The geometric maximum traveling salesman problem
Journal of the ACM (JACM)
8/7-approximation algorithm for (1,2)-TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
Information Processing Letters
Approximating Maximum Subgraphs without Short Cycles
SIAM Journal on Discrete Mathematics
A sample of samplers: a computational perspective on sampling
Studies in complexity and cryptography
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
Processing a trillion cells per mouse click
Proceedings of the VLDB Endowment
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |