Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Constraints and universal algebra
Annals of Mathematics and Artificial Intelligence
Constraint Satisfaction Problems and Finite Algebras
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
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
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
New tractable constraint classes from old
Exploring artificial intelligence in the new millennium
New Tractable Classes From Old
Constraints
SIGACT news complexity theory column 43
ACM SIGACT News
Implementing a Test for Tractability
Constraints
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
The expressive rate of constraints
Annals of Mathematics and Artificial Intelligence
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Empirical Modelling of Genetic Algorithms
Evolutionary Computation
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
The complexity of soft constraint satisfaction
Artificial Intelligence
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
Digraph matrix partitions and trigraph homomorphisms
Discrete Applied Mathematics
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science
Relatively quantified constraint satisfaction
Constraints
Complexity of Constraints
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Partial Polymorphisms and Constraint Satisfaction Problems
Complexity of Constraints
On the Computational Complexity of Monotone Constraint Satisfaction Problems
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Existentially restricted quantified constraint satisfaction
Information and Computation
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
A note on some collapse results of valued constraints
Information Processing Letters
Tricolorable torus knots are NP-complete
Proceedings of the 47th Annual Southeast Regional Conference
Hybrid tractable CSPs which generalize tree structure
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Approximability of the Maximum Solution Problem for Certain Families of Algebras
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Amalgams of constraint satisfaction problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics
The complexity of soft constraint satisfaction
Artificial Intelligence
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
The expressive power of valued constraints: hierarchies and collapses
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic (TOCL)
Testing expressibility is hard
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A new hybrid tractable class of soft constraint problems
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Extensions of the minimum cost homomorphism problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Maltsev digraphs have a majority polymorphism
European Journal of Combinatorics
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
A New Proof of the $H$-Coloring Dichotomy
SIAM Journal on Discrete Mathematics
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
A monoidal interval of clones of selfdual functions
Journal of Automata, Languages and Combinatorics
Hybrid tractability of valued constraint problems
Artificial Intelligence
Note: The Ck-extended graft construction
Discrete Applied Mathematics
Enumerating all solutions of a boolean CSP by non-decreasing weight
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
An algebraic theory of complexity for valued constraints: establishing a Galois connection
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The Complexity of Positive First-Order Logic without Equality
ACM Transactions on Computational Logic (TOCL)
Quantified Equality Constraints
SIAM Journal on Computing
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Typed guarded decompositions for constraint satisfaction
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Looking algebraically at tractable quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On the tractability of smooth constraint satisfaction problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Systems of equations over finite semigroups and the #CSP dichotomy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations 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
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics
Discrete-time temporal reasoning with horn DLRs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Meditations on quantified constraint satisfaction
Logic and Program Semantics
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Universal algebra and hardness results for constraint satisfaction problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Computational complexity of linear constraints over the integers
Artificial Intelligence
Weak near-unanimity functions and digraph homomorphism problems
Theoretical Computer Science
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On galois connections and soft computing
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
An algebraic characterization of testable boolean CSPs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
Do hard SAT-related reasoning tasks become easier in the Krom fragment?
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 5.23 |