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
Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
A new approximate graph coloring algorithm
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Exact complexity of exact-four-colorability
Information Processing Letters
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters
A Linear--time Tissue P System Based Solution for the 3--coloring Problem
Electronic Notes in Theoretical Computer Science (ENTCS)
Polychromatic colorings of plane graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
Theoretical Computer Science
On the 2-Dimensional Channel Assignment Problem
IEEE Transactions on Computers
Integral cycle bases for cyclic timetabling
Discrete Optimization
| Hi-index | 0.00 |