On Polyhedral Approximations of the Second-Order Cone
Mathematics of Operations Research
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Communication Complexity
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the Complexity of Nonnegative Matrix Factorization
SIAM Journal on Optimization
Constructing extended formulations from reflection relations
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Extended Formulations for Polygons
Discrete & Computational Geometry
| Hi-index | 0.00 |