An O(n0.4)-approximation algorithm for 3-coloring
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithms column: the vertex cover problem
ACM SIGACT News
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
Randomized approximation of the stable marriage problem
Theoretical Computer Science - Special papers from: COCOON 2003
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Approximating the dense set-cover problem
Journal of Computer and System Sciences
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Improved approximation results for the stable marriage problem
ACM Transactions on Algorithms (TALG)
A 1.875: approximation algorithm for the stable marriage problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On extracting consistent graphs in wireless sensor networks
International Journal of Sensor Networks
Algorithms and Implementation for Interconnection Graph Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Distributed weighted vertex cover via maximal matchings
ACM Transactions on Algorithms (TALG)
On hard instances of approximate vertex cover
ACM Transactions on Algorithms (TALG)
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science
Reoptimization of Weighted Graph and Covering Problems
Approximation and Online Algorithms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A better approximation ratio for the vertex cover problem
ACM Transactions on Algorithms (TALG)
PTAS for connected vertex cover in unit disk graphs
Theoretical Computer Science
Combinatorics, Probability and Computing
Randomized approximation of the stable marriage problem
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
On the complexity of approximating colored-graph problems extended abstract
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Vertex cover approximations on random graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Approximability and hardness in multi-objective optimization
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
On the approximability of the vertex cover and related problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
Strong and weak edges of a graph and linkages with the vertex cover problem
Discrete Applied Mathematics
Kernels for the vertex cover problem on the preferred attachment model
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A tight analysis of the maximal matching heuristic
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Distributed weighted vertex cover via maximal matchings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A (2 - c1/√N)-approximation algorithm for the stable marriage problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover
ACM Transactions on Algorithms (TALG)
Vertex cover approximations: experiments and observations
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Minimum weight covering problems in stochastic environments
Information Sciences: an International Journal
| Hi-index | 0.00 |