Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
On Copositive Programming and Standard Quadratic Optimization Problems
Journal of Global Optimization
Lagrangian bounds in multiextremal polynomial and discrete optimization problems
Journal of Global Optimization
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Semidefinite programming for discrete optimization and matrix completion problems
Discrete Applied Mathematics
The bundle method for hard combinatorial optimization problems
Combinatorial optimization - Eureka, you shrink!
Cardinality constrained minimum cut problems: complexity and algorithms
Discrete Applied Mathematics
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Improving an Upper Bound on the Stability Number of a Graph
Journal of Global Optimization
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Efficient decoupling capacitor planning via convex programming methods
Proceedings of the 2006 international symposium on Physical design
Integrality gaps for sparsest cut and minimum linear arrangement problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A semidefinite programming-based heuristic for graph coloring
Discrete Applied Mathematics
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Spectral clustering with inconsistent advice
Proceedings of the 25th international conference on Machine learning
Canonical subsets of image features
Computer Vision and Image Understanding
Cuts for Conic Mixed-Integer Programming
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Improved approximation bound for quadratic optimization problems with orthogonality constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Combining different types of scale space interest points using canonical sets
SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
Binary positive semidefinite matrices and associated integer polytopes
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Approximation of canonical sets and their applications to 2D view simplification
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Stable bounded canonical sets and image matching
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Automatica (Journal of IFAC)
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
Operations Research Letters
A probabilistic result for the max-cut problem on random graphs
Operations Research Letters
Identifying valuable customers on social networking sites for profit maximization
Expert Systems with Applications: An International Journal
Electronic Commerce Research and Applications
An electromagnetism metaheuristic for solving the Maximum Betweenness Problem
Applied Soft Computing
Sparsest cut on quotients of the hypercube
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Sparsest cut on quotients of the hypercube
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
A PRG for lipschitz functions of polynomials with applications to sparsest cut
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
Mathematics of Operations Research
| Hi-index | 0.00 |