A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Generating automatically tuned bitmaps from outlines
Journal of the ACM (JACM)
Semidefinite Programming Relaxation for NonconvexQuadratic Programs
Journal of Global Optimization
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |