The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A new approximate graph coloring algorithm
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Planar 3-colorability is polynomial complete
ACM SIGACT News
On approximation algorithms for microcode bit minimization
MICRO 21 Proceedings of the 21st annual workshop on Microprogramming and microarchitecture
An O(n0.4)-approximation algorithm for 3-coloring
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Data Transfers in Broadcast Networks
IEEE Transactions on Computers
Scheduling algorithms for multi-hop radio networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
On the hardness of approximating minimization problems
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)
Randomized graph products, chromatic numbers, and Lovasz j-function
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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)
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Coloring k-colorable graphs using smaller palettes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Robust algorithms for restricted domains
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Coloring k-colorable graphs using relatively small palettes
Journal of Algorithms
Bounds on the Performance of Message Routing Heuristics
IEEE Transactions on Computers
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Coloring 2-colorable hypergraphs with a sublinear number of colors
Nordic Journal of Computing
Approximate coloring of uniform hypergraphs
Journal of Algorithms
Robust algorithms for restricted domains
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the complexity of approximating k-set packing
Computational Complexity
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Combinatorial optimization in system configuration design
Automation and Remote Control
ZerehCache: armoring cache architectures in high defect density technologies
Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture
Three-quarter approximation for the number of unused colors in graph coloring
Information Sciences: an International Journal
Note: A simple algorithm for 4-coloring 3-colorable planar graphs
Theoretical Computer Science
Reliably detecting connectivity using local graph traits
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Linear index coding via semidefinite programming
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A novel approach for leveraging co-occurrence to improve the false positive error in signature files
Journal of Discrete Algorithms
Recognizing 3-colorings cycle-patterns on graphs
Pattern Recognition Letters
Algorithms for channel assignment in mobile wireless networks using temporal coloring
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |