Some simplified NP-complete problems
STOC '74 Proceedings of the sixth 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
A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
Approximation and Intractability Results for the Maximum Cut Problem and Its Variants
IEEE Transactions on Computers
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for MAX SAT
Journal of Algorithms
Discrete Applied Mathematics
Tight Bound on Johnson's Algoritihm for Max-SAT
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A logical study of partial entailment
Journal of Artificial Intelligence Research
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Locally consistent constraint satisfaction problems with binary constraints
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Solving weighted MAX-SAT via global equilibrium search
Operations Research Letters
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
A new algorithm for parameterized MAX-SAT
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation
| Hi-index | 0.01 |