Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Coloring k-colorable graphs using smaller palettes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
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
Hardness results for approximate hypergraph coloring
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On semidefinite programming relaxations for graph coloring and vertex cover
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Coloring k-colorable graphs using relatively small palettes
Journal of Algorithms
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Fitting Points on the Real Line and Its Application to RH Mapping
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Approximate coloring of uniform hypergraphs
Journal of Algorithms
Fitting points on the real line and its application to RH mapping
Journal of Algorithms
Robust algorithms for restricted domains
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Machine Learning
Logarithmic inapproximability of the radio broadcast problem
Journal of Algorithms
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Journal of Algorithms
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Conditional hardness for approximate coloring
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An agent-based algorithm for generalized graph colorings
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On hard instances of approximate vertex cover
ACM Transactions on Algorithms (TALG)
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
3-coloring in time O (1.3289n)
Journal of Algorithms
Note: A simple algorithm for 4-coloring 3-colorable planar graphs
Theoretical Computer Science
On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
Hardness and algorithms for rainbow connection
Journal of Combinatorial Optimization
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
On the partition of 3-colorable graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
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
Recognizing 3-colorings cycle-patterns on graphs
Pattern Recognition Letters
| Hi-index | 0.89 |