On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Randomized algorithms
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Approximation algorithms for Steiner and directed multicuts
Journal of Algorithms
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Approximating Satisfiable Satisfiability Problems (Extended Abstract)
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Derandomizing semidefinite programming based approximation algorithms
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second 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
Linear-time recognition of bipartite graphs plus two edges
Discrete Mathematics
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
The complexity of minimal satisfiability problems
Information and Computation
SIGACT news complexity theory column 43
ACM SIGACT News
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
Discrete Applied Mathematics
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Transactions on Algorithms (TALG)
Fast SDP algorithms for constraint satisfaction problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On 2-query codeword testing with near-perfect completeness
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |