Implications of forbidden structures for extremal algorithmic problems

On the approximation of maximum satisfiability

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

Locally satisfiable formulas

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 new bound for 3-satisfiable maxsat and its algorithmic application

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory

An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problems

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

A new bound for 3-satisfiable MaxSat and its algorithmic application

Information and Computation