Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Approximating vertex cover on dense graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
On the hardness of approximating stopping and trapping sets
IEEE Transactions on Information Theory
Proximity algorithms for nearly-doubling spaces
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximating edge dominating set in dense graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Approximating edge dominating set in dense graphs
Theoretical Computer Science
A tight analysis of the maximal matching heuristic
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Approximating vertex cover in dense hypergraphs
Journal of Discrete Algorithms
| Hi-index | 5.29 |