Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
New Tractable Classes from Old
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
New Tractable Classes From Old
Constraints
Implementing a Test for Tractability
Constraints
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
There are no pure relational width 2 constraint satisfaction problems
Information Processing Letters
Relatively quantified constraint satisfaction
Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Existentially restricted quantified constraint satisfaction
Information and Computation
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Theoretical Computer Science
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Tree dualities for constraint satisfaction
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects 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
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Datalog and constraint satisfaction with infinite templates
Journal of Computer and System Sciences
The power of linear programming for finite-valued CSPs: a constructive characterization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Constraint satisfaction tractability from semi-lattice operations on infinite sets
ACM Transactions on Computational Logic (TOCL)
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
Semilattice polymorphisms and chordal graphs
European Journal of Combinatorics
| Hi-index | 0.00 |