Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the complexity of approximating the independent set problem
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
The complexity of the max word problem and the power of one-way interactive proof systems
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Covering edges by cliques with regard to keyword conflicts and intersection graphs
Communications of the ACM
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A taxonomy of proof systems (part 2)
ACM SIGACT News
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient probabilistic checkable proofs and applications to approximation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized graph products, chromatic numbers, and Lovasz j-function
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the hardness of approximating optimum schedule problems in store and forward networks
IEEE/ACM Transactions on Networking (TON)
Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Analysis of greedy expert hiring and an application to memory-based learning (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems
IEEE Transactions on Computers
Cluster-cover: a theoretical framework for a class of VLSI-CAD optimization problems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Restricted dynamic Steiner trees for scalable multicast in datagram networks
IEEE/ACM Transactions on Networking (TON)
Covering rectilinear polygons with axis-parallel rectangles
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Guaranteeing fair service to persistent dependent tasks
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An O(log*n) approximation algorithm for the asymmetric p-center problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling with conflicts, and applications to traffic signal control
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic analysis for scheduling with conflicts
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Reconstructing a history of recombinations from a set of sequences
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimum positioning of base stations for cellular radio networks
Wireless Networks
Approximation algorithms for general parallel task scheduling
Information Processing Letters
Using computational learning strategies as a tool for combinatorial optimization
Annals of Mathematics and Artificial Intelligence
A Note on the Approximation of a Minimum-Weight Maximal Independent Set
Computational Optimization and Applications
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Max- and Min-Neighborhood Monopolies
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Communication Complexity of Approximate Set Packing and Covering
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Generalized Graph Colorability and Compressibility of Boolean Formulae
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Scatter Search for Graph Coloring
Selected Papers from the 5th European Conference on Artificial Evolution
Learning Sub-classes of Monotone DNF on the Uniform Distribution
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Automatic Subspace Clustering of High Dimensional Data
Data Mining and Knowledge Discovery
The minimum-entropy set cover problem
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
On the futility of blind search: An algorithmic view of “no free lunch”
Evolutionary Computation
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Discrete Applied Mathematics
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The complexity of theory revision
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
The complexity of theory revision
Artificial Intelligence
Three-quarter approximation for the number of unused colors in graph coloring
Information Sciences: an International Journal
An algorithm for multicast tree generation in networks with asymmetric links
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On the partition of 3-colorable graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Parallel Repetition in Projection Games and a Concentration Bound
SIAM Journal on Computing
Efficient fuzzy search in large text collections
ACM Transactions on Information Systems (TOIS)
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations
Journal of Combinatorial Optimization
Hi-index | 0.01 |