Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh 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
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third 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
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Finding Large Independent Sets in Polynomial Expected Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The side-chain positioning problem: a semidefinite programming formulation with new rounding schemes
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function
Computational Optimization and Applications
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Solution sets for DCOPs and graphical games
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Finding Large Independent Sets in Polynomial Expected Time
Combinatorics, Probability and Computing
On a restricted cross-intersection problem
Journal of Combinatorial Theory Series A
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
INFORMS Journal on Computing
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximations of weighted independent set and hereditary subset problems
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász-Schrijver Hierarchy
SIAM Journal on Computing
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Maximum cliques in graphs with small intersection number and random intersection graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
SDP-based algorithms for maximum independent set problems on hypergraphs
Theoretical Computer Science
| Hi-index | 0.00 |