Approximation and Intractability Results for the Maximum Cut Problem and Its Variants
IEEE Transactions on Computers
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the sum of the largest eigenvalues of a symmetric matrix
SIAM Journal on Matrix Analysis and Applications
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Combinatorial properties and complexity of a max-cut approximation
European Journal of Combinatorics
Laplacian eigenvalues and the maximum cut problem
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B - Special issue: Festschrift in Honor of Philip Wolfe part II: studies in nonlinear programming
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
P-Complete Approximation Problems
Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximate solutions to problems in PSPACE
ACM SIGACT News
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized graph products, chromatic numbers, and Lovasz j-function
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Partitioning K clones: hardness results and practical algorithms for the K-populations problem
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering for VLSI Applications
IEEE Transactions on Computers
Path optimization and near-greedy analysis for graph partitioning: an empirical study
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Network design and improvement
ACM Computing Surveys (CSUR)
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Lagrangian bounds in multiextremal polynomial and discrete optimization problems
Journal of Global Optimization
Computational Experience with Ill-Posed Problems in Semidefinite Programming
Computational Optimization and Applications
Improved approximation algorithms for MAX SAT
Journal of Algorithms
On the complexity of the maximum cut problem
Nordic Journal of Computing
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximation algorithms for the maximum satisfiability problem
Nordic Journal of Computing
Randomized approximations of the constraint satisfaction problem
Nordic Journal of Computing
Coloring 2-colorable hypergraphs with a sublinear number of colors
Nordic Journal of Computing
A combinatorial algorithm for MAX CSP
Information Processing Letters
Problems and results on judicious partitions
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Mining newsgroups using networks arising from social behavior
WWW '03 Proceedings of the 12th international conference on World Wide Web
The bundle method for hard combinatorial optimization problems
Combinatorial optimization - Eureka, you shrink!
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences - STOC 2002
Mathematical sciences in the nineties
IBM Journal of Research and Development
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Discrete Applied Mathematics
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
Holographic algorithms: guest column
ACM SIGACT News
Canonical subsets of image features
Computer Vision and Image Understanding
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
An approximation algorithm for max p-section
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
Energy efficient monitoring in sensor networks
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Optimal parameterized rectangular coverings
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
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
ESA'11 Proceedings of the 19th European conference on Algorithms
Clustering pairwise distances with missing data: maximum cuts versus normalized cuts
DS'06 Proceedings of the 9th international conference on Discovery Science
Towards optimal integrality gaps for hypergraph vertex cover in the lovász-schrijver hierarchy
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Overlaying multiple maps efficiently
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
A cut-based heuristic to produce almost feasible periodic railway timetables
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient 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
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Ellipsoidal bounds for uncertain linear equations and dynamical systems
Automatica (Journal of IFAC)
The expected relative error of the polyhedral approximation of the max-cut problem
Operations Research Letters
On dependent randomized rounding algorithms
Operations Research Letters
Semi-supervised learning using greedy max-cut
The Journal of Machine Learning Research
Application of a MAX-CUT Heuristic to the Contig Orientation Problem in Genome Assembly
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Approximation of rank function and its application to the nearest low-rank correlation matrix
Journal of Global Optimization
| Hi-index | 0.01 |