Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate set covering in uniform hypergraphs
Journal of Algorithms
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximating the independence number via the j -function
Mathematical Programming: Series A and B
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
SIAM Journal on Discrete Mathematics
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Improved approximations of independent sets in bounded-degree graphs via subgraph removal
Nordic Journal of Computing
Improved Approximations of Independent Sets in Bounded-Degree Graphs
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Approximation Algorithms for the Partial Vertex Cover Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A new multilayered PCP and the hardness of hypergraph vertex cover
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A new approach for approximating node deletion problems
Information Processing Letters
Approximation algorithms for partial covering problems
Journal of Algorithms
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
Towards truthful mechanisms for binary demand games: a general framework
Proceedings of the 6th ACM conference on Electronic commerce
Partial covering of hypergraphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the multi-radius cover problem
Information Processing Letters
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
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
Randomized approximation of the stable marriage problem
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
An improved approximation algorithm for vertex cover with hard capacities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Vertex cover approximations on random graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Relational implementation of simple parallel evolutionary algorithms
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
A (2 - c1/√N)-approximation algorithm for the stable marriage problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A primal-dual approximation algorithm for partial vertex cover: making educated guesses
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Submodular integer cover and its application to production planning
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Vertex cover approximations: experiments and observations
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Automating security mediation placement
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Wireless capacity with arbitrary gain matrix
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Comparing Problem Solving Strategies for NP-hard Optimization Problems
Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications
| Hi-index | 0.02 |