Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
On linear-time algorithms for five-coloring planar graphs
Information Processing Letters
On the linear vertex-arboricity of a planar graph
Journal of Graph Theory
Acyclic colorings of planar graphs
Discrete Mathematics
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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)
Extremal results on defective colorings of graphs
Discrete Mathematics
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Embedding graphs in an arbitrary surface in linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficiently four-coloring planar graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some Connections Between Set Theory and Computer Science
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Two linear-time algorithms for five-coloring a planar graph
Two linear-time algorithms for five-coloring a planar graph
Planar 3-colorability is polynomial complete
ACM SIGACT News
On achieving software diversity for improved network security using distributed coloring algorithms
Proceedings of the 11th ACM conference on Computer and communications security
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Distributed deterministic edge coloring using bounded neighborhood independence
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |